./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/cstrpbrk_malloc.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8fc3dc66 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_malloc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 8edf581f64d166b4408dcbe4d1c200d90abc56f787561a55f3b270257b320de9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 19:59:12,623 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 19:59:12,675 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-17 19:59:12,678 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 19:59:12,679 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 19:59:12,679 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-17 19:59:12,692 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 19:59:12,693 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 19:59:12,693 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 19:59:12,693 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 19:59:12,693 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 19:59:12,693 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 19:59:12,694 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 19:59:12,694 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 19:59:12,694 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-17 19:59:12,694 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-17 19:59:12,694 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-17 19:59:12,694 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-17 19:59:12,694 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-17 19:59:12,694 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-17 19:59:12,694 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 19:59:12,694 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-17 19:59:12,694 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 19:59:12,695 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 19:59:12,695 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-17 19:59:12,695 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-17 19:59:12,695 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-17 19:59:12,695 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 19:59:12,695 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 19:59:12,695 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-17 19:59:12,695 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 19:59:12,695 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 19:59:12,695 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 19:59:12,695 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 19:59:12,695 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 19:59:12,696 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 19:59:12,696 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-17 19:59:12,696 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 -> 8edf581f64d166b4408dcbe4d1c200d90abc56f787561a55f3b270257b320de9 [2025-03-17 19:59:12,909 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 19:59:12,916 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 19:59:12,918 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 19:59:12,919 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 19:59:12,919 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 19:59:12,920 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/cstrpbrk_malloc.i [2025-03-17 19:59:14,044 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/788b8d69a/091cd7be98454f7da1970285449516ce/FLAGc3e34ca4b [2025-03-17 19:59:14,294 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 19:59:14,294 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrpbrk_malloc.i [2025-03-17 19:59:14,301 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/788b8d69a/091cd7be98454f7da1970285449516ce/FLAGc3e34ca4b [2025-03-17 19:59:14,624 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/788b8d69a/091cd7be98454f7da1970285449516ce [2025-03-17 19:59:14,626 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 19:59:14,627 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 19:59:14,627 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 19:59:14,628 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 19:59:14,630 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 19:59:14,631 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:59:14" (1/1) ... [2025-03-17 19:59:14,631 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bfa3535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:59:14, skipping insertion in model container [2025-03-17 19:59:14,632 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:59:14" (1/1) ... [2025-03-17 19:59:14,653 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 19:59:14,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:59:14,888 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 19:59:14,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:59:14,948 INFO L204 MainTranslator]: Completed translation [2025-03-17 19:59:14,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:59:14 WrapperNode [2025-03-17 19:59:14,949 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 19:59:14,949 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 19:59:14,949 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 19:59:14,949 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 19:59:14,954 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:59:14" (1/1) ... [2025-03-17 19:59:14,962 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:59:14" (1/1) ... [2025-03-17 19:59:14,976 INFO L138 Inliner]: procedures = 152, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 71 [2025-03-17 19:59:14,976 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 19:59:14,977 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 19:59:14,977 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 19:59:14,977 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 19:59:14,983 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:59:14" (1/1) ... [2025-03-17 19:59:14,983 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:59:14" (1/1) ... [2025-03-17 19:59:14,985 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:59:14" (1/1) ... [2025-03-17 19:59:14,992 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-17 19:59:14,993 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:59:14" (1/1) ... [2025-03-17 19:59:14,993 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:59:14" (1/1) ... [2025-03-17 19:59:14,996 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:59:14" (1/1) ... [2025-03-17 19:59:14,997 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:59:14" (1/1) ... [2025-03-17 19:59:14,997 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:59:14" (1/1) ... [2025-03-17 19:59:14,998 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:59:14" (1/1) ... [2025-03-17 19:59:14,999 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 19:59:14,999 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 19:59:15,000 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 19:59:15,000 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 19:59:15,000 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:59:14" (1/1) ... [2025-03-17 19:59:15,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:15,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:15,023 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-17 19:59:15,025 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-17 19:59:15,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 19:59:15,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 19:59:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 19:59:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 19:59:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 19:59:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 19:59:15,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 19:59:15,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 19:59:15,096 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 19:59:15,098 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 19:59:15,210 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2025-03-17 19:59:15,211 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 19:59:15,217 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 19:59:15,217 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 19:59:15,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:59:15 BoogieIcfgContainer [2025-03-17 19:59:15,217 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 19:59:15,219 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-17 19:59:15,220 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-17 19:59:15,223 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-17 19:59:15,224 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:59:15,224 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.03 07:59:14" (1/3) ... [2025-03-17 19:59:15,224 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@16fae694 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 07:59:15, skipping insertion in model container [2025-03-17 19:59:15,224 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:59:15,225 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:59:14" (2/3) ... [2025-03-17 19:59:15,225 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@16fae694 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 07:59:15, skipping insertion in model container [2025-03-17 19:59:15,225 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:59:15,225 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:59:15" (3/3) ... [2025-03-17 19:59:15,226 INFO L363 chiAutomizerObserver]: Analyzing ICFG cstrpbrk_malloc.i [2025-03-17 19:59:15,257 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-17 19:59:15,258 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-17 19:59:15,258 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-17 19:59:15,258 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-17 19:59:15,258 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-17 19:59:15,258 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-17 19:59:15,258 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-17 19:59:15,258 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-17 19:59:15,261 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:59:15,271 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-17 19:59:15,271 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:59:15,271 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:59:15,274 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-17 19:59:15,274 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-17 19:59:15,274 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-17 19:59:15,274 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:59:15,275 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-17 19:59:15,275 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:59:15,275 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:59:15,275 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-17 19:59:15,275 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-17 19:59:15,280 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.allocOnHeap(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;havoc main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnHeap(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;havoc 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 + (main_~length2~0#1 - 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-17 19:59:15,280 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-17 19:59:15,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:59:15,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1784414, now seen corresponding path program 1 times [2025-03-17 19:59:15,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:59:15,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430862389] [2025-03-17 19:59:15,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:59:15,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:59:15,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:59:15,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:59:15,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:15,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:59:15,381 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:59:15,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:59:15,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:59:15,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:15,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:59:15,423 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:59:15,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:59:15,426 INFO L85 PathProgramCache]: Analyzing trace with hash 48634543, now seen corresponding path program 1 times [2025-03-17 19:59:15,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:59:15,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755479735] [2025-03-17 19:59:15,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:59:15,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:59:15,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 19:59:15,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 19:59:15,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:15,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:59:15,470 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-17 19:59:15,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:59:15,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755479735] [2025-03-17 19:59:15,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755479735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:59:15,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:59:15,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:59:15,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733151102] [2025-03-17 19:59:15,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:59:15,475 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:59:15,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:59:15,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 19:59:15,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 19:59:15,497 INFO L87 Difference]: Start difference. First operand has 15 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-17 19:59:15,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:59:15,501 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2025-03-17 19:59:15,501 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 20 transitions. [2025-03-17 19:59:15,502 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-17 19:59:15,505 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 11 states and 15 transitions. [2025-03-17 19:59:15,506 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2025-03-17 19:59:15,506 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2025-03-17 19:59:15,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 15 transitions. [2025-03-17 19:59:15,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 19:59:15,507 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 15 transitions. [2025-03-17 19:59:15,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 15 transitions. [2025-03-17 19:59:15,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-03-17 19:59:15,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:59:15,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2025-03-17 19:59:15,523 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 15 transitions. [2025-03-17 19:59:15,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 19:59:15,526 INFO L432 stractBuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2025-03-17 19:59:15,526 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-17 19:59:15,526 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2025-03-17 19:59:15,526 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-17 19:59:15,526 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:59:15,526 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:59:15,526 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-17 19:59:15,527 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:59:15,527 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.allocOnHeap(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;havoc main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnHeap(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;havoc 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 + (main_~length2~0#1 - 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-17 19:59:15,527 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-17 19:59:15,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:59:15,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1784414, now seen corresponding path program 2 times [2025-03-17 19:59:15,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:59:15,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876241647] [2025-03-17 19:59:15,527 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:59:15,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:59:15,542 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:59:15,559 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:59:15,560 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:59:15,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:59:15,560 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:59:15,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:59:15,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:59:15,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:15,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:59:15,577 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:59:15,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:59:15,578 INFO L85 PathProgramCache]: Analyzing trace with hash -507614900, now seen corresponding path program 1 times [2025-03-17 19:59:15,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:59:15,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185440628] [2025-03-17 19:59:15,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:59:15,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:59:15,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:59:15,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:59:15,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:15,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:59:15,598 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:59:15,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:59:15,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:59:15,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:15,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:59:15,613 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:59:15,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:59:15,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1580940367, now seen corresponding path program 1 times [2025-03-17 19:59:15,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:59:15,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100418487] [2025-03-17 19:59:15,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:59:15,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:59:15,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 19:59:15,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 19:59:15,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:15,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:59:15,649 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:59:15,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 19:59:15,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 19:59:15,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:15,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:59:15,686 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:59:16,391 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:59:16,391 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:59:16,391 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:59:16,391 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:59:16,392 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:59:16,392 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:16,392 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:59:16,392 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:59:16,392 INFO L132 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_malloc.i_Iteration2_Lasso [2025-03-17 19:59:16,392 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:59:16,392 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:59:16,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:16,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:16,411 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:16,412 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:16,415 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:16,417 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:16,419 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:16,421 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:16,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:16,425 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:16,700 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:16,702 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:16,703 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:16,705 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:16,706 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:16,708 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:16,710 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:16,711 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:16,713 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:16,715 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:16,717 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:16,719 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:16,721 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:16,723 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:16,725 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:16,726 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:16,727 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:16,729 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:16,731 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:17,198 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:59:17,200 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:59:17,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:17,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:17,204 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-17 19:59:17,205 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-17 19:59:17,206 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-17 19:59:17,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:17,217 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:59:17,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:17,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:17,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:17,220 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:59:17,221 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:59:17,222 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:17,229 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-17 19:59:17,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:17,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:17,231 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-17 19:59:17,233 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-17 19:59:17,234 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:59:17,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:17,244 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:59:17,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:17,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:17,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:17,245 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:59:17,245 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:59:17,246 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:17,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-03-17 19:59:17,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:17,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:17,254 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-17 19:59:17,255 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-17 19:59:17,258 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-17 19:59:17,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:17,267 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:59:17,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:17,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:17,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:17,268 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:59:17,268 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:59:17,269 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:17,276 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-17 19:59:17,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:17,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:17,278 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-17 19:59:17,280 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-17 19:59:17,281 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-17 19:59:17,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:17,292 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:59:17,292 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:17,292 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:17,292 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:17,293 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:59:17,293 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:59:17,294 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:17,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-03-17 19:59:17,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:17,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:17,305 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-17 19:59:17,306 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-17 19:59:17,307 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-17 19:59:17,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:17,318 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:59:17,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:17,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:17,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:17,319 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:59:17,319 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:59:17,320 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:17,326 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-17 19:59:17,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:17,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:17,328 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-17 19:59:17,330 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-17 19:59:17,331 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-17 19:59:17,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:17,342 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:59:17,342 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:17,342 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:17,342 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:17,344 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:59:17,344 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:59:17,345 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:17,351 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-17 19:59:17,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:17,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:17,354 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-17 19:59:17,355 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-17 19:59:17,357 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-17 19:59:17,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:17,367 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:59:17,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:17,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:17,367 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:17,368 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:59:17,368 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:59:17,369 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:17,375 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-17 19:59:17,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:17,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:17,378 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-17 19:59:17,379 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-17 19:59:17,380 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-17 19:59:17,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:17,390 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:59:17,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:17,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:17,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:17,391 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:59:17,391 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:59:17,394 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:17,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-03-17 19:59:17,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:17,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:17,403 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-17 19:59:17,404 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-17 19:59:17,406 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-17 19:59:17,415 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:17,416 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:59:17,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:17,416 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:17,416 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:17,416 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:59:17,416 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:59:17,418 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:17,424 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-17 19:59:17,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:17,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:17,426 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-17 19:59:17,428 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-17 19:59:17,429 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-17 19:59:17,439 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:17,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:17,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:17,440 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:17,446 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:59:17,446 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:59:17,454 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:59:17,482 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2025-03-17 19:59:17,483 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-03-17 19:59:17,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:17,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:17,489 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-17 19:59:17,489 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-17 19:59:17,490 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:59:17,501 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 19:59:17,501 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:59:17,502 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~nondetString1~0#1.base)_1, ULTIMATE.start_cstrpbrk_~sc1~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_~nondetString1~0#1.base)_1 - 1*ULTIMATE.start_cstrpbrk_~sc1~0#1.offset Supporting invariants [] [2025-03-17 19:59:17,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-03-17 19:59:17,527 INFO L156 tatePredicateManager]: 9 out of 10 supporting invariants were superfluous and have been removed [2025-03-17 19:59:17,532 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~sc1~0!offset [2025-03-17 19:59:17,533 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-17 19:59:17,533 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-17 19:59:17,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:59:17,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:59:17,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:59:17,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:17,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:59:17,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 19:59:17,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:59:17,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:59:17,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:59:17,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:17,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:59:17,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 19:59:17,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:59:17,643 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-17 19:59:17,645 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-17 19:59:17,646 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-17 19:59:17,695 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 18 states and 25 transitions. Complement of second has 4 states. [2025-03-17 19:59:17,695 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-17 19:59:17,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-17 19:59:17,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2025-03-17 19:59:17,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 4 letters. Loop has 7 letters. [2025-03-17 19:59:17,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:59:17,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 11 letters. Loop has 7 letters. [2025-03-17 19:59:17,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:59:17,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 4 letters. Loop has 14 letters. [2025-03-17 19:59:17,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:59:17,701 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 25 transitions. [2025-03-17 19:59:17,702 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 19:59:17,702 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 16 states and 23 transitions. [2025-03-17 19:59:17,702 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-17 19:59:17,702 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-17 19:59:17,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 23 transitions. [2025-03-17 19:59:17,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:59:17,702 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 23 transitions. [2025-03-17 19:59:17,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 23 transitions. [2025-03-17 19:59:17,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-03-17 19:59:17,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.4375) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:59:17,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2025-03-17 19:59:17,703 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 23 transitions. [2025-03-17 19:59:17,703 INFO L432 stractBuchiCegarLoop]: Abstraction has 16 states and 23 transitions. [2025-03-17 19:59:17,703 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-17 19:59:17,703 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 23 transitions. [2025-03-17 19:59:17,705 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 19:59:17,705 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:59:17,705 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:59:17,705 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-03-17 19:59:17,705 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 19:59:17,705 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet213#1, main_#t~nondet214#1, main_#t~malloc215#1.base, main_#t~malloc215#1.offset, main_#t~malloc216#1.base, main_#t~malloc216#1.offset, main_#t~ret217#1.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.allocOnHeap(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;havoc main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnHeap(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;havoc 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 + (main_~length2~0#1 - 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-17 19:59:17,705 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, 1 + cstrpbrk_#t~post210#1.offset;" [2025-03-17 19:59:17,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:59:17,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1714822525, now seen corresponding path program 1 times [2025-03-17 19:59:17,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:59:17,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901072422] [2025-03-17 19:59:17,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:59:17,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:59:17,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:59:17,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:59:17,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:17,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:59:17,741 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:59:17,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:59:17,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:59:17,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:17,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:59:17,762 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:59:17,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:59:17,763 INFO L85 PathProgramCache]: Analyzing trace with hash 44621, now seen corresponding path program 1 times [2025-03-17 19:59:17,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:59:17,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476190185] [2025-03-17 19:59:17,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:59:17,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:59:17,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:59:17,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:59:17,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:17,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:59:17,769 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:59:17,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:59:17,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:59:17,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:17,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:59:17,777 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:59:17,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:59:17,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1936838481, now seen corresponding path program 1 times [2025-03-17 19:59:17,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:59:17,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127236012] [2025-03-17 19:59:17,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:59:17,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:59:17,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 19:59:17,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 19:59:17,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:17,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:59:17,795 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:59:17,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 19:59:17,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 19:59:17,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:17,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:59:17,818 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:59:17,943 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-17 19:59:18,431 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:59:18,431 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:59:18,431 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:59:18,431 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:59:18,431 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:59:18,431 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:18,431 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:59:18,431 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:59:18,431 INFO L132 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_malloc.i_Iteration3_Lasso [2025-03-17 19:59:18,431 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:59:18,431 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:59:18,433 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:18,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:18,436 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:18,439 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:18,440 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:18,442 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:18,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:18,445 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:18,446 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:18,447 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:18,449 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:18,450 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:18,451 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:18,453 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:18,454 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:18,456 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:18,457 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:18,458 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:18,460 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:18,461 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:18,463 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:18,465 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:18,466 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:18,468 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:18,636 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:18,638 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:18,640 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:18,641 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:19,083 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:59:19,083 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:59:19,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:19,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:19,089 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-17 19:59:19,092 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-17 19:59:19,092 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-17 19:59:19,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:19,105 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:59:19,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:19,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:19,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:19,105 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:59:19,105 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:59:19,106 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:19,112 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-17 19:59:19,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:19,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:19,114 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-17 19:59:19,115 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-17 19:59:19,117 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-17 19:59:19,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:19,129 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:59:19,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:19,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:19,129 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:19,129 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:59:19,129 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:59:19,130 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:19,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-03-17 19:59:19,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:19,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:19,167 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-17 19:59:19,168 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-17 19:59:19,169 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-17 19:59:19,178 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:19,179 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:59:19,179 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:19,179 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:19,179 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:19,179 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:59:19,179 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:59:19,180 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:19,187 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-17 19:59:19,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:19,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:19,189 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-17 19:59:19,191 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-17 19:59:19,192 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-17 19:59:19,201 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:19,201 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:59:19,201 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:19,201 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:19,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:19,206 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:59:19,206 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:59:19,207 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:19,213 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-17 19:59:19,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:19,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:19,215 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-17 19:59:19,217 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-17 19:59:19,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-17 19:59:19,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:19,228 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:59:19,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:19,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:19,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:19,228 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:59:19,228 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:59:19,229 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:19,234 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-17 19:59:19,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:19,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:19,236 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-17 19:59:19,237 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-17 19:59:19,238 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-17 19:59:19,248 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:19,248 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:59:19,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:19,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:19,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:19,249 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:59:19,249 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:59:19,250 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:19,255 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-17 19:59:19,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:19,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:19,257 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-17 19:59:19,258 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-17 19:59:19,259 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-17 19:59:19,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:19,269 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:59:19,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:19,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:19,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:19,269 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:59:19,269 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:59:19,270 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:19,275 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-17 19:59:19,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:19,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:19,277 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-17 19:59:19,278 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-17 19:59:19,279 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-17 19:59:19,289 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:19,289 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:59:19,289 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:19,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:19,289 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:19,289 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:59:19,290 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:59:19,291 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:19,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-03-17 19:59:19,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:19,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:19,298 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-17 19:59:19,298 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-17 19:59:19,299 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-17 19:59:19,309 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:19,309 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:59:19,309 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:19,309 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:19,309 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:19,309 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:59:19,309 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:59:19,310 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:19,316 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-17 19:59:19,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:19,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:19,318 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-17 19:59:19,319 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-17 19:59:19,319 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-17 19:59:19,329 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:19,329 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:59:19,329 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:19,329 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:19,329 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:19,330 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:59:19,330 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:59:19,331 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:19,337 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-17 19:59:19,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:19,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:19,339 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-17 19:59:19,341 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-17 19:59:19,342 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:59:19,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:19,351 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:59:19,351 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:19,351 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:19,351 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:19,352 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:59:19,352 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:59:19,353 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:19,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-03-17 19:59:19,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:19,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:19,360 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-17 19:59:19,361 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-17 19:59:19,361 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-17 19:59:19,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:19,371 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:59:19,371 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:19,371 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:19,371 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:19,372 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:59:19,372 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:59:19,373 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:19,378 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-17 19:59:19,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:19,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:19,380 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-17 19:59:19,380 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-17 19:59:19,381 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-17 19:59:19,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:19,391 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:59:19,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:19,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:19,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:19,391 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:59:19,392 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:59:19,392 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:19,398 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-17 19:59:19,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:19,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:19,399 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-17 19:59:19,400 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-17 19:59:19,401 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-17 19:59:19,411 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:19,411 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:59:19,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:19,411 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:19,411 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:19,411 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:59:19,411 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:59:19,412 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:19,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-03-17 19:59:19,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:19,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:19,420 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-17 19:59:19,421 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-17 19:59:19,422 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-17 19:59:19,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:19,432 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:59:19,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:19,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:19,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:19,436 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:59:19,436 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:59:19,437 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:19,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-03-17 19:59:19,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:19,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:19,444 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-17 19:59:19,445 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-17 19:59:19,446 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-17 19:59:19,455 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:19,455 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:59:19,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:19,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:19,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:19,456 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:59:19,456 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:59:19,457 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:19,462 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-17 19:59:19,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:19,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:19,464 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-17 19:59:19,465 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-17 19:59:19,466 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-17 19:59:19,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:19,475 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:59:19,475 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:19,475 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:19,475 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:19,476 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:59:19,476 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:59:19,477 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:19,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-03-17 19:59:19,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:19,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:19,484 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-17 19:59:19,486 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-17 19:59:19,486 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-17 19:59:19,496 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:19,496 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:59:19,496 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:19,496 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:19,496 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:19,496 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:59:19,496 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:59:19,497 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:19,503 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-17 19:59:19,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:19,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:19,504 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-17 19:59:19,506 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-17 19:59:19,507 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:59:19,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:19,516 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:59:19,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:19,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:19,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:19,517 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:59:19,517 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:59:19,518 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:19,523 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-17 19:59:19,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:19,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:19,526 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-17 19:59:19,527 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-17 19:59:19,527 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-17 19:59:19,537 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:19,537 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:59:19,537 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:19,537 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:19,537 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:19,537 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:59:19,538 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:59:19,539 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:19,544 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-17 19:59:19,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:19,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:19,547 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-17 19:59:19,548 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-17 19:59:19,549 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-17 19:59:19,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:19,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:19,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:19,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:19,560 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:59:19,560 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:59:19,563 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:19,568 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-17 19:59:19,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:19,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:19,570 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-17 19:59:19,572 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-17 19:59:19,573 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-17 19:59:19,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:19,583 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:59:19,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:19,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:19,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:19,584 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:59:19,584 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:59:19,585 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:19,590 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-17 19:59:19,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:19,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:19,592 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-17 19:59:19,594 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-17 19:59:19,595 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:59:19,605 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:19,605 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:59:19,605 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:19,605 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:19,605 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:19,606 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:59:19,606 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:59:19,607 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:19,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2025-03-17 19:59:19,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:19,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:19,616 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-17 19:59:19,618 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-17 19:59:19,619 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:59:19,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:19,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:19,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:19,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:19,633 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:59:19,634 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:59:19,641 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:59:19,657 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2025-03-17 19:59:19,658 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-03-17 19:59:19,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:19,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:19,660 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-17 19:59:19,662 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-17 19:59:19,662 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:59:19,674 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 19:59:19,674 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:59:19,674 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrpbrk_~s~0#1.offset, v_rep(select #length ULTIMATE.start_main_~nondetString2~0#1.base)_2) = -1*ULTIMATE.start_cstrpbrk_~s~0#1.offset + 1*v_rep(select #length ULTIMATE.start_main_~nondetString2~0#1.base)_2 Supporting invariants [] [2025-03-17 19:59:19,680 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-17 19:59:19,691 INFO L156 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2025-03-17 19:59:19,693 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2025-03-17 19:59:19,693 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-17 19:59:19,693 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-17 19:59:19,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:59:19,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:59:19,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:59:19,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:19,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:59:19,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 19:59:19,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:59:19,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:59:19,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:59:19,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:19,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:59:19,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 19:59:19,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:59:19,785 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-17 19:59:19,785 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2025-03-17 19:59:19,786 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 23 transitions. cyclomatic complexity: 9 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:59:19,826 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 23 transitions. cyclomatic complexity: 9. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 31 states and 44 transitions. Complement of second has 6 states. [2025-03-17 19:59:19,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-17 19:59:19,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:59:19,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2025-03-17 19:59:19,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 6 letters. Loop has 3 letters. [2025-03-17 19:59:19,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:59:19,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 9 letters. Loop has 3 letters. [2025-03-17 19:59:19,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:59:19,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 6 letters. Loop has 6 letters. [2025-03-17 19:59:19,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:59:19,829 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 44 transitions. [2025-03-17 19:59:19,829 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 19:59:19,830 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 23 states and 32 transitions. [2025-03-17 19:59:19,830 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2025-03-17 19:59:19,830 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-17 19:59:19,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 32 transitions. [2025-03-17 19:59:19,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:59:19,830 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23 states and 32 transitions. [2025-03-17 19:59:19,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 32 transitions. [2025-03-17 19:59:19,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2025-03-17 19:59:19,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 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-17 19:59:19,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2025-03-17 19:59:19,831 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 31 transitions. [2025-03-17 19:59:19,832 INFO L432 stractBuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2025-03-17 19:59:19,832 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-17 19:59:19,832 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2025-03-17 19:59:19,836 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 19:59:19,836 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:59:19,836 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:59:19,836 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:59:19,836 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 19:59:19,836 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.allocOnHeap(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;havoc main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnHeap(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;havoc 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 + (main_~length2~0#1 - 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-17 19:59:19,836 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, 1 + cstrpbrk_#t~post210#1.offset;" [2025-03-17 19:59:19,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:59:19,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1106100275, now seen corresponding path program 1 times [2025-03-17 19:59:19,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:59:19,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042138909] [2025-03-17 19:59:19,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:59:19,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:59:19,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:59:19,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:59:19,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:19,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:59:19,955 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-17 19:59:19,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:59:19,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042138909] [2025-03-17 19:59:19,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042138909] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:59:19,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:59:19,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 19:59:19,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264717032] [2025-03-17 19:59:19,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:59:19,956 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-17 19:59:19,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:59:19,956 INFO L85 PathProgramCache]: Analyzing trace with hash 44621, now seen corresponding path program 2 times [2025-03-17 19:59:19,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:59:19,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673973637] [2025-03-17 19:59:19,956 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:59:19,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:59:19,958 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:59:19,960 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:59:19,960 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:59:19,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:59:19,960 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:59:19,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:59:19,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:59:19,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:19,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:59:19,963 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:59:20,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:59:20,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 19:59:20,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 19:59:20,056 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. cyclomatic complexity: 12 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 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-17 19:59:20,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:59:20,102 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2025-03-17 19:59:20,102 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 37 transitions. [2025-03-17 19:59:20,102 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-17 19:59:20,103 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 25 states and 33 transitions. [2025-03-17 19:59:20,103 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-17 19:59:20,103 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-17 19:59:20,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 33 transitions. [2025-03-17 19:59:20,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:59:20,103 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 33 transitions. [2025-03-17 19:59:20,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 33 transitions. [2025-03-17 19:59:20,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2025-03-17 19:59:20,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 22 states have internal predecessors, (31), 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-17 19:59:20,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2025-03-17 19:59:20,104 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 31 transitions. [2025-03-17 19:59:20,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 19:59:20,106 INFO L432 stractBuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2025-03-17 19:59:20,106 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-17 19:59:20,106 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 31 transitions. [2025-03-17 19:59:20,107 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 19:59:20,107 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:59:20,107 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:59:20,107 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:59:20,107 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 19:59:20,107 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.allocOnHeap(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;havoc main_#t~malloc215#1.base, main_#t~malloc215#1.offset;call main_#t~malloc216#1.base, main_#t~malloc216#1.offset := #Ultimate.allocOnHeap(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;havoc 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 + (main_~length2~0#1 - 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-17 19:59:20,107 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, 1 + cstrpbrk_#t~post210#1.offset;" [2025-03-17 19:59:20,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:59:20,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1134729426, now seen corresponding path program 2 times [2025-03-17 19:59:20,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:59:20,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196625842] [2025-03-17 19:59:20,108 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:59:20,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:59:20,116 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-17 19:59:20,128 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:59:20,128 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:59:20,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:59:20,129 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:59:20,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:59:20,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:59:20,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:20,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:59:20,145 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:59:20,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:59:20,154 INFO L85 PathProgramCache]: Analyzing trace with hash 44621, now seen corresponding path program 3 times [2025-03-17 19:59:20,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:59:20,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982958470] [2025-03-17 19:59:20,154 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:59:20,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:59:20,157 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:59:20,158 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:59:20,158 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 19:59:20,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:59:20,158 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:59:20,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:59:20,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:59:20,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:20,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:59:20,161 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:59:20,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:59:20,162 INFO L85 PathProgramCache]: Analyzing trace with hash 963271680, now seen corresponding path program 1 times [2025-03-17 19:59:20,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:59:20,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009686494] [2025-03-17 19:59:20,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:59:20,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:59:20,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 19:59:20,170 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-17 19:59:20,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 19:59:20,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:20,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:59:20,184 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:59:20,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 19:59:20,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 19:59:20,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:20,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:59:20,203 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:59:21,015 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:59:21,016 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:59:21,016 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:59:21,016 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:59:21,016 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:59:21,016 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:21,016 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:59:21,016 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:59:21,016 INFO L132 ssoRankerPreferences]: Filename of dumped script: cstrpbrk_malloc.i_Iteration5_Lasso [2025-03-17 19:59:21,016 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:59:21,016 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:59:21,018 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:21,019 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:21,287 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:21,288 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:21,290 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:21,291 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:21,292 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:21,296 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:21,300 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:21,301 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:21,302 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:21,303 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:21,305 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:21,306 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:21,307 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:21,308 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:21,310 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:21,311 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:21,312 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:21,317 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:21,318 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:21,319 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:21,320 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:21,321 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:21,322 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:21,323 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:21,324 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:21,326 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:59:21,920 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:59:21,920 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:59:21,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:21,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:21,921 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-17 19:59:21,923 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-17 19:59:21,924 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-17 19:59:21,934 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:21,934 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:59:21,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:21,934 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:21,934 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:21,934 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:59:21,934 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:59:21,935 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:59:21,940 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-17 19:59:21,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:21,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:21,942 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-17 19:59:21,943 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-17 19:59:21,944 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:59:21,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:59:21,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:59:21,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:59:21,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:59:21,962 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:59:21,962 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:59:21,967 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:59:21,975 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-03-17 19:59:21,975 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 8 variables to zero. [2025-03-17 19:59:21,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:59:21,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:59:21,977 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-17 19:59:21,978 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-17 19:59:21,978 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:59:21,988 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-03-17 19:59:21,989 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:59:21,989 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 + 36893488147419103229 Supporting invariants [-1*v_rep(select #length ULTIMATE.start_cstrpbrk_~s~0#1.base)_2 + 18446744073709551615 >= 0] [2025-03-17 19:59:21,994 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-17 19:59:22,016 INFO L156 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2025-03-17 19:59:22,018 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2025-03-17 19:59:22,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:59:22,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:59:22,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:59:22,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:22,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:59:22,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 19:59:22,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:59:22,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2025-03-17 19:59:22,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 19:59:22,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:59:22,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:59:22,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:22,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:59:22,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 19:59:22,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:59:22,151 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-17 19:59:22,151 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2025-03-17 19:59:22,151 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 31 transitions. cyclomatic complexity: 11 Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:59:22,185 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 31 transitions. cyclomatic complexity: 11. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 29 states and 38 transitions. Complement of second has 6 states. [2025-03-17 19:59:22,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-17 19:59:22,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:59:22,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2025-03-17 19:59:22,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 13 letters. Loop has 3 letters. [2025-03-17 19:59:22,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:59:22,187 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:59:22,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:59:22,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:59:22,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:59:22,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:22,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:59:22,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 19:59:22,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:59:22,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-03-17 19:59:22,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:59:22,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:59:22,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:22,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:59:22,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 19:59:22,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:59:22,286 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-17 19:59:22,287 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2025-03-17 19:59:22,287 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 31 transitions. cyclomatic complexity: 11 Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:59:22,319 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 31 transitions. cyclomatic complexity: 11. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 29 states and 38 transitions. Complement of second has 6 states. [2025-03-17 19:59:22,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-17 19:59:22,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:59:22,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2025-03-17 19:59:22,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 13 letters. Loop has 3 letters. [2025-03-17 19:59:22,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:59:22,320 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:59:22,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:59:22,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:59:22,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:59:22,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:22,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:59:22,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 19:59:22,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:59:22,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-03-17 19:59:22,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:59:22,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:59:22,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:59:22,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:59:22,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 19:59:22,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:59:22,451 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-17 19:59:22,452 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2025-03-17 19:59:22,452 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 31 transitions. cyclomatic complexity: 11 Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:59:22,502 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 31 transitions. cyclomatic complexity: 11. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 34 states and 46 transitions. Complement of second has 5 states. [2025-03-17 19:59:22,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-17 19:59:22,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:59:22,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2025-03-17 19:59:22,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 13 letters. Loop has 3 letters. [2025-03-17 19:59:22,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:59:22,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 16 letters. Loop has 3 letters. [2025-03-17 19:59:22,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:59:22,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 13 letters. Loop has 6 letters. [2025-03-17 19:59:22,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:59:22,505 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 46 transitions. [2025-03-17 19:59:22,506 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-17 19:59:22,506 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 0 states and 0 transitions. [2025-03-17 19:59:22,507 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-17 19:59:22,507 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-17 19:59:22,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-17 19:59:22,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 19:59:22,507 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 19:59:22,507 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 19:59:22,507 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 19:59:22,507 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-17 19:59:22,507 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-17 19:59:22,507 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-17 19:59:22,507 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-17 19:59:22,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.03 07:59:22 BoogieIcfgContainer [2025-03-17 19:59:22,514 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-17 19:59:22,515 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 19:59:22,516 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 19:59:22,516 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 19:59:22,517 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:59:15" (3/4) ... [2025-03-17 19:59:22,518 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 19:59:22,519 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 19:59:22,519 INFO L158 Benchmark]: Toolchain (without parser) took 7892.71ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 112.8MB in the beginning and 94.5MB in the end (delta: 18.3MB). Peak memory consumption was 49.2MB. Max. memory is 16.1GB. [2025-03-17 19:59:22,519 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:59:22,520 INFO L158 Benchmark]: CACSL2BoogieTranslator took 321.37ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 94.2MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 19:59:22,520 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.44ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 92.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:59:22,520 INFO L158 Benchmark]: Boogie Preprocessor took 21.97ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 91.1MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 19:59:22,520 INFO L158 Benchmark]: IcfgBuilder took 219.41ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 77.2MB in the end (delta: 13.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 19:59:22,520 INFO L158 Benchmark]: BuchiAutomizer took 7295.07ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 77.2MB in the beginning and 94.5MB in the end (delta: -17.3MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. [2025-03-17 19:59:22,520 INFO L158 Benchmark]: Witness Printer took 3.67ms. Allocated memory is still 176.2MB. Free memory was 94.5MB in the beginning and 94.5MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:59:22,521 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 321.37ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 94.2MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.44ms. Allocated memory is still 142.6MB. Free memory was 94.2MB in the beginning and 92.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.97ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 91.1MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 219.41ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 77.2MB in the end (delta: 13.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 7295.07ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 77.2MB in the beginning and 94.5MB in the end (delta: -17.3MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. * Witness Printer took 3.67ms. Allocated memory is still 176.2MB. Free memory was 94.5MB in the beginning and 94.5MB 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: ~sc1~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~s~0!offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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 4 locations. One nondeterministic module has affine ranking function null and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.2s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 6.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.8s. 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, 80 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 80 mSDsluCounter, 138 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 60 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 85 IncrementalHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 78 mSDtfsCounter, 85 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital260 mio100 ax100 hnf100 lsp109 ukn59 mio100 lsp29 div173 bol100 ite100 ukn100 eq154 hnf96 smp67 dnf801 smp29 tf100 neg100 sie114 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 77ms VariablesStem: 4 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-03-17 19:59:22,536 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