./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted-lit/cstrcspn.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-crafted-lit/cstrcspn.c -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 475c55af8223c9a32959cab18313111543780f4e37aae19089bc5e981127ec42 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 06:49:07,279 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 06:49:07,330 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-09 06:49:07,335 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 06:49:07,337 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 06:49:07,337 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-09 06:49:07,356 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 06:49:07,357 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 06:49:07,357 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 06:49:07,358 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 06:49:07,358 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 06:49:07,358 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 06:49:07,359 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 06:49:07,359 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 06:49:07,359 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-09 06:49:07,359 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-09 06:49:07,359 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-09 06:49:07,359 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-09 06:49:07,359 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-09 06:49:07,359 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-09 06:49:07,360 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 06:49:07,360 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-09 06:49:07,360 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 06:49:07,360 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 06:49:07,360 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-09 06:49:07,360 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-09 06:49:07,360 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-09 06:49:07,360 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 06:49:07,360 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 06:49:07,360 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-09 06:49:07,361 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 06:49:07,361 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 06:49:07,361 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 06:49:07,361 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 06:49:07,361 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 06:49:07,361 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 06:49:07,361 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-09 06:49:07,361 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 -> 475c55af8223c9a32959cab18313111543780f4e37aae19089bc5e981127ec42 [2025-03-09 06:49:07,580 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 06:49:07,585 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 06:49:07,587 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 06:49:07,587 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 06:49:07,588 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 06:49:07,588 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/cstrcspn.c [2025-03-09 06:49:08,752 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac08bf87e/38a6e4573e43405fa7d233cd8a2db4fc/FLAG654a87a01 [2025-03-09 06:49:08,987 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 06:49:08,987 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/cstrcspn.c [2025-03-09 06:49:09,015 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac08bf87e/38a6e4573e43405fa7d233cd8a2db4fc/FLAG654a87a01 [2025-03-09 06:49:09,334 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac08bf87e/38a6e4573e43405fa7d233cd8a2db4fc [2025-03-09 06:49:09,337 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 06:49:09,338 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 06:49:09,340 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 06:49:09,340 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 06:49:09,343 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 06:49:09,344 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:49:09" (1/1) ... [2025-03-09 06:49:09,346 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e8d9a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:09, skipping insertion in model container [2025-03-09 06:49:09,346 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:49:09" (1/1) ... [2025-03-09 06:49:09,357 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 06:49:09,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:49:09,458 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 06:49:09,467 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:49:09,477 INFO L204 MainTranslator]: Completed translation [2025-03-09 06:49:09,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:09 WrapperNode [2025-03-09 06:49:09,478 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 06:49:09,479 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 06:49:09,479 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 06:49:09,479 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 06:49:09,483 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:09" (1/1) ... [2025-03-09 06:49:09,487 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:09" (1/1) ... [2025-03-09 06:49:09,497 INFO L138 Inliner]: procedures = 11, calls = 12, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 82 [2025-03-09 06:49:09,499 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 06:49:09,499 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 06:49:09,499 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 06:49:09,499 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 06:49:09,504 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:09" (1/1) ... [2025-03-09 06:49:09,505 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:09" (1/1) ... [2025-03-09 06:49:09,509 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:09" (1/1) ... [2025-03-09 06:49:09,521 INFO L175 MemorySlicer]: Split 7 memory accesses to 1 slices as follows [7]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2025-03-09 06:49:09,521 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:09" (1/1) ... [2025-03-09 06:49:09,521 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:09" (1/1) ... [2025-03-09 06:49:09,526 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:09" (1/1) ... [2025-03-09 06:49:09,527 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:09" (1/1) ... [2025-03-09 06:49:09,527 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:09" (1/1) ... [2025-03-09 06:49:09,528 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:09" (1/1) ... [2025-03-09 06:49:09,528 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 06:49:09,529 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 06:49:09,529 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 06:49:09,529 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 06:49:09,530 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:09" (1/1) ... [2025-03-09 06:49:09,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:09,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:09,557 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:09,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-09 06:49:09,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 06:49:09,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 06:49:09,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 06:49:09,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 06:49:09,581 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 06:49:09,633 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 06:49:09,635 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 06:49:09,765 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L42: havoc main_#t~ret10#1.base, main_#t~ret10#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret12#1; [2025-03-09 06:49:09,779 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2025-03-09 06:49:09,779 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 06:49:09,784 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 06:49:09,784 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 06:49:09,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:49:09 BoogieIcfgContainer [2025-03-09 06:49:09,784 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 06:49:09,785 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-09 06:49:09,785 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-09 06:49:09,788 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-09 06:49:09,789 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:49:09,789 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.03 06:49:09" (1/3) ... [2025-03-09 06:49:09,790 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@421a712d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 06:49:09, skipping insertion in model container [2025-03-09 06:49:09,791 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:49:09,791 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:49:09" (2/3) ... [2025-03-09 06:49:09,791 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@421a712d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 06:49:09, skipping insertion in model container [2025-03-09 06:49:09,791 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 06:49:09,791 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:49:09" (3/3) ... [2025-03-09 06:49:09,792 INFO L363 chiAutomizerObserver]: Analyzing ICFG cstrcspn.c [2025-03-09 06:49:09,826 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-09 06:49:09,826 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-09 06:49:09,827 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-09 06:49:09,827 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-09 06:49:09,827 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-09 06:49:09,827 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-09 06:49:09,827 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-09 06:49:09,827 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-09 06:49:09,830 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:49:09,838 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-09 06:49:09,838 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:09,838 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:09,841 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:49:09,841 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-09 06:49:09,841 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-09 06:49:09,841 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:49:09,841 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-09 06:49:09,842 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:09,842 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:09,842 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:49:09,842 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-03-09 06:49:09,845 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~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;havoc build_nondet_String_#t~nondet0#1;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1;" "assume !(build_nondet_String_~length~0#1 < 1);" "call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1 % 18446744073709551616);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int#0(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;" "main_#t~ret10#1.base, main_#t~ret10#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;havoc build_nondet_String_#t~nondet0#1;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1;" "assume !(build_nondet_String_~length~0#1 < 1);" "call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1 % 18446744073709551616);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int#0(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;" "main_#t~ret11#1.base, main_#t~ret11#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem2#1, cstrcspn_#t~mem3#1, cstrcspn_#t~mem4#1, cstrcspn_#t~mem5#1, cstrcspn_#t~short6#1, cstrcspn_#t~post7#1.base, cstrcspn_#t~post7#1.offset, cstrcspn_#t~mem8#1, cstrcspn_#t~post9#1.base, cstrcspn_#t~post9#1.offset, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset;" [2025-03-09 06:49:09,845 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call cstrcspn_#t~mem2#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);" "assume 0 != cstrcspn_#t~mem2#1;havoc cstrcspn_#t~mem2#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem3#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem3#1;havoc cstrcspn_#t~mem3#1;" "assume !true;" "call cstrcspn_#t~mem8#1 := read~int#0(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);" "assume !(cstrcspn_#t~mem8#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem8#1;cstrcspn_#t~post9#1.base, cstrcspn_#t~post9#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post9#1.base, 1 + cstrcspn_#t~post9#1.offset;havoc cstrcspn_#t~post9#1.base, cstrcspn_#t~post9#1.offset;" [2025-03-09 06:49:09,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:09,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1170829659, now seen corresponding path program 1 times [2025-03-09 06:49:09,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:09,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464748663] [2025-03-09 06:49:09,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:09,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:09,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:49:09,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:49:09,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:09,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:09,946 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:09,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:49:09,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:49:09,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:09,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:09,990 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:09,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:09,992 INFO L85 PathProgramCache]: Analyzing trace with hash 51497458, now seen corresponding path program 1 times [2025-03-09 06:49:09,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:09,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246186612] [2025-03-09 06:49:09,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:09,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:09,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 06:49:10,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 06:49:10,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:10,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:10,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:10,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:10,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246186612] [2025-03-09 06:49:10,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246186612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:49:10,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:49:10,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:49:10,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241044805] [2025-03-09 06:49:10,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:49:10,040 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-09 06:49:10,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:10,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 06:49:10,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 06:49:10,061 INFO L87 Difference]: Start difference. First operand has 20 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:49:10,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:10,066 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2025-03-09 06:49:10,067 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 25 transitions. [2025-03-09 06:49:10,068 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-09 06:49:10,072 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 15 states and 19 transitions. [2025-03-09 06:49:10,074 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2025-03-09 06:49:10,075 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2025-03-09 06:49:10,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2025-03-09 06:49:10,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 06:49:10,076 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 19 transitions. [2025-03-09 06:49:10,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2025-03-09 06:49:10,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-03-09 06:49:10,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:49:10,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2025-03-09 06:49:10,092 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 19 transitions. [2025-03-09 06:49:10,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 06:49:10,096 INFO L432 stractBuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2025-03-09 06:49:10,097 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-09 06:49:10,097 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2025-03-09 06:49:10,098 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2025-03-09 06:49:10,099 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:10,099 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:10,099 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:49:10,099 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:49:10,099 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~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;havoc build_nondet_String_#t~nondet0#1;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1;" "assume !(build_nondet_String_~length~0#1 < 1);" "call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1 % 18446744073709551616);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int#0(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;" "main_#t~ret10#1.base, main_#t~ret10#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;havoc build_nondet_String_#t~nondet0#1;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1;" "assume !(build_nondet_String_~length~0#1 < 1);" "call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1 % 18446744073709551616);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int#0(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;" "main_#t~ret11#1.base, main_#t~ret11#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem2#1, cstrcspn_#t~mem3#1, cstrcspn_#t~mem4#1, cstrcspn_#t~mem5#1, cstrcspn_#t~short6#1, cstrcspn_#t~post7#1.base, cstrcspn_#t~post7#1.offset, cstrcspn_#t~mem8#1, cstrcspn_#t~post9#1.base, cstrcspn_#t~post9#1.offset, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset;" [2025-03-09 06:49:10,100 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call cstrcspn_#t~mem2#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);" "assume 0 != cstrcspn_#t~mem2#1;havoc cstrcspn_#t~mem2#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem3#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem3#1;havoc cstrcspn_#t~mem3#1;" "assume true;call cstrcspn_#t~mem4#1 := read~int#0(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short6#1 := 0 != cstrcspn_#t~mem4#1;" "assume cstrcspn_#t~short6#1;call cstrcspn_#t~mem5#1 := read~int#0(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short6#1 := cstrcspn_#t~mem5#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256);" "assume !cstrcspn_#t~short6#1;havoc cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~short6#1;" "call cstrcspn_#t~mem8#1 := read~int#0(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);" "assume !(cstrcspn_#t~mem8#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem8#1;cstrcspn_#t~post9#1.base, cstrcspn_#t~post9#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post9#1.base, 1 + cstrcspn_#t~post9#1.offset;havoc cstrcspn_#t~post9#1.base, cstrcspn_#t~post9#1.offset;" [2025-03-09 06:49:10,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:10,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1170829659, now seen corresponding path program 2 times [2025-03-09 06:49:10,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:10,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795542964] [2025-03-09 06:49:10,101 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:49:10,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:10,112 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:49:10,131 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:49:10,131 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:49:10,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:10,132 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:10,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:49:10,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:49:10,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:10,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:10,145 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:10,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:10,146 INFO L85 PathProgramCache]: Analyzing trace with hash -2051320785, now seen corresponding path program 1 times [2025-03-09 06:49:10,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:10,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362293066] [2025-03-09 06:49:10,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:10,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:10,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:49:10,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:49:10,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:10,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:10,157 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:10,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:49:10,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:49:10,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:10,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:10,166 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:10,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:10,166 INFO L85 PathProgramCache]: Analyzing trace with hash -976582251, now seen corresponding path program 1 times [2025-03-09 06:49:10,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:10,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240665327] [2025-03-09 06:49:10,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:10,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:10,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 06:49:10,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 06:49:10,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:10,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:10,229 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:10,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 06:49:10,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 06:49:10,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:10,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:10,269 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:11,152 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:49:11,153 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:49:11,153 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:49:11,153 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:49:11,154 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:49:11,154 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:11,154 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:49:11,154 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:49:11,154 INFO L132 ssoRankerPreferences]: Filename of dumped script: cstrcspn.c_Iteration2_Lasso [2025-03-09 06:49:11,154 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:49:11,155 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:49:11,173 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:11,178 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:11,181 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:11,184 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:11,186 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:11,189 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:11,405 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:11,407 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:11,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:11,410 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:11,412 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:11,413 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:11,415 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:11,417 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:11,418 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:11,420 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:11,422 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:11,424 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:11,425 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:11,427 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:11,429 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:11,430 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:11,432 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:11,433 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:11,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:11,437 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:11,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:11,440 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:11,442 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:11,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:11,908 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:49:11,911 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:49:11,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:11,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:11,914 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:11,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-03-09 06:49:11,915 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:11,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:11,927 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:11,927 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:11,927 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:11,927 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:11,930 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:11,930 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:11,932 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:11,938 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-09 06:49:11,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:11,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:11,940 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:11,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-03-09 06:49:11,942 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:11,952 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:11,952 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:11,952 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:11,952 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:11,952 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:11,953 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:11,953 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:11,956 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:11,963 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-09 06:49:11,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:11,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:11,966 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:11,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-03-09 06:49:11,968 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:11,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:11,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:11,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:11,979 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:11,981 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:49:11,981 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:49:11,984 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:11,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-03-09 06:49:11,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:11,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:11,992 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:11,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-03-09 06:49:11,994 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:12,003 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:12,004 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:12,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:12,004 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:12,004 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:12,005 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:12,005 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:12,006 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:12,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-03-09 06:49:12,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:12,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:12,014 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:12,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-09 06:49:12,017 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:12,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:12,028 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:12,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:12,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:12,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:12,029 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:12,029 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:12,030 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:12,036 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-09 06:49:12,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:12,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:12,039 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:12,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-03-09 06:49:12,041 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:12,051 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:12,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:12,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:12,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:12,055 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:49:12,056 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:49:12,063 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:49:12,091 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2025-03-09 06:49:12,092 INFO L444 ModelExtractionUtils]: 2 out of 13 variables were initially zero. Simplification set additionally 8 variables to zero. [2025-03-09 06:49:12,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:12,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:12,096 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:12,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-03-09 06:49:12,098 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:49:12,113 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:49:12,114 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:49:12,114 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~sc1~0#1.offset, v_rep(select #length ULTIMATE.start_cstrcspn_~s1#1.base)_1) = -1*ULTIMATE.start_cstrcspn_~sc1~0#1.offset + 1*v_rep(select #length ULTIMATE.start_cstrcspn_~s1#1.base)_1 Supporting invariants [] [2025-03-09 06:49:12,120 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-09 06:49:12,145 INFO L156 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2025-03-09 06:49:12,153 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~sc1~0!offset [2025-03-09 06:49:12,153 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-09 06:49:12,154 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-09 06:49:12,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:12,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:49:12,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:49:12,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:12,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:12,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:49:12,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:12,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:49:12,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:49:12,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:12,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:12,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 06:49:12,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:12,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:12,290 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-09 06:49:12,291 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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-09 06:49:12,346 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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 22 states and 29 transitions. Complement of second has 4 states. [2025-03-09 06:49:12,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-09 06:49:12,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 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-09 06:49:12,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2025-03-09 06:49:12,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 8 letters. Loop has 7 letters. [2025-03-09 06:49:12,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:12,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 15 letters. Loop has 7 letters. [2025-03-09 06:49:12,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:12,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 8 letters. Loop has 14 letters. [2025-03-09 06:49:12,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:12,352 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 29 transitions. [2025-03-09 06:49:12,356 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-09 06:49:12,356 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 20 states and 27 transitions. [2025-03-09 06:49:12,357 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2025-03-09 06:49:12,358 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-03-09 06:49:12,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2025-03-09 06:49:12,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:12,358 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 27 transitions. [2025-03-09 06:49:12,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2025-03-09 06:49:12,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-03-09 06:49:12,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.35) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:49:12,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2025-03-09 06:49:12,360 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 27 transitions. [2025-03-09 06:49:12,360 INFO L432 stractBuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2025-03-09 06:49:12,360 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-09 06:49:12,360 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2025-03-09 06:49:12,360 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-09 06:49:12,360 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:12,360 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:12,361 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:49:12,361 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 06:49:12,361 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~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;havoc build_nondet_String_#t~nondet0#1;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1;" "assume !(build_nondet_String_~length~0#1 < 1);" "call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1 % 18446744073709551616);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int#0(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;" "main_#t~ret10#1.base, main_#t~ret10#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;havoc build_nondet_String_#t~nondet0#1;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1;" "assume !(build_nondet_String_~length~0#1 < 1);" "call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1 % 18446744073709551616);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int#0(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;" "main_#t~ret11#1.base, main_#t~ret11#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem2#1, cstrcspn_#t~mem3#1, cstrcspn_#t~mem4#1, cstrcspn_#t~mem5#1, cstrcspn_#t~short6#1, cstrcspn_#t~post7#1.base, cstrcspn_#t~post7#1.offset, cstrcspn_#t~mem8#1, cstrcspn_#t~post9#1.base, cstrcspn_#t~post9#1.offset, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset;" "assume true;call cstrcspn_#t~mem2#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);" "assume 0 != cstrcspn_#t~mem2#1;havoc cstrcspn_#t~mem2#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem3#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem3#1;havoc cstrcspn_#t~mem3#1;" [2025-03-09 06:49:12,362 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call cstrcspn_#t~mem4#1 := read~int#0(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short6#1 := 0 != cstrcspn_#t~mem4#1;" "assume cstrcspn_#t~short6#1;call cstrcspn_#t~mem5#1 := read~int#0(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short6#1 := cstrcspn_#t~mem5#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256);" "assume cstrcspn_#t~short6#1;havoc cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~short6#1;cstrcspn_#t~post7#1.base, cstrcspn_#t~post7#1.offset := cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_#t~post7#1.base, 1 + cstrcspn_#t~post7#1.offset;" [2025-03-09 06:49:12,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:12,362 INFO L85 PathProgramCache]: Analyzing trace with hash -114128486, now seen corresponding path program 1 times [2025-03-09 06:49:12,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:12,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880536884] [2025-03-09 06:49:12,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:12,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:12,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 06:49:12,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 06:49:12,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:12,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:12,390 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:12,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 06:49:12,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 06:49:12,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:12,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:12,416 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:12,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:12,416 INFO L85 PathProgramCache]: Analyzing trace with hash 47600, now seen corresponding path program 1 times [2025-03-09 06:49:12,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:12,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847909503] [2025-03-09 06:49:12,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:12,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:12,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:49:12,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:49:12,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:12,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:12,422 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:12,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:49:12,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:49:12,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:12,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:12,429 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:12,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:12,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1612389815, now seen corresponding path program 1 times [2025-03-09 06:49:12,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:12,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395507102] [2025-03-09 06:49:12,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:12,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:12,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 06:49:12,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 06:49:12,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:12,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:12,460 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:12,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 06:49:12,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 06:49:12,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:12,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:12,476 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:12,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-03-09 06:49:13,113 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:49:13,113 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:49:13,113 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:49:13,113 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:49:13,113 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:49:13,113 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:13,113 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:49:13,113 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:49:13,113 INFO L132 ssoRankerPreferences]: Filename of dumped script: cstrcspn.c_Iteration3_Lasso [2025-03-09 06:49:13,113 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:49:13,113 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:49:13,115 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:13,120 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:13,122 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:13,124 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:13,125 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:13,311 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:13,313 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:13,315 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:13,316 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:13,317 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:13,320 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:13,322 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:13,324 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:13,325 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:13,327 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:13,328 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:13,334 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:13,335 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:13,337 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:13,338 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:13,339 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:13,340 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:13,342 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:13,343 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:13,345 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:13,346 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:13,348 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:13,744 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:49:13,744 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:49:13,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:13,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:13,746 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:13,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-03-09 06:49:13,749 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:13,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:13,758 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:13,759 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:13,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:13,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:13,759 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:13,759 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:13,760 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:13,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-03-09 06:49:13,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:13,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:13,767 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:13,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-03-09 06:49:13,768 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:13,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:13,778 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:13,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:13,778 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:13,778 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:13,779 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:13,779 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:13,780 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:13,785 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-09 06:49:13,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:13,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:13,787 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:13,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-03-09 06:49:13,788 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:13,798 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:13,798 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:13,798 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:13,798 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:13,799 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:49:13,799 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:49:13,801 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:13,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-03-09 06:49:13,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:13,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:13,809 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:13,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-03-09 06:49:13,812 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:13,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:13,822 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:13,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:13,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:13,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:13,822 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:13,822 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:13,823 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:13,828 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-09 06:49:13,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:13,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:13,830 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:13,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-03-09 06:49:13,832 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:13,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:13,842 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:13,842 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:13,842 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:13,843 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:49:13,843 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:49:13,845 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:13,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-03-09 06:49:13,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:13,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:13,852 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:13,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-03-09 06:49:13,854 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:13,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:13,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:13,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:13,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:13,868 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:49:13,869 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:49:13,874 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:49:13,887 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-03-09 06:49:13,887 INFO L444 ModelExtractionUtils]: 4 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-03-09 06:49:13,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:13,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:13,889 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:13,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-03-09 06:49:13,892 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:49:13,903 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-03-09 06:49:13,903 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:49:13,903 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~s~0#1.offset) = -2*ULTIMATE.start_cstrcspn_~s~0#1.offset + 36893488147419103229 Supporting invariants [-1*v_rep(select #length ULTIMATE.start_cstrcspn_~s~0#1.base)_1 + 18446744073709551615 >= 0] [2025-03-09 06:49:13,909 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-03-09 06:49:13,925 INFO L156 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2025-03-09 06:49:13,927 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2025-03-09 06:49:13,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:13,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 06:49:13,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 06:49:13,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:13,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:13,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 06:49:13,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:13,982 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-09 06:49:14,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:49:14,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:49:14,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:14,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:14,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 06:49:14,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:14,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:14,037 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2025-03-09 06:49:14,037 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 27 transitions. cyclomatic complexity: 9 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 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-09 06:49:14,087 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 27 transitions. cyclomatic complexity: 9. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 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) Result 35 states and 48 transitions. Complement of second has 7 states. [2025-03-09 06:49:14,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-09 06:49:14,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 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-09 06:49:14,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2025-03-09 06:49:14,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 10 letters. Loop has 3 letters. [2025-03-09 06:49:14,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:14,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 13 letters. Loop has 3 letters. [2025-03-09 06:49:14,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:14,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 10 letters. Loop has 6 letters. [2025-03-09 06:49:14,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:14,090 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 48 transitions. [2025-03-09 06:49:14,090 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-09 06:49:14,091 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 27 states and 36 transitions. [2025-03-09 06:49:14,091 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-03-09 06:49:14,091 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2025-03-09 06:49:14,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 36 transitions. [2025-03-09 06:49:14,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:14,091 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 36 transitions. [2025-03-09 06:49:14,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 36 transitions. [2025-03-09 06:49:14,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2025-03-09 06:49:14,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 25 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:49:14,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2025-03-09 06:49:14,092 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 35 transitions. [2025-03-09 06:49:14,092 INFO L432 stractBuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2025-03-09 06:49:14,093 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-09 06:49:14,093 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2025-03-09 06:49:14,093 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-09 06:49:14,093 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:14,093 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:14,093 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:49:14,093 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 06:49:14,094 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~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;havoc build_nondet_String_#t~nondet0#1;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1;" "assume !(build_nondet_String_~length~0#1 < 1);" "call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1 % 18446744073709551616);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int#0(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;" "main_#t~ret10#1.base, main_#t~ret10#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;havoc build_nondet_String_#t~nondet0#1;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1;" "assume !(build_nondet_String_~length~0#1 < 1);" "call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1 % 18446744073709551616);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int#0(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;" "main_#t~ret11#1.base, main_#t~ret11#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem2#1, cstrcspn_#t~mem3#1, cstrcspn_#t~mem4#1, cstrcspn_#t~mem5#1, cstrcspn_#t~short6#1, cstrcspn_#t~post7#1.base, cstrcspn_#t~post7#1.offset, cstrcspn_#t~mem8#1, cstrcspn_#t~post9#1.base, cstrcspn_#t~post9#1.offset, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset;" "assume true;call cstrcspn_#t~mem2#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);" "assume 0 != cstrcspn_#t~mem2#1;havoc cstrcspn_#t~mem2#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem3#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem3#1;havoc cstrcspn_#t~mem3#1;" "assume true;call cstrcspn_#t~mem4#1 := read~int#0(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short6#1 := 0 != cstrcspn_#t~mem4#1;" "assume !cstrcspn_#t~short6#1;" "assume !cstrcspn_#t~short6#1;havoc cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~short6#1;" "call cstrcspn_#t~mem8#1 := read~int#0(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);" "assume !(cstrcspn_#t~mem8#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem8#1;cstrcspn_#t~post9#1.base, cstrcspn_#t~post9#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post9#1.base, 1 + cstrcspn_#t~post9#1.offset;havoc cstrcspn_#t~post9#1.base, cstrcspn_#t~post9#1.offset;" "assume true;call cstrcspn_#t~mem2#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);" "assume 0 != cstrcspn_#t~mem2#1;havoc cstrcspn_#t~mem2#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem3#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem3#1;havoc cstrcspn_#t~mem3#1;" [2025-03-09 06:49:14,094 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call cstrcspn_#t~mem4#1 := read~int#0(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short6#1 := 0 != cstrcspn_#t~mem4#1;" "assume cstrcspn_#t~short6#1;call cstrcspn_#t~mem5#1 := read~int#0(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short6#1 := cstrcspn_#t~mem5#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256);" "assume cstrcspn_#t~short6#1;havoc cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~short6#1;cstrcspn_#t~post7#1.base, cstrcspn_#t~post7#1.offset := cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_#t~post7#1.base, 1 + cstrcspn_#t~post7#1.offset;" [2025-03-09 06:49:14,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:14,094 INFO L85 PathProgramCache]: Analyzing trace with hash 2130924531, now seen corresponding path program 1 times [2025-03-09 06:49:14,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:14,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447221283] [2025-03-09 06:49:14,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:14,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:14,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 06:49:14,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 06:49:14,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:14,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:14,120 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:14,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 06:49:14,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 06:49:14,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:14,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:14,136 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:14,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:14,136 INFO L85 PathProgramCache]: Analyzing trace with hash 47600, now seen corresponding path program 2 times [2025-03-09 06:49:14,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:14,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886048639] [2025-03-09 06:49:14,137 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:49:14,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:14,141 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:49:14,143 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:49:14,144 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:49:14,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:14,145 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:14,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:49:14,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:49:14,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:14,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:14,152 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:14,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:14,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1538881346, now seen corresponding path program 1 times [2025-03-09 06:49:14,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:14,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178066688] [2025-03-09 06:49:14,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:14,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:14,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 06:49:14,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 06:49:14,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:14,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:14,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-03-09 06:49:14,398 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:14,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:49:14,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178066688] [2025-03-09 06:49:14,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178066688] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:49:14,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849770569] [2025-03-09 06:49:14,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:14,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:49:14,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:14,400 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:49:14,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-09 06:49:14,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 06:49:14,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 06:49:14,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:14,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:14,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-09 06:49:14,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:14,569 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:14,569 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:49:14,604 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-03-09 06:49:14,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-03-09 06:49:14,610 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:14,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849770569] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:49:14,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:49:14,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 7] total 15 [2025-03-09 06:49:14,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519164555] [2025-03-09 06:49:14,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:49:14,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:49:14,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 06:49:14,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-03-09 06:49:14,706 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. cyclomatic complexity: 12 Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:49:14,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:49:14,838 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2025-03-09 06:49:14,838 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 67 transitions. [2025-03-09 06:49:14,839 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-09 06:49:14,840 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 40 states and 49 transitions. [2025-03-09 06:49:14,840 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2025-03-09 06:49:14,840 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2025-03-09 06:49:14,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 49 transitions. [2025-03-09 06:49:14,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 06:49:14,840 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 49 transitions. [2025-03-09 06:49:14,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 49 transitions. [2025-03-09 06:49:14,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 30. [2025-03-09 06:49:14,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 29 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:49:14,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2025-03-09 06:49:14,845 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 38 transitions. [2025-03-09 06:49:14,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 06:49:14,846 INFO L432 stractBuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2025-03-09 06:49:14,846 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-09 06:49:14,846 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 38 transitions. [2025-03-09 06:49:14,847 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-09 06:49:14,847 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 06:49:14,847 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 06:49:14,847 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:49:14,847 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-09 06:49:14,847 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~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;havoc build_nondet_String_#t~nondet0#1;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1;" "assume !(build_nondet_String_~length~0#1 < 1);" "call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1 % 18446744073709551616);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int#0(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;" "main_#t~ret10#1.base, main_#t~ret10#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_build_nondet_String } true;havoc build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;havoc build_nondet_String_#t~nondet0#1;build_nondet_String_~length~0#1 := build_nondet_String_#t~nondet0#1;havoc build_nondet_String_#t~nondet0#1;" "assume !(build_nondet_String_~length~0#1 < 1);" "call build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset := #Ultimate.allocOnHeap(build_nondet_String_~length~0#1 % 18446744073709551616);build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset := build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;havoc build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset;call write~int#0(0, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset + (build_nondet_String_~length~0#1 - 1), 1);build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset := build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;" "main_#t~ret11#1.base, main_#t~ret11#1.offset := build_nondet_String_#res#1.base, build_nondet_String_#res#1.offset;havoc build_nondet_String_#t~nondet0#1, build_nondet_String_#t~malloc1#1.base, build_nondet_String_#t~malloc1#1.offset, build_nondet_String_~length~0#1, build_nondet_String_~nondetString~0#1.base, build_nondet_String_~nondetString~0#1.offset;assume { :end_inline_build_nondet_String } true;assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_#t~ret10#1.base, main_#t~ret10#1.offset, main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~mem2#1, cstrcspn_#t~mem3#1, cstrcspn_#t~mem4#1, cstrcspn_#t~mem5#1, cstrcspn_#t~short6#1, cstrcspn_#t~post7#1.base, cstrcspn_#t~post7#1.offset, cstrcspn_#t~mem8#1, cstrcspn_#t~post9#1.base, cstrcspn_#t~post9#1.offset, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, cstrcspn_~c~0#1;cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset := cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset;cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset := cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset;havoc cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;havoc cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;havoc cstrcspn_~c~0#1;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset;" "assume true;call cstrcspn_#t~mem2#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);" "assume 0 != cstrcspn_#t~mem2#1;havoc cstrcspn_#t~mem2#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem3#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem3#1;havoc cstrcspn_#t~mem3#1;" "assume true;call cstrcspn_#t~mem4#1 := read~int#0(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short6#1 := 0 != cstrcspn_#t~mem4#1;" "assume cstrcspn_#t~short6#1;call cstrcspn_#t~mem5#1 := read~int#0(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short6#1 := cstrcspn_#t~mem5#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256);" "assume !cstrcspn_#t~short6#1;havoc cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~short6#1;" "call cstrcspn_#t~mem8#1 := read~int#0(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);" "assume !(cstrcspn_#t~mem8#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~mem8#1;cstrcspn_#t~post9#1.base, cstrcspn_#t~post9#1.offset := cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset;cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset := cstrcspn_#t~post9#1.base, 1 + cstrcspn_#t~post9#1.offset;havoc cstrcspn_#t~post9#1.base, cstrcspn_#t~post9#1.offset;" "assume true;call cstrcspn_#t~mem2#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);" "assume 0 != cstrcspn_#t~mem2#1;havoc cstrcspn_#t~mem2#1;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;call cstrcspn_#t~mem3#1 := read~int#0(cstrcspn_~sc1~0#1.base, cstrcspn_~sc1~0#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem3#1;havoc cstrcspn_#t~mem3#1;" [2025-03-09 06:49:14,849 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call cstrcspn_#t~mem4#1 := read~int#0(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short6#1 := 0 != cstrcspn_#t~mem4#1;" "assume cstrcspn_#t~short6#1;call cstrcspn_#t~mem5#1 := read~int#0(cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset, 1);cstrcspn_#t~short6#1 := cstrcspn_#t~mem5#1 != (if cstrcspn_~c~0#1 % 256 <= 127 then cstrcspn_~c~0#1 % 256 else cstrcspn_~c~0#1 % 256 - 256);" "assume cstrcspn_#t~short6#1;havoc cstrcspn_#t~mem4#1;havoc cstrcspn_#t~mem5#1;havoc cstrcspn_#t~short6#1;cstrcspn_#t~post7#1.base, cstrcspn_#t~post7#1.offset := cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset;cstrcspn_~s~0#1.base, cstrcspn_~s~0#1.offset := cstrcspn_#t~post7#1.base, 1 + cstrcspn_#t~post7#1.offset;" [2025-03-09 06:49:14,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:14,850 INFO L85 PathProgramCache]: Analyzing trace with hash 2102295380, now seen corresponding path program 2 times [2025-03-09 06:49:14,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:14,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726075353] [2025-03-09 06:49:14,850 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:49:14,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:14,858 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-09 06:49:14,874 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 06:49:14,874 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:49:14,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:14,874 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:14,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 06:49:14,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 06:49:14,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:14,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:14,891 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:14,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:14,894 INFO L85 PathProgramCache]: Analyzing trace with hash 47600, now seen corresponding path program 3 times [2025-03-09 06:49:14,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:14,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256623501] [2025-03-09 06:49:14,894 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:49:14,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:14,899 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:49:14,901 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:49:14,901 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 06:49:14,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:14,901 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:14,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:49:14,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:49:14,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:14,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:14,906 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:14,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:14,906 INFO L85 PathProgramCache]: Analyzing trace with hash 268573117, now seen corresponding path program 1 times [2025-03-09 06:49:14,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:49:14,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574286276] [2025-03-09 06:49:14,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:49:14,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:49:14,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 06:49:14,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 06:49:14,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:14,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:14,922 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 06:49:14,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 06:49:14,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 06:49:14,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:14,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 06:49:14,936 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 06:49:15,847 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 06:49:15,847 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 06:49:15,847 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 06:49:15,847 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 06:49:15,847 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 06:49:15,847 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:15,847 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 06:49:15,847 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 06:49:15,847 INFO L132 ssoRankerPreferences]: Filename of dumped script: cstrcspn.c_Iteration5_Lasso [2025-03-09 06:49:15,847 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 06:49:15,847 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 06:49:15,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:15,853 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:15,854 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:15,855 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:15,856 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:15,857 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:15,858 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:15,861 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:15,863 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:15,864 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:15,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:15,866 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:15,867 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:15,868 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:15,870 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:15,871 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:15,872 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:15,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:15,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:16,165 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:16,166 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:16,169 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:16,170 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:16,171 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:16,172 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:16,174 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:16,176 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:16,177 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 06:49:16,895 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 06:49:16,895 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 06:49:16,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:16,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:16,897 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:16,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-03-09 06:49:16,899 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:16,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:16,910 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:16,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:16,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:16,910 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:16,911 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:16,911 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:16,912 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:16,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-03-09 06:49:16,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:16,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:16,919 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:16,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-03-09 06:49:16,921 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:16,931 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:16,931 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:16,931 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:16,931 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:16,931 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:16,931 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:16,931 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:16,932 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:16,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-03-09 06:49:16,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:16,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:16,939 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:16,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-03-09 06:49:16,941 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:16,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:16,951 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:16,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:16,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:16,951 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:16,951 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:16,952 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:16,952 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:16,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-03-09 06:49:16,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:16,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:16,960 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:16,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-03-09 06:49:16,961 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:16,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:16,971 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:16,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:16,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:16,971 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:16,971 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:16,971 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:16,972 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:16,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-03-09 06:49:16,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:16,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:16,980 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:16,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-03-09 06:49:16,981 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:16,991 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:16,991 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:16,991 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:16,991 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:16,991 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:16,991 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:16,991 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:16,992 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:16,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-03-09 06:49:16,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:16,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:16,999 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:17,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-03-09 06:49:17,001 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:17,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:17,011 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:17,011 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:17,011 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:17,011 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:17,011 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:17,011 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:17,012 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:17,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-03-09 06:49:17,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:17,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:17,025 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:17,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-03-09 06:49:17,026 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:17,036 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:17,036 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:17,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:17,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:17,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:17,039 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:17,040 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:17,040 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:17,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-03-09 06:49:17,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:17,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:17,047 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:17,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-03-09 06:49:17,049 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:17,059 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:17,059 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:17,059 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:17,059 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:17,059 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:17,060 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:17,060 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:17,061 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:17,066 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-09 06:49:17,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:17,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:17,068 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:17,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-03-09 06:49:17,070 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:17,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:17,079 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:17,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:17,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:17,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:17,079 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:17,079 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:17,080 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:17,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-03-09 06:49:17,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:17,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:17,088 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:17,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-03-09 06:49:17,093 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:17,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:17,103 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:17,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:17,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:17,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:17,104 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:17,104 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:17,105 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:17,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-03-09 06:49:17,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:17,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:17,112 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:17,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-03-09 06:49:17,115 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:17,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:17,125 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:17,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:17,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:17,125 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:17,125 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:17,125 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:17,126 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:17,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-03-09 06:49:17,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:17,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:17,133 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:17,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-03-09 06:49:17,136 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:17,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:17,145 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:17,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:17,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:17,145 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:17,146 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:17,146 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:17,147 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:17,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-03-09 06:49:17,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:17,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:17,154 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:17,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-03-09 06:49:17,155 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:17,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:17,165 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:17,165 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:17,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:17,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:17,165 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:17,165 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:17,166 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:17,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-03-09 06:49:17,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:17,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:17,173 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:17,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-03-09 06:49:17,175 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:17,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:17,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:17,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:17,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:17,185 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:49:17,185 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:49:17,187 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:17,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-03-09 06:49:17,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:17,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:17,195 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:17,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-03-09 06:49:17,196 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:17,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:17,205 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:17,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:17,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:17,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:17,206 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:17,206 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:17,207 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:17,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-03-09 06:49:17,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:17,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:17,213 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:17,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-03-09 06:49:17,215 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:17,225 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:17,225 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:17,225 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:17,225 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:17,225 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:17,225 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:17,225 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:17,226 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:17,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-03-09 06:49:17,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:17,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:17,233 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-09 06:49:17,234 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-09 06:49:17,235 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:17,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:17,245 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:17,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:17,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:17,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:17,245 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:17,245 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:17,246 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:17,252 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-09 06:49:17,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:17,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:17,254 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:17,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-03-09 06:49:17,255 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:17,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:17,266 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 06:49:17,266 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:17,266 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:17,266 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:17,266 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 06:49:17,266 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 06:49:17,267 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:17,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-03-09 06:49:17,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:17,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:17,274 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:17,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-03-09 06:49:17,275 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:17,285 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:17,285 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:17,285 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:17,285 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:17,286 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:49:17,286 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:49:17,289 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:17,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-03-09 06:49:17,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:17,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:17,296 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:17,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-03-09 06:49:17,298 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:17,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:17,310 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:17,310 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:17,310 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:17,311 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:49:17,311 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:49:17,314 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:17,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-03-09 06:49:17,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:17,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:17,324 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:17,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-03-09 06:49:17,325 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:17,335 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:17,335 INFO L203 nArgumentSynthesizer]: 8 stem disjuncts [2025-03-09 06:49:17,335 INFO L204 nArgumentSynthesizer]: 6 loop disjuncts [2025-03-09 06:49:17,335 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:17,446 INFO L401 nArgumentSynthesizer]: We have 180 Motzkin's Theorem applications. [2025-03-09 06:49:17,446 INFO L402 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2025-03-09 06:49:17,586 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:17,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-03-09 06:49:17,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:17,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:17,597 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:17,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-03-09 06:49:17,599 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:17,608 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:17,608 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:17,608 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:17,608 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:17,609 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:49:17,609 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:49:17,612 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 06:49:17,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-03-09 06:49:17,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:17,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:17,619 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:17,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-03-09 06:49:17,622 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 06:49:17,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 06:49:17,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 06:49:17,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 06:49:17,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 06:49:17,634 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 06:49:17,634 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 06:49:17,640 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 06:49:17,651 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-03-09 06:49:17,651 INFO L444 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-03-09 06:49:17,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 06:49:17,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:49:17,654 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 06:49:17,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-03-09 06:49:17,656 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 06:49:17,668 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 06:49:17,668 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 06:49:17,668 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~s~0#1.offset, v_rep(select #length ULTIMATE.start_cstrcspn_~s~0#1.base)_2) = -1*ULTIMATE.start_cstrcspn_~s~0#1.offset + 1*v_rep(select #length ULTIMATE.start_cstrcspn_~s~0#1.base)_2 Supporting invariants [] [2025-03-09 06:49:17,674 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-09 06:49:17,697 INFO L156 tatePredicateManager]: 12 out of 12 supporting invariants were superfluous and have been removed [2025-03-09 06:49:17,701 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~s~0!offset [2025-03-09 06:49:17,702 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-09 06:49:17,702 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-09 06:49:17,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:17,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 06:49:17,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 06:49:17,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:17,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:17,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:49:17,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:17,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:49:17,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:49:17,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:17,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:17,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:49:17,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:17,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:17,769 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-09 06:49:17,769 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 11 Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:49:17,788 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 11. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 38 states and 49 transitions. Complement of second has 5 states. [2025-03-09 06:49:17,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-09 06:49:17,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:49:17,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2025-03-09 06:49:17,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 17 letters. Loop has 3 letters. [2025-03-09 06:49:17,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:17,790 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:49:17,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:17,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 06:49:17,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 06:49:17,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:17,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:17,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:49:17,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:17,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:49:17,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:49:17,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:17,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:17,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:49:17,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:17,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:17,856 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-09 06:49:17,856 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 11 Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:49:17,873 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 11. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 38 states and 49 transitions. Complement of second has 5 states. [2025-03-09 06:49:17,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-09 06:49:17,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:49:17,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2025-03-09 06:49:17,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 17 letters. Loop has 3 letters. [2025-03-09 06:49:17,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:17,874 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 06:49:17,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:49:17,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 06:49:17,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 06:49:17,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:17,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:17,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 06:49:17,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:17,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 06:49:17,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 06:49:17,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:49:17,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:49:17,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:49:17,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:49:17,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:49:17,944 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-09 06:49:17,944 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 11 Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:49:17,958 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 11. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 42 states and 57 transitions. Complement of second has 4 states. [2025-03-09 06:49:17,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-09 06:49:17,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:49:17,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2025-03-09 06:49:17,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 17 letters. Loop has 3 letters. [2025-03-09 06:49:17,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:17,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 20 letters. Loop has 3 letters. [2025-03-09 06:49:17,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:17,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 25 transitions. Stem has 17 letters. Loop has 6 letters. [2025-03-09 06:49:17,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 06:49:17,959 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 57 transitions. [2025-03-09 06:49:17,961 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-09 06:49:17,961 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 0 states and 0 transitions. [2025-03-09 06:49:17,961 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-09 06:49:17,961 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-09 06:49:17,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-09 06:49:17,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 06:49:17,961 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 06:49:17,961 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 06:49:17,961 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 06:49:17,961 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-09 06:49:17,961 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-09 06:49:17,961 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-09 06:49:17,961 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-09 06:49:17,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.03 06:49:17 BoogieIcfgContainer [2025-03-09 06:49:17,966 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-09 06:49:17,967 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 06:49:17,967 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 06:49:17,967 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 06:49:17,967 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:49:09" (3/4) ... [2025-03-09 06:49:17,968 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-09 06:49:17,969 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 06:49:17,969 INFO L158 Benchmark]: Toolchain (without parser) took 8631.34ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 110.4MB in the beginning and 157.7MB in the end (delta: -47.3MB). Peak memory consumption was 94.5MB. Max. memory is 16.1GB. [2025-03-09 06:49:17,970 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 129.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:49:17,970 INFO L158 Benchmark]: CACSL2BoogieTranslator took 138.26ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 99.9MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 06:49:17,970 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.62ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 98.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:49:17,970 INFO L158 Benchmark]: Boogie Preprocessor took 29.46ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 97.4MB in the end (delta: 857.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 06:49:17,970 INFO L158 Benchmark]: IcfgBuilder took 255.41ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 82.4MB in the end (delta: 15.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 06:49:17,970 INFO L158 Benchmark]: BuchiAutomizer took 8181.22ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 82.4MB in the beginning and 157.8MB in the end (delta: -75.4MB). Peak memory consumption was 69.3MB. Max. memory is 16.1GB. [2025-03-09 06:49:17,970 INFO L158 Benchmark]: Witness Printer took 2.37ms. Allocated memory is still 285.2MB. Free memory was 157.8MB in the beginning and 157.7MB in the end (delta: 83.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:49:17,971 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.18ms. Allocated memory is still 201.3MB. Free memory is still 129.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 138.26ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 99.9MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.62ms. Allocated memory is still 142.6MB. Free memory was 99.9MB in the beginning and 98.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.46ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 97.4MB in the end (delta: 857.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 255.41ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 82.4MB in the end (delta: 15.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 8181.22ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 82.4MB in the beginning and 157.8MB in the end (delta: -75.4MB). Peak memory consumption was 69.3MB. Max. memory is 16.1GB. * Witness Printer took 2.37ms. Allocated memory is still 285.2MB. Free memory was 157.8MB in the beginning and 157.7MB in the end (delta: 83.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: ~s~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function null and consists of 3 locations. One deterministic module has affine ranking function null and consists of 5 locations. One nondeterministic module has affine ranking function null and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.1s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 7.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 11 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 115 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 112 mSDsluCounter, 200 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 91 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 169 IncrementalHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 109 mSDtfsCounter, 169 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital276 mio100 ax100 hnf100 lsp109 ukn55 mio100 lsp30 div173 bol100 ite100 ukn100 eq154 hnf97 smp67 dnf1127 smp24 tf100 neg100 sie113 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 263ms VariablesStem: 7 VariablesLoop: 4 DisjunctsStem: 8 DisjunctsLoop: 6 SupportingInvariants: 12 MotzkinApplications: 180 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-03-09 06:49:17,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2025-03-09 06:49:18,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-09 06:49:18,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE