./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrcspn-alloca-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrcspn-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash de88cb9f8af309bfee7e34496a9472de4d446e8ed690818c0d2fc3e900b2d7c4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 19:57:18,054 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 19:57:18,099 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2025-03-17 19:57:18,102 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 19:57:18,102 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 19:57:18,102 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-17 19:57:18,116 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 19:57:18,117 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 19:57:18,117 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 19:57:18,117 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 19:57:18,117 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 19:57:18,117 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 19:57:18,117 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 19:57:18,117 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 19:57:18,117 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-17 19:57:18,117 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-17 19:57:18,117 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-17 19:57:18,118 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-17 19:57:18,118 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-17 19:57:18,118 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-17 19:57:18,118 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 19:57:18,118 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-17 19:57:18,118 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 19:57:18,118 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 19:57:18,118 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-17 19:57:18,118 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-17 19:57:18,118 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-17 19:57:18,118 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 19:57:18,118 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 19:57:18,118 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-17 19:57:18,118 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 19:57:18,118 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 19:57:18,118 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 19:57:18,118 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 19:57:18,118 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 19:57:18,119 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 19:57:18,119 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-17 19:57:18,119 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 -> de88cb9f8af309bfee7e34496a9472de4d446e8ed690818c0d2fc3e900b2d7c4 [2025-03-17 19:57:18,337 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 19:57:18,344 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 19:57:18,346 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 19:57:18,346 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 19:57:18,347 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 19:57:18,348 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrcspn-alloca-1.i [2025-03-17 19:57:19,429 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bba22f372/8d1f43bdbd4849f4bc956572643b5b5f/FLAG01cf47742 [2025-03-17 19:57:19,678 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 19:57:19,678 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/openbsd_cstrcspn-alloca-1.i [2025-03-17 19:57:19,691 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bba22f372/8d1f43bdbd4849f4bc956572643b5b5f/FLAG01cf47742 [2025-03-17 19:57:19,993 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bba22f372/8d1f43bdbd4849f4bc956572643b5b5f [2025-03-17 19:57:19,995 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 19:57:19,996 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 19:57:19,997 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 19:57:19,997 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 19:57:20,000 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 19:57:20,000 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:57:19" (1/1) ... [2025-03-17 19:57:20,001 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b915e48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:57:20, skipping insertion in model container [2025-03-17 19:57:20,001 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:57:19" (1/1) ... [2025-03-17 19:57:20,023 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 19:57:20,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:57:20,232 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 19:57:20,267 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:57:20,287 INFO L204 MainTranslator]: Completed translation [2025-03-17 19:57:20,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:57:20 WrapperNode [2025-03-17 19:57:20,288 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 19:57:20,289 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 19:57:20,289 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 19:57:20,289 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 19:57:20,293 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:57:20" (1/1) ... [2025-03-17 19:57:20,299 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:57:20" (1/1) ... [2025-03-17 19:57:20,313 INFO L138 Inliner]: procedures = 111, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 63 [2025-03-17 19:57:20,313 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 19:57:20,313 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 19:57:20,314 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 19:57:20,314 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 19:57:20,319 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:57:20" (1/1) ... [2025-03-17 19:57:20,319 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:57:20" (1/1) ... [2025-03-17 19:57:20,321 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:57:20" (1/1) ... [2025-03-17 19:57:20,329 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [2, 2]. 50 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 2 writes are split as follows [1, 1]. [2025-03-17 19:57:20,329 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:57:20" (1/1) ... [2025-03-17 19:57:20,329 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:57:20" (1/1) ... [2025-03-17 19:57:20,332 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:57:20" (1/1) ... [2025-03-17 19:57:20,333 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:57:20" (1/1) ... [2025-03-17 19:57:20,333 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:57:20" (1/1) ... [2025-03-17 19:57:20,334 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:57:20" (1/1) ... [2025-03-17 19:57:20,335 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 19:57:20,336 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 19:57:20,336 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 19:57:20,336 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 19:57:20,336 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:57:20" (1/1) ... [2025-03-17 19:57:20,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:20,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:20,358 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:20,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-17 19:57:20,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 19:57:20,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 19:57:20,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 19:57:20,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 19:57:20,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 19:57:20,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 19:57:20,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 19:57:20,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 19:57:20,441 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 19:57:20,442 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 19:57:20,524 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L574: havoc main_#t~ret10#1;call ULTIMATE.dealloc(main_#t~malloc8#1.base, main_#t~malloc8#1.offset);havoc main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call ULTIMATE.dealloc(main_#t~malloc9#1.base, main_#t~malloc9#1.offset);havoc main_#t~malloc9#1.base, main_#t~malloc9#1.offset; [2025-03-17 19:57:20,532 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2025-03-17 19:57:20,532 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 19:57:20,540 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 19:57:20,541 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 19:57:20,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:57:20 BoogieIcfgContainer [2025-03-17 19:57:20,541 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 19:57:20,542 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-17 19:57:20,542 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-17 19:57:20,546 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-17 19:57:20,547 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:57:20,548 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.03 07:57:19" (1/3) ... [2025-03-17 19:57:20,549 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@10a32792 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 07:57:20, skipping insertion in model container [2025-03-17 19:57:20,549 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:57:20,549 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:57:20" (2/3) ... [2025-03-17 19:57:20,549 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@10a32792 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.03 07:57:20, skipping insertion in model container [2025-03-17 19:57:20,550 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-17 19:57:20,550 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:57:20" (3/3) ... [2025-03-17 19:57:20,551 INFO L363 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrcspn-alloca-1.i [2025-03-17 19:57:20,584 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-17 19:57:20,585 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-17 19:57:20,585 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-17 19:57:20,585 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-17 19:57:20,586 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-17 19:57:20,586 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-17 19:57:20,586 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-17 19:57:20,586 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-17 19:57:20,591 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:57:20,601 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-17 19:57:20,601 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:57:20,601 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:57:20,604 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-17 19:57:20,604 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:57:20,604 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-17 19:57:20,605 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:57:20,605 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-17 19:57:20,605 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:57:20,605 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:57:20,605 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-17 19:57:20,605 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-17 19:57:20,609 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~nondet6#1, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~ret10#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet6#1;main_~length1~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;main_~length2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~length1~0#1 < 1);" "assume !(main_~length2~0#1 < 1);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 18446744073709551616);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 18446744073709551616);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int#0(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#1(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, cstrcspn_#t~mem3#1, cstrcspn_#t~post4#1.base, cstrcspn_#t~post4#1.offset, cstrcspn_#t~mem5#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~p~0#1.base, cstrcspn_~p~0#1.offset, cstrcspn_~spanp~0#1.base, cstrcspn_~spanp~0#1.offset, cstrcspn_~c~0#1, cstrcspn_~sc~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_~p~0#1.base, cstrcspn_~p~0#1.offset;havoc cstrcspn_~spanp~0#1.base, cstrcspn_~spanp~0#1.offset;havoc cstrcspn_~c~0#1;havoc cstrcspn_~sc~0#1;cstrcspn_~p~0#1.base, cstrcspn_~p~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset;" [2025-03-17 19:57:20,609 INFO L754 eck$LassoCheckResult]: Loop: "assume true;cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset := cstrcspn_~p~0#1.base, cstrcspn_~p~0#1.offset;cstrcspn_~p~0#1.base, cstrcspn_~p~0#1.offset := cstrcspn_#t~post2#1.base, 1 + cstrcspn_#t~post2#1.offset;call cstrcspn_#t~mem3#1 := read~int#0(cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem3#1;havoc cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset;havoc cstrcspn_#t~mem3#1;cstrcspn_~spanp~0#1.base, cstrcspn_~spanp~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;" "assume !true;" [2025-03-17 19:57:20,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:20,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1476574, now seen corresponding path program 1 times [2025-03-17 19:57:20,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:20,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303028277] [2025-03-17 19:57:20,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:57:20,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:20,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:57:20,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:57:20,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:20,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:20,698 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:57:20,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:57:20,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:57:20,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:20,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:20,743 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:57:20,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:20,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1312, now seen corresponding path program 1 times [2025-03-17 19:57:20,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:20,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934826101] [2025-03-17 19:57:20,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:57:20,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:20,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 19:57:20,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 19:57:20,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:20,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:57:20,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:57:20,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:57:20,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934826101] [2025-03-17 19:57:20,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934826101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:57:20,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:57:20,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 19:57:20,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336835706] [2025-03-17 19:57:20,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:57:20,780 INFO L769 eck$LassoCheckResult]: loop already infeasible [2025-03-17 19:57:20,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:57:20,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 19:57:20,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 19:57:20,799 INFO L87 Difference]: Start difference. First operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 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, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:57:20,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:57:20,803 INFO L93 Difference]: Finished difference Result 12 states and 15 transitions. [2025-03-17 19:57:20,803 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 15 transitions. [2025-03-17 19:57:20,804 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-17 19:57:20,807 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 8 states and 11 transitions. [2025-03-17 19:57:20,807 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-17 19:57:20,808 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-17 19:57:20,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 11 transitions. [2025-03-17 19:57:20,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 19:57:20,808 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 11 transitions. [2025-03-17 19:57:20,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 11 transitions. [2025-03-17 19:57:20,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2025-03-17 19:57:20,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:57:20,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2025-03-17 19:57:20,826 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 11 transitions. [2025-03-17 19:57:20,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 19:57:20,829 INFO L432 stractBuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2025-03-17 19:57:20,830 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-17 19:57:20,830 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. [2025-03-17 19:57:20,830 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2025-03-17 19:57:20,831 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:57:20,831 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:57:20,831 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-17 19:57:20,831 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-03-17 19:57:20,832 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~nondet6#1, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~ret10#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet6#1;main_~length1~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;main_~length2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~length1~0#1 < 1);" "assume !(main_~length2~0#1 < 1);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 18446744073709551616);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 18446744073709551616);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int#0(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#1(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, cstrcspn_#t~mem3#1, cstrcspn_#t~post4#1.base, cstrcspn_#t~post4#1.offset, cstrcspn_#t~mem5#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~p~0#1.base, cstrcspn_~p~0#1.offset, cstrcspn_~spanp~0#1.base, cstrcspn_~spanp~0#1.offset, cstrcspn_~c~0#1, cstrcspn_~sc~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_~p~0#1.base, cstrcspn_~p~0#1.offset;havoc cstrcspn_~spanp~0#1.base, cstrcspn_~spanp~0#1.offset;havoc cstrcspn_~c~0#1;havoc cstrcspn_~sc~0#1;cstrcspn_~p~0#1.base, cstrcspn_~p~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset;" [2025-03-17 19:57:20,832 INFO L754 eck$LassoCheckResult]: Loop: "assume true;cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset := cstrcspn_~p~0#1.base, cstrcspn_~p~0#1.offset;cstrcspn_~p~0#1.base, cstrcspn_~p~0#1.offset := cstrcspn_#t~post2#1.base, 1 + cstrcspn_#t~post2#1.offset;call cstrcspn_#t~mem3#1 := read~int#0(cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem3#1;havoc cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset;havoc cstrcspn_#t~mem3#1;cstrcspn_~spanp~0#1.base, cstrcspn_~spanp~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;" "assume true;cstrcspn_#t~post4#1.base, cstrcspn_#t~post4#1.offset := cstrcspn_~spanp~0#1.base, cstrcspn_~spanp~0#1.offset;cstrcspn_~spanp~0#1.base, cstrcspn_~spanp~0#1.offset := cstrcspn_#t~post4#1.base, 1 + cstrcspn_#t~post4#1.offset;call cstrcspn_#t~mem5#1 := read~int#1(cstrcspn_#t~post4#1.base, cstrcspn_#t~post4#1.offset, 1);cstrcspn_~sc~0#1 := cstrcspn_#t~mem5#1;" "assume !(cstrcspn_~sc~0#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~post4#1.base, cstrcspn_#t~post4#1.offset;havoc cstrcspn_#t~mem5#1;" "assume !(0 != cstrcspn_~sc~0#1);" [2025-03-17 19:57:20,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:20,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1476574, now seen corresponding path program 2 times [2025-03-17 19:57:20,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:20,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706481829] [2025-03-17 19:57:20,834 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:57:20,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:20,847 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:57:20,858 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:57:20,860 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:57:20,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:20,860 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:57:20,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:57:20,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:57:20,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:20,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:20,888 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:57:20,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:20,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1260124, now seen corresponding path program 1 times [2025-03-17 19:57:20,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:20,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467032003] [2025-03-17 19:57:20,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:57:20,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:20,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:57:20,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:57:20,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:20,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:20,905 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:57:20,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:57:20,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:57:20,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:20,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:20,913 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:57:20,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:20,914 INFO L85 PathProgramCache]: Analyzing trace with hash 2142800825, now seen corresponding path program 1 times [2025-03-17 19:57:20,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:20,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234896153] [2025-03-17 19:57:20,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:57:20,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:20,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 19:57:20,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 19:57:20,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:20,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:20,946 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:57:20,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 19:57:20,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 19:57:20,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:20,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:20,989 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:57:21,646 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:57:21,647 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:57:21,647 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:57:21,647 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:57:21,647 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:57:21,647 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:21,647 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:57:21,647 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:57:21,648 INFO L132 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrcspn-alloca-1.i_Iteration2_Lasso [2025-03-17 19:57:21,648 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:57:21,648 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:57:21,663 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:21,669 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:21,671 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:21,674 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:21,676 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:21,678 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:21,681 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:21,684 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:21,687 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:21,688 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:21,690 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:21,692 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:21,694 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:21,966 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:21,970 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:21,972 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:21,974 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:21,976 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:21,978 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:21,979 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:21,981 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:21,983 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:21,985 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:21,987 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:21,989 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:22,273 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:57:22,278 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:57:22,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:22,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:22,281 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:22,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-03-17 19:57:22,284 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:57:22,296 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:22,296 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:22,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:22,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:22,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:22,300 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:22,300 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:22,304 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:22,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-03-17 19:57:22,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:22,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:22,313 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:22,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-03-17 19:57:22,316 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:57:22,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:22,329 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:22,329 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:22,329 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:22,329 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:22,329 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:22,329 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:22,330 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:22,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-03-17 19:57:22,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:22,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:22,339 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:22,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-03-17 19:57:22,342 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:57:22,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:22,352 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:22,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:22,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:22,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:22,353 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:22,353 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:22,355 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:22,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-03-17 19:57:22,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:22,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:22,364 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:22,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-03-17 19:57:22,366 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:57:22,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:22,377 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:22,377 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:22,377 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:22,377 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:22,378 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:22,378 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:22,379 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:22,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-03-17 19:57:22,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:22,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:22,387 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:22,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-17 19:57:22,391 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:57:22,401 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:22,401 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:22,401 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:22,401 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:22,401 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:22,402 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:22,402 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:22,404 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:22,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-03-17 19:57:22,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:22,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:22,412 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:22,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-03-17 19:57:22,415 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:57:22,426 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:22,426 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:22,426 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:22,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:22,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:22,428 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:22,428 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:22,430 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:22,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-03-17 19:57:22,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:22,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:22,437 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:22,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-03-17 19:57:22,439 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:57:22,452 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:22,452 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:22,452 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:22,452 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:22,452 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:22,453 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:22,453 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:22,454 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:22,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-03-17 19:57:22,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:22,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:22,461 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:22,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-03-17 19:57:22,462 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:57:22,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:22,473 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:22,473 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:22,473 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:22,475 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:57:22,475 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:57:22,478 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:22,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-03-17 19:57:22,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:22,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:22,486 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:22,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-03-17 19:57:22,488 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:57:22,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:22,498 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:22,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:22,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:22,498 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:22,499 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:22,499 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:22,502 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:22,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-03-17 19:57:22,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:22,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:22,509 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:22,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-03-17 19:57:22,512 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:57:22,522 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:22,522 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:22,522 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:22,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:22,522 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:22,523 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:22,523 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:22,524 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:22,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-03-17 19:57:22,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:22,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:22,532 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:22,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-03-17 19:57:22,535 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:57:22,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:22,546 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:22,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:22,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:22,546 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:22,546 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:22,546 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:22,547 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:22,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-03-17 19:57:22,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:22,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:22,555 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:22,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-03-17 19:57:22,558 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:57:22,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:22,568 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:22,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:22,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:22,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:22,569 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:22,569 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:22,570 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:22,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-03-17 19:57:22,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:22,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:22,578 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:22,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-03-17 19:57:22,582 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:57:22,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:22,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:22,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:22,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:22,602 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:57:22,602 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:57:22,609 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:22,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-03-17 19:57:22,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:22,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:22,618 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:22,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-03-17 19:57:22,620 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:57:22,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:22,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:22,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:22,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:22,634 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:57:22,634 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:57:22,637 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:22,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-03-17 19:57:22,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:22,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:22,645 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:22,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-03-17 19:57:22,649 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:57:22,659 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:22,659 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:22,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:22,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:22,664 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:57:22,664 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:57:22,670 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:22,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-03-17 19:57:22,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:22,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:22,679 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:22,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-03-17 19:57:22,683 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:57:22,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:22,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:22,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:22,694 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:22,697 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:57:22,697 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:57:22,703 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:57:22,730 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2025-03-17 19:57:22,732 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-03-17 19:57:22,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:22,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:22,735 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:22,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-03-17 19:57:22,738 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:57:22,749 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 19:57:22,749 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:57:22,750 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc8#1.base)_1, ULTIMATE.start_cstrcspn_~p~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc8#1.base)_1 - 1*ULTIMATE.start_cstrcspn_~p~0#1.offset Supporting invariants [] [2025-03-17 19:57:22,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-03-17 19:57:22,781 INFO L156 tatePredicateManager]: 9 out of 10 supporting invariants were superfluous and have been removed [2025-03-17 19:57:22,786 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-17 19:57:22,787 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-17 19:57:22,788 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~p~0!offset [2025-03-17 19:57:22,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:22,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:57:22,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:57:22,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:22,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:57:22,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 19:57:22,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:57:22,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:57:22,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:57:22,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:22,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:57:22,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 19:57:22,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:57:22,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:57:22,886 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-17 19:57:22,887 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 11 transitions. cyclomatic complexity: 4 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:57:22,925 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 11 transitions. cyclomatic complexity: 4. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 15 states and 19 transitions. Complement of second has 4 states. [2025-03-17 19:57:22,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-17 19:57:22,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:57:22,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2025-03-17 19:57:22,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 4 letters. Loop has 4 letters. [2025-03-17 19:57:22,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:57:22,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 8 letters. Loop has 4 letters. [2025-03-17 19:57:22,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:57:22,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 4 letters. Loop has 8 letters. [2025-03-17 19:57:22,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:57:22,933 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2025-03-17 19:57:22,933 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 19:57:22,933 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 14 states and 18 transitions. [2025-03-17 19:57:22,933 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-17 19:57:22,934 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2025-03-17 19:57:22,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 18 transitions. [2025-03-17 19:57:22,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:57:22,934 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 18 transitions. [2025-03-17 19:57:22,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 18 transitions. [2025-03-17 19:57:22,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2025-03-17 19:57:22,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:57:22,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2025-03-17 19:57:22,935 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 17 transitions. [2025-03-17 19:57:22,935 INFO L432 stractBuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2025-03-17 19:57:22,935 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-17 19:57:22,935 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2025-03-17 19:57:22,935 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 19:57:22,935 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:57:22,935 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:57:22,935 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-03-17 19:57:22,935 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 19:57:22,935 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~nondet6#1, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~ret10#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet6#1;main_~length1~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;main_~length2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~length1~0#1 < 1);" "assume !(main_~length2~0#1 < 1);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 18446744073709551616);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 18446744073709551616);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int#0(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#1(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, cstrcspn_#t~mem3#1, cstrcspn_#t~post4#1.base, cstrcspn_#t~post4#1.offset, cstrcspn_#t~mem5#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~p~0#1.base, cstrcspn_~p~0#1.offset, cstrcspn_~spanp~0#1.base, cstrcspn_~spanp~0#1.offset, cstrcspn_~c~0#1, cstrcspn_~sc~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_~p~0#1.base, cstrcspn_~p~0#1.offset;havoc cstrcspn_~spanp~0#1.base, cstrcspn_~spanp~0#1.offset;havoc cstrcspn_~c~0#1;havoc cstrcspn_~sc~0#1;cstrcspn_~p~0#1.base, cstrcspn_~p~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset;" "assume true;cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset := cstrcspn_~p~0#1.base, cstrcspn_~p~0#1.offset;cstrcspn_~p~0#1.base, cstrcspn_~p~0#1.offset := cstrcspn_#t~post2#1.base, 1 + cstrcspn_#t~post2#1.offset;call cstrcspn_#t~mem3#1 := read~int#0(cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem3#1;havoc cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset;havoc cstrcspn_#t~mem3#1;cstrcspn_~spanp~0#1.base, cstrcspn_~spanp~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;" "assume true;cstrcspn_#t~post4#1.base, cstrcspn_#t~post4#1.offset := cstrcspn_~spanp~0#1.base, cstrcspn_~spanp~0#1.offset;cstrcspn_~spanp~0#1.base, cstrcspn_~spanp~0#1.offset := cstrcspn_#t~post4#1.base, 1 + cstrcspn_#t~post4#1.offset;call cstrcspn_#t~mem5#1 := read~int#1(cstrcspn_#t~post4#1.base, cstrcspn_#t~post4#1.offset, 1);cstrcspn_~sc~0#1 := cstrcspn_#t~mem5#1;" [2025-03-17 19:57:22,935 INFO L754 eck$LassoCheckResult]: Loop: "assume !(cstrcspn_~sc~0#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~post4#1.base, cstrcspn_#t~post4#1.offset;havoc cstrcspn_#t~mem5#1;" "assume 0 != cstrcspn_~sc~0#1;" "assume true;cstrcspn_#t~post4#1.base, cstrcspn_#t~post4#1.offset := cstrcspn_~spanp~0#1.base, cstrcspn_~spanp~0#1.offset;cstrcspn_~spanp~0#1.base, cstrcspn_~spanp~0#1.offset := cstrcspn_#t~post4#1.base, 1 + cstrcspn_#t~post4#1.offset;call cstrcspn_#t~mem5#1 := read~int#1(cstrcspn_#t~post4#1.base, cstrcspn_#t~post4#1.offset, 1);cstrcspn_~sc~0#1 := cstrcspn_#t~mem5#1;" [2025-03-17 19:57:22,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:22,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1418987964, now seen corresponding path program 1 times [2025-03-17 19:57:22,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:22,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190808268] [2025-03-17 19:57:22,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:57:22,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:22,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:57:22,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:57:22,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:22,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:22,961 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:57:22,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:57:22,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:57:22,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:22,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:22,987 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:57:22,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:22,989 INFO L85 PathProgramCache]: Analyzing trace with hash 37612, now seen corresponding path program 1 times [2025-03-17 19:57:22,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:22,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505814073] [2025-03-17 19:57:22,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:57:22,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:22,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:57:22,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:57:22,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:22,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:22,992 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:57:22,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:57:22,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:57:22,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:22,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:22,995 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:57:22,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:22,995 INFO L85 PathProgramCache]: Analyzing trace with hash 2002316113, now seen corresponding path program 1 times [2025-03-17 19:57:22,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:22,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805741397] [2025-03-17 19:57:22,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:57:22,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:23,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 19:57:23,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 19:57:23,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:23,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:23,008 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:57:23,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 19:57:23,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 19:57:23,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:23,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:23,035 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:57:23,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-03-17 19:57:23,766 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:57:23,766 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:57:23,766 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:57:23,766 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:57:23,766 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:57:23,766 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:23,766 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:57:23,766 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:57:23,766 INFO L132 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrcspn-alloca-1.i_Iteration3_Lasso [2025-03-17 19:57:23,766 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:57:23,766 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:57:23,770 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:23,774 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:23,775 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:23,777 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:23,779 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:23,781 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:23,782 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:23,785 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:23,786 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:23,789 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:24,069 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:24,071 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:24,073 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:24,075 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:24,077 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:24,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:24,080 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:24,082 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:24,084 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:24,088 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:24,090 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:24,091 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:24,093 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:24,337 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:57:24,337 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:57:24,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:24,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:24,340 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:24,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-03-17 19:57:24,343 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:57:24,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:24,352 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:24,353 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:24,353 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:24,353 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:24,353 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:24,353 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:24,354 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:24,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-03-17 19:57:24,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:24,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:24,361 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:24,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-03-17 19:57:24,363 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:57:24,372 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:24,372 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:24,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:24,372 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:24,372 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:24,373 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:24,373 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:24,374 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:24,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-03-17 19:57:24,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:24,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:24,381 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:24,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-03-17 19:57:24,382 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:57:24,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:24,392 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:24,392 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:24,392 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:24,392 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:24,392 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:24,392 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:24,393 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:24,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-03-17 19:57:24,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:24,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:24,400 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:24,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-03-17 19:57:24,401 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:57:24,411 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:24,411 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:24,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:24,411 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:24,411 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:24,411 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:24,411 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:24,412 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:24,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-03-17 19:57:24,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:24,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:24,419 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:24,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-03-17 19:57:24,420 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:57:24,429 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:24,430 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:24,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:24,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:24,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:24,430 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:24,430 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:24,431 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:24,436 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-17 19:57:24,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:24,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:24,438 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:24,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-03-17 19:57:24,439 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:57:24,452 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:24,452 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:24,452 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:24,452 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:24,452 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:24,452 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:24,452 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:24,453 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:24,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-03-17 19:57:24,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:24,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:24,461 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:24,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-03-17 19:57:24,464 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:57:24,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:24,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:24,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:24,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:24,476 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:57:24,476 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:57:24,479 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:24,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-03-17 19:57:24,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:24,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:24,486 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:24,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-03-17 19:57:24,489 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:57:24,499 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:24,499 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:24,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:24,499 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:24,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:24,499 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:24,499 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:24,500 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:24,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2025-03-17 19:57:24,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:24,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:24,507 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:24,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-03-17 19:57:24,509 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:57:24,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:24,518 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:24,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:24,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:24,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:24,519 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:24,519 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:24,520 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:24,524 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-17 19:57:24,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:24,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:24,526 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:24,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-03-17 19:57:24,529 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:57:24,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:24,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:24,538 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:24,538 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:24,539 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:57:24,540 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:57:24,543 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:24,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-03-17 19:57:24,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:24,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:24,552 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:24,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-03-17 19:57:24,554 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:57:24,563 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:24,563 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:24,563 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:24,563 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:24,565 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:57:24,565 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:57:24,567 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:24,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-03-17 19:57:24,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:24,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:24,575 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:24,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-03-17 19:57:24,578 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:57:24,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:24,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:24,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:24,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:24,589 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:57:24,589 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:57:24,593 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:24,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2025-03-17 19:57:24,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:24,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:24,600 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:24,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-03-17 19:57:24,602 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:57:24,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:24,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:24,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:24,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:24,616 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:57:24,617 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:57:24,623 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:24,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-03-17 19:57:24,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:24,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:24,631 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:24,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-03-17 19:57:24,633 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:57:24,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:24,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:24,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:24,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:24,647 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:57:24,647 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:57:24,657 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:57:24,677 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2025-03-17 19:57:24,678 INFO L444 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-03-17 19:57:24,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:24,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:24,679 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:24,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-03-17 19:57:24,682 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:57:24,693 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 19:57:24,693 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:57:24,693 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~spanp~0#1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc9#1.base)_2) = -1*ULTIMATE.start_cstrcspn_~spanp~0#1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9#1.base)_2 Supporting invariants [] [2025-03-17 19:57:24,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2025-03-17 19:57:24,717 INFO L156 tatePredicateManager]: 9 out of 10 supporting invariants were superfluous and have been removed [2025-03-17 19:57:24,719 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~spanp~0!offset [2025-03-17 19:57:24,719 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-17 19:57:24,719 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-17 19:57:24,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:24,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:57:24,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:57:24,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:24,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:57:24,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 19:57:24,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:57:24,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:57:24,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:57:24,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:24,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:57:24,790 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 19:57:24,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:57:24,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:57:24,806 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 1 loop predicates [2025-03-17 19:57:24,806 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 6 Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:57:24,845 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 6. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 27 states and 34 transitions. Complement of second has 7 states. [2025-03-17 19:57:24,846 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-17 19:57:24,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:57:24,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2025-03-17 19:57:24,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 6 letters. Loop has 3 letters. [2025-03-17 19:57:24,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:57:24,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 9 letters. Loop has 3 letters. [2025-03-17 19:57:24,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:57:24,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 6 letters. Loop has 6 letters. [2025-03-17 19:57:24,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:57:24,847 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. [2025-03-17 19:57:24,848 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 19:57:24,848 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 19 states and 24 transitions. [2025-03-17 19:57:24,848 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2025-03-17 19:57:24,848 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-03-17 19:57:24,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 24 transitions. [2025-03-17 19:57:24,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:57:24,848 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 24 transitions. [2025-03-17 19:57:24,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 24 transitions. [2025-03-17 19:57:24,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2025-03-17 19:57:24,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:57:24,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2025-03-17 19:57:24,849 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 22 transitions. [2025-03-17 19:57:24,849 INFO L432 stractBuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2025-03-17 19:57:24,849 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-17 19:57:24,849 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. [2025-03-17 19:57:24,849 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 19:57:24,849 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:57:24,849 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:57:24,849 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 19:57:24,850 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 19:57:24,850 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~nondet6#1, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~ret10#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet6#1;main_~length1~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;main_~length2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~length1~0#1 < 1);" "assume !(main_~length2~0#1 < 1);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 18446744073709551616);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 18446744073709551616);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int#0(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#1(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, cstrcspn_#t~mem3#1, cstrcspn_#t~post4#1.base, cstrcspn_#t~post4#1.offset, cstrcspn_#t~mem5#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~p~0#1.base, cstrcspn_~p~0#1.offset, cstrcspn_~spanp~0#1.base, cstrcspn_~spanp~0#1.offset, cstrcspn_~c~0#1, cstrcspn_~sc~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_~p~0#1.base, cstrcspn_~p~0#1.offset;havoc cstrcspn_~spanp~0#1.base, cstrcspn_~spanp~0#1.offset;havoc cstrcspn_~c~0#1;havoc cstrcspn_~sc~0#1;cstrcspn_~p~0#1.base, cstrcspn_~p~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset;" "assume true;cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset := cstrcspn_~p~0#1.base, cstrcspn_~p~0#1.offset;cstrcspn_~p~0#1.base, cstrcspn_~p~0#1.offset := cstrcspn_#t~post2#1.base, 1 + cstrcspn_#t~post2#1.offset;call cstrcspn_#t~mem3#1 := read~int#0(cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem3#1;havoc cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset;havoc cstrcspn_#t~mem3#1;cstrcspn_~spanp~0#1.base, cstrcspn_~spanp~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;" "assume true;cstrcspn_#t~post4#1.base, cstrcspn_#t~post4#1.offset := cstrcspn_~spanp~0#1.base, cstrcspn_~spanp~0#1.offset;cstrcspn_~spanp~0#1.base, cstrcspn_~spanp~0#1.offset := cstrcspn_#t~post4#1.base, 1 + cstrcspn_#t~post4#1.offset;call cstrcspn_#t~mem5#1 := read~int#1(cstrcspn_#t~post4#1.base, cstrcspn_#t~post4#1.offset, 1);cstrcspn_~sc~0#1 := cstrcspn_#t~mem5#1;" "assume !(cstrcspn_~sc~0#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~post4#1.base, cstrcspn_#t~post4#1.offset;havoc cstrcspn_#t~mem5#1;" "assume !(0 != cstrcspn_~sc~0#1);" "assume true;cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset := cstrcspn_~p~0#1.base, cstrcspn_~p~0#1.offset;cstrcspn_~p~0#1.base, cstrcspn_~p~0#1.offset := cstrcspn_#t~post2#1.base, 1 + cstrcspn_#t~post2#1.offset;call cstrcspn_#t~mem3#1 := read~int#0(cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem3#1;havoc cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset;havoc cstrcspn_#t~mem3#1;cstrcspn_~spanp~0#1.base, cstrcspn_~spanp~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;" "assume true;cstrcspn_#t~post4#1.base, cstrcspn_#t~post4#1.offset := cstrcspn_~spanp~0#1.base, cstrcspn_~spanp~0#1.offset;cstrcspn_~spanp~0#1.base, cstrcspn_~spanp~0#1.offset := cstrcspn_#t~post4#1.base, 1 + cstrcspn_#t~post4#1.offset;call cstrcspn_#t~mem5#1 := read~int#1(cstrcspn_#t~post4#1.base, cstrcspn_#t~post4#1.offset, 1);cstrcspn_~sc~0#1 := cstrcspn_#t~mem5#1;" [2025-03-17 19:57:24,850 INFO L754 eck$LassoCheckResult]: Loop: "assume !(cstrcspn_~sc~0#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~post4#1.base, cstrcspn_#t~post4#1.offset;havoc cstrcspn_#t~mem5#1;" "assume 0 != cstrcspn_~sc~0#1;" "assume true;cstrcspn_#t~post4#1.base, cstrcspn_#t~post4#1.offset := cstrcspn_~spanp~0#1.base, cstrcspn_~spanp~0#1.offset;cstrcspn_~spanp~0#1.base, cstrcspn_~spanp~0#1.offset := cstrcspn_#t~post4#1.base, 1 + cstrcspn_#t~post4#1.offset;call cstrcspn_#t~mem5#1 := read~int#1(cstrcspn_#t~post4#1.base, cstrcspn_#t~post4#1.offset, 1);cstrcspn_~sc~0#1 := cstrcspn_#t~mem5#1;" [2025-03-17 19:57:24,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:24,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1942258391, now seen corresponding path program 2 times [2025-03-17 19:57:24,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:24,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633705566] [2025-03-17 19:57:24,851 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:57:24,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:24,861 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-03-17 19:57:24,878 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 19:57:24,878 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:57:24,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:24,878 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:57:24,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-17 19:57:24,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-17 19:57:24,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:24,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:24,896 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:57:24,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:24,896 INFO L85 PathProgramCache]: Analyzing trace with hash 37612, now seen corresponding path program 2 times [2025-03-17 19:57:24,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:24,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604035397] [2025-03-17 19:57:24,896 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:57:24,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:24,899 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:57:24,900 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:57:24,900 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:57:24,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:24,900 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:57:24,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:57:24,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:57:24,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:24,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:24,902 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:57:24,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:24,905 INFO L85 PathProgramCache]: Analyzing trace with hash 20322390, now seen corresponding path program 1 times [2025-03-17 19:57:24,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:24,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772891054] [2025-03-17 19:57:24,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:57:24,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:24,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:57:24,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:57:24,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:24,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:57:25,098 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:57:25,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:57:25,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772891054] [2025-03-17 19:57:25,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772891054] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:57:25,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827287017] [2025-03-17 19:57:25,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:57:25,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:57:25,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:25,101 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:57:25,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2025-03-17 19:57:25,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:57:25,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:57:25,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:25,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:57:25,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-17 19:57:25,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:57:25,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 19:57:25,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2025-03-17 19:57:25,271 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:57:25,271 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:57:25,310 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:57:25,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827287017] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:57:25,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:57:25,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 14 [2025-03-17 19:57:25,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709961775] [2025-03-17 19:57:25,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:57:25,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:57:25,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 19:57:25,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-03-17 19:57:25,343 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. cyclomatic complexity: 8 Second operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:57:25,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:57:25,403 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2025-03-17 19:57:25,403 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2025-03-17 19:57:25,404 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 19:57:25,404 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 24 states and 29 transitions. [2025-03-17 19:57:25,404 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2025-03-17 19:57:25,404 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2025-03-17 19:57:25,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 29 transitions. [2025-03-17 19:57:25,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-17 19:57:25,404 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 29 transitions. [2025-03-17 19:57:25,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 29 transitions. [2025-03-17 19:57:25,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2025-03-17 19:57:25,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:57:25,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2025-03-17 19:57:25,405 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 26 transitions. [2025-03-17 19:57:25,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 19:57:25,408 INFO L432 stractBuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2025-03-17 19:57:25,408 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-17 19:57:25,408 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 26 transitions. [2025-03-17 19:57:25,408 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-03-17 19:57:25,408 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-17 19:57:25,408 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-17 19:57:25,408 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 19:57:25,408 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-17 19:57:25,408 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~nondet6#1, main_#t~nondet7#1, main_#t~malloc8#1.base, main_#t~malloc8#1.offset, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_#t~ret10#1, main_~length1~0#1, main_~length2~0#1, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc main_#t~nondet6#1;main_~length1~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;main_~length2~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;" "assume !(main_~length1~0#1 < 1);" "assume !(main_~length2~0#1 < 1);" "call main_#t~malloc8#1.base, main_#t~malloc8#1.offset := #Ultimate.allocOnStack(main_~length1~0#1 % 18446744073709551616);main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset := main_#t~malloc8#1.base, main_#t~malloc8#1.offset;call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(main_~length2~0#1 % 18446744073709551616);main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;call write~int#0(0, main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset + (main_~length1~0#1 - 1), 1);call write~int#1(0, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset + (main_~length2~0#1 - 1), 1);assume { :begin_inline_cstrcspn } true;cstrcspn_#in~s1#1.base, cstrcspn_#in~s1#1.offset, cstrcspn_#in~s2#1.base, cstrcspn_#in~s2#1.offset := main_~nondetString1~0#1.base, main_~nondetString1~0#1.offset, main_~nondetString2~0#1.base, main_~nondetString2~0#1.offset;havoc cstrcspn_#res#1;havoc cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, cstrcspn_#t~mem3#1, cstrcspn_#t~post4#1.base, cstrcspn_#t~post4#1.offset, cstrcspn_#t~mem5#1, cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset, cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset, cstrcspn_~p~0#1.base, cstrcspn_~p~0#1.offset, cstrcspn_~spanp~0#1.base, cstrcspn_~spanp~0#1.offset, cstrcspn_~c~0#1, cstrcspn_~sc~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_~p~0#1.base, cstrcspn_~p~0#1.offset;havoc cstrcspn_~spanp~0#1.base, cstrcspn_~spanp~0#1.offset;havoc cstrcspn_~c~0#1;havoc cstrcspn_~sc~0#1;cstrcspn_~p~0#1.base, cstrcspn_~p~0#1.offset := cstrcspn_~s1#1.base, cstrcspn_~s1#1.offset;" "assume true;cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset := cstrcspn_~p~0#1.base, cstrcspn_~p~0#1.offset;cstrcspn_~p~0#1.base, cstrcspn_~p~0#1.offset := cstrcspn_#t~post2#1.base, 1 + cstrcspn_#t~post2#1.offset;call cstrcspn_#t~mem3#1 := read~int#0(cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem3#1;havoc cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset;havoc cstrcspn_#t~mem3#1;cstrcspn_~spanp~0#1.base, cstrcspn_~spanp~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;" "assume true;cstrcspn_#t~post4#1.base, cstrcspn_#t~post4#1.offset := cstrcspn_~spanp~0#1.base, cstrcspn_~spanp~0#1.offset;cstrcspn_~spanp~0#1.base, cstrcspn_~spanp~0#1.offset := cstrcspn_#t~post4#1.base, 1 + cstrcspn_#t~post4#1.offset;call cstrcspn_#t~mem5#1 := read~int#1(cstrcspn_#t~post4#1.base, cstrcspn_#t~post4#1.offset, 1);cstrcspn_~sc~0#1 := cstrcspn_#t~mem5#1;" "assume !(cstrcspn_~sc~0#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~post4#1.base, cstrcspn_#t~post4#1.offset;havoc cstrcspn_#t~mem5#1;" "assume 0 != cstrcspn_~sc~0#1;" "assume true;cstrcspn_#t~post4#1.base, cstrcspn_#t~post4#1.offset := cstrcspn_~spanp~0#1.base, cstrcspn_~spanp~0#1.offset;cstrcspn_~spanp~0#1.base, cstrcspn_~spanp~0#1.offset := cstrcspn_#t~post4#1.base, 1 + cstrcspn_#t~post4#1.offset;call cstrcspn_#t~mem5#1 := read~int#1(cstrcspn_#t~post4#1.base, cstrcspn_#t~post4#1.offset, 1);cstrcspn_~sc~0#1 := cstrcspn_#t~mem5#1;" "assume !(cstrcspn_~sc~0#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~post4#1.base, cstrcspn_#t~post4#1.offset;havoc cstrcspn_#t~mem5#1;" "assume !(0 != cstrcspn_~sc~0#1);" "assume true;cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset := cstrcspn_~p~0#1.base, cstrcspn_~p~0#1.offset;cstrcspn_~p~0#1.base, cstrcspn_~p~0#1.offset := cstrcspn_#t~post2#1.base, 1 + cstrcspn_#t~post2#1.offset;call cstrcspn_#t~mem3#1 := read~int#0(cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset, 1);cstrcspn_~c~0#1 := cstrcspn_#t~mem3#1;havoc cstrcspn_#t~post2#1.base, cstrcspn_#t~post2#1.offset;havoc cstrcspn_#t~mem3#1;cstrcspn_~spanp~0#1.base, cstrcspn_~spanp~0#1.offset := cstrcspn_~s2#1.base, cstrcspn_~s2#1.offset;" "assume true;cstrcspn_#t~post4#1.base, cstrcspn_#t~post4#1.offset := cstrcspn_~spanp~0#1.base, cstrcspn_~spanp~0#1.offset;cstrcspn_~spanp~0#1.base, cstrcspn_~spanp~0#1.offset := cstrcspn_#t~post4#1.base, 1 + cstrcspn_#t~post4#1.offset;call cstrcspn_#t~mem5#1 := read~int#1(cstrcspn_#t~post4#1.base, cstrcspn_#t~post4#1.offset, 1);cstrcspn_~sc~0#1 := cstrcspn_#t~mem5#1;" [2025-03-17 19:57:25,408 INFO L754 eck$LassoCheckResult]: Loop: "assume !(cstrcspn_~sc~0#1 == cstrcspn_~c~0#1);havoc cstrcspn_#t~post4#1.base, cstrcspn_#t~post4#1.offset;havoc cstrcspn_#t~mem5#1;" "assume 0 != cstrcspn_~sc~0#1;" "assume true;cstrcspn_#t~post4#1.base, cstrcspn_#t~post4#1.offset := cstrcspn_~spanp~0#1.base, cstrcspn_~spanp~0#1.offset;cstrcspn_~spanp~0#1.base, cstrcspn_~spanp~0#1.offset := cstrcspn_#t~post4#1.base, 1 + cstrcspn_#t~post4#1.offset;call cstrcspn_#t~mem5#1 := read~int#1(cstrcspn_#t~post4#1.base, cstrcspn_#t~post4#1.offset, 1);cstrcspn_~sc~0#1 := cstrcspn_#t~mem5#1;" [2025-03-17 19:57:25,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:25,409 INFO L85 PathProgramCache]: Analyzing trace with hash -10186260, now seen corresponding path program 2 times [2025-03-17 19:57:25,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:25,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114913086] [2025-03-17 19:57:25,409 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:57:25,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:25,414 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-17 19:57:25,427 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:57:25,427 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:57:25,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:25,427 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:57:25,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:57:25,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:57:25,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:25,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:25,447 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:57:25,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:25,448 INFO L85 PathProgramCache]: Analyzing trace with hash 37612, now seen corresponding path program 3 times [2025-03-17 19:57:25,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:25,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492492092] [2025-03-17 19:57:25,448 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:57:25,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:25,452 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:57:25,453 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:57:25,453 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 19:57:25,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:25,453 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:57:25,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:57:25,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:57:25,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:25,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:25,456 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:57:25,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:25,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1483814177, now seen corresponding path program 3 times [2025-03-17 19:57:25,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:57:25,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076580451] [2025-03-17 19:57:25,456 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:57:25,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:57:25,464 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 3 equivalence classes. [2025-03-17 19:57:25,480 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 19:57:25,480 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-17 19:57:25,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:25,480 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 19:57:25,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 19:57:25,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 19:57:25,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:25,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 19:57:25,498 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 19:57:26,388 INFO L204 LassoAnalysis]: Preferences: [2025-03-17 19:57:26,389 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-17 19:57:26,389 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-17 19:57:26,389 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-17 19:57:26,389 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-17 19:57:26,389 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:26,389 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-17 19:57:26,389 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-17 19:57:26,389 INFO L132 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrcspn-alloca-1.i_Iteration5_Lasso [2025-03-17 19:57:26,389 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-17 19:57:26,389 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-17 19:57:26,390 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:26,393 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:26,667 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:26,669 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:26,671 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:26,673 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:26,674 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:26,675 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:26,677 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:26,678 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:26,679 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:26,680 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:26,681 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:26,682 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:26,683 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:26,684 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:26,688 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:26,689 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:26,690 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:26,692 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:26,693 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:26,694 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:26,696 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-17 19:57:27,097 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-17 19:57:27,097 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-17 19:57:27,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:27,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:27,099 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:27,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-03-17 19:57:27,100 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:57:27,110 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:27,110 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-17 19:57:27,110 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:27,110 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:27,110 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:27,111 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-17 19:57:27,111 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-17 19:57:27,112 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-17 19:57:27,117 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-17 19:57:27,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:27,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:27,119 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:27,122 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-17 19:57:27,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-03-17 19:57:27,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-17 19:57:27,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-17 19:57:27,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-17 19:57:27,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-17 19:57:27,135 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-17 19:57:27,135 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-17 19:57:27,141 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-17 19:57:27,149 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-03-17 19:57:27,149 INFO L444 ModelExtractionUtils]: 7 out of 16 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-03-17 19:57:27,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-17 19:57:27,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:57:27,151 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-17 19:57:27,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-03-17 19:57:27,152 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-17 19:57:27,163 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-17 19:57:27,163 INFO L474 LassoAnalysis]: Proved termination. [2025-03-17 19:57:27,163 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcspn_~spanp~0#1.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc9#1.base)_3) = -1*ULTIMATE.start_cstrcspn_~spanp~0#1.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9#1.base)_3 Supporting invariants [] [2025-03-17 19:57:27,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2025-03-17 19:57:27,183 INFO L156 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2025-03-17 19:57:27,185 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~spanp~0!offset [2025-03-17 19:57:27,185 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-17 19:57:27,185 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-17 19:57:27,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:27,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:57:27,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:57:27,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:27,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:57:27,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 19:57:27,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:57:27,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:57:27,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:57:27,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:27,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:57:27,264 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 19:57:27,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:57:27,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:57:27,276 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 1 loop predicates [2025-03-17 19:57:27,276 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 8 Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:57:27,310 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 8. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 26 states and 32 transitions. Complement of second has 7 states. [2025-03-17 19:57:27,310 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-17 19:57:27,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:57:27,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2025-03-17 19:57:27,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 13 letters. Loop has 3 letters. [2025-03-17 19:57:27,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:57:27,311 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:57:27,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:27,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:57:27,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:57:27,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:27,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:57:27,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 19:57:27,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:57:27,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:57:27,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:57:27,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:27,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:57:27,387 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 19:57:27,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:57:27,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:57:27,401 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 1 loop predicates [2025-03-17 19:57:27,401 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 8 Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:57:27,431 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 8. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 26 states and 32 transitions. Complement of second has 7 states. [2025-03-17 19:57:27,431 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-17 19:57:27,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:57:27,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2025-03-17 19:57:27,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 13 letters. Loop has 3 letters. [2025-03-17 19:57:27,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:57:27,432 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-17 19:57:27,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:57:27,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:57:27,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:57:27,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:27,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:57:27,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 19:57:27,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:57:27,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 19:57:27,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 19:57:27,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:57:27,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:57:27,517 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 19:57:27,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:57:27,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:57:27,530 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 1 loop predicates [2025-03-17 19:57:27,531 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 8 Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:57:27,560 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 26 transitions. cyclomatic complexity: 8. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 31 states and 40 transitions. Complement of second has 6 states. [2025-03-17 19:57:27,560 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-17 19:57:27,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:57:27,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2025-03-17 19:57:27,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 13 letters. Loop has 3 letters. [2025-03-17 19:57:27,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:57:27,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 16 letters. Loop has 3 letters. [2025-03-17 19:57:27,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:57:27,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 13 letters. Loop has 6 letters. [2025-03-17 19:57:27,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-17 19:57:27,562 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2025-03-17 19:57:27,563 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-17 19:57:27,563 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 0 states and 0 transitions. [2025-03-17 19:57:27,563 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-17 19:57:27,563 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-17 19:57:27,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-17 19:57:27,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-17 19:57:27,563 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 19:57:27,563 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 19:57:27,563 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 19:57:27,563 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-17 19:57:27,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-17 19:57:27,563 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-17 19:57:27,563 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-17 19:57:27,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.03 07:57:27 BoogieIcfgContainer [2025-03-17 19:57:27,569 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-17 19:57:27,569 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 19:57:27,569 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 19:57:27,569 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 19:57:27,570 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:57:20" (3/4) ... [2025-03-17 19:57:27,571 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 19:57:27,572 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 19:57:27,573 INFO L158 Benchmark]: Toolchain (without parser) took 7576.43ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 104.6MB in the beginning and 139.7MB in the end (delta: -35.1MB). Peak memory consumption was 156.5MB. Max. memory is 16.1GB. [2025-03-17 19:57:27,573 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:57:27,573 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.48ms. Allocated memory is still 142.6MB. Free memory was 104.6MB in the beginning and 88.4MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 19:57:27,573 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.28ms. Allocated memory is still 142.6MB. Free memory was 88.4MB in the beginning and 87.4MB in the end (delta: 996.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:57:27,573 INFO L158 Benchmark]: Boogie Preprocessor took 21.56ms. Allocated memory is still 142.6MB. Free memory was 87.4MB in the beginning and 85.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:57:27,573 INFO L158 Benchmark]: IcfgBuilder took 206.04ms. Allocated memory is still 142.6MB. Free memory was 85.4MB in the beginning and 71.6MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 19:57:27,574 INFO L158 Benchmark]: BuchiAutomizer took 7026.67ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 71.6MB in the beginning and 139.8MB in the end (delta: -68.2MB). Peak memory consumption was 122.9MB. Max. memory is 16.1GB. [2025-03-17 19:57:27,574 INFO L158 Benchmark]: Witness Printer took 2.67ms. Allocated memory is still 335.5MB. Free memory was 139.8MB in the beginning and 139.7MB in the end (delta: 106.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:57:27,579 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.20ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 291.48ms. Allocated memory is still 142.6MB. Free memory was 104.6MB in the beginning and 88.4MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.28ms. Allocated memory is still 142.6MB. Free memory was 88.4MB in the beginning and 87.4MB in the end (delta: 996.9kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.56ms. Allocated memory is still 142.6MB. Free memory was 87.4MB in the beginning and 85.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 206.04ms. Allocated memory is still 142.6MB. Free memory was 85.4MB in the beginning and 71.6MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 7026.67ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 71.6MB in the beginning and 139.8MB in the end (delta: -68.2MB). Peak memory consumption was 122.9MB. Max. memory is 16.1GB. * Witness Printer took 2.67ms. Allocated memory is still 335.5MB. Free memory was 139.8MB in the beginning and 139.7MB in the end (delta: 106.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~p~0!offset - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~spanp~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: ~spanp~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 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.9s and 6 iterations. TraceHistogramMax:3. Analysis of lassos took 6.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 6 StatesRemovedByMinimization, 3 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, 75 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 75 mSDsluCounter, 154 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 85 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 107 IncrementalHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 69 mSDtfsCounter, 107 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital233 mio100 ax107 hnf100 lsp92 ukn69 mio100 lsp28 div100 bol100 ite100 ukn100 eq161 hnf91 smp97 dnf230 smp91 tf100 neg100 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 18ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-03-17 19:57:27,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-03-17 19:57:27,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2025-03-17 19:57:27,990 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