./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loops/string-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loops/string-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 7c71ebd98a3b6e7de0397eeeb86fda8d96b2d4c8ea0b8e1766ce392ff80613de --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 07:16:58,767 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 07:16:58,822 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-09 07:16:58,827 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 07:16:58,828 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 07:16:58,828 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-09 07:16:58,849 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 07:16:58,849 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 07:16:58,850 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 07:16:58,850 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 07:16:58,850 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 07:16:58,850 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 07:16:58,850 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 07:16:58,851 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 07:16:58,851 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-09 07:16:58,851 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-09 07:16:58,852 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-09 07:16:58,852 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-09 07:16:58,852 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-09 07:16:58,852 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-09 07:16:58,852 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 07:16:58,852 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-09 07:16:58,852 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 07:16:58,852 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 07:16:58,852 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 07:16:58,852 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 07:16:58,853 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-09 07:16:58,853 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-09 07:16:58,853 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-09 07:16:58,853 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 07:16:58,853 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 07:16:58,853 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 07:16:58,853 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-09 07:16:58,853 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 07:16:58,853 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 07:16:58,853 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 07:16:58,853 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 07:16:58,854 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 07:16:58,854 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 07:16:58,854 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-09 07:16:58,854 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7c71ebd98a3b6e7de0397eeeb86fda8d96b2d4c8ea0b8e1766ce392ff80613de [2025-03-09 07:16:59,076 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 07:16:59,082 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 07:16:59,084 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 07:16:59,085 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 07:16:59,085 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 07:16:59,086 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/string-1.i [2025-03-09 07:17:00,228 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/989f4f413/0b0d66b3b9114abe8fa5d5be870d8e0e/FLAGf88318ec6 [2025-03-09 07:17:00,483 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 07:17:00,484 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/string-1.i [2025-03-09 07:17:00,491 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/989f4f413/0b0d66b3b9114abe8fa5d5be870d8e0e/FLAGf88318ec6 [2025-03-09 07:17:00,508 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/989f4f413/0b0d66b3b9114abe8fa5d5be870d8e0e [2025-03-09 07:17:00,510 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 07:17:00,512 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 07:17:00,513 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 07:17:00,513 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 07:17:00,516 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 07:17:00,517 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 07:17:00" (1/1) ... [2025-03-09 07:17:00,518 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60592373 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:17:00, skipping insertion in model container [2025-03-09 07:17:00,518 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 07:17:00" (1/1) ... [2025-03-09 07:17:00,530 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 07:17:00,633 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 07:17:00,643 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 07:17:00,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 07:17:00,667 INFO L204 MainTranslator]: Completed translation [2025-03-09 07:17:00,667 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:17:00 WrapperNode [2025-03-09 07:17:00,667 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 07:17:00,668 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 07:17:00,668 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 07:17:00,668 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 07:17:00,672 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:17:00" (1/1) ... [2025-03-09 07:17:00,677 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:17:00" (1/1) ... [2025-03-09 07:17:00,694 INFO L138 Inliner]: procedures = 17, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 112 [2025-03-09 07:17:00,695 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 07:17:00,696 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 07:17:00,697 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 07:17:00,697 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 07:17:00,702 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:17:00" (1/1) ... [2025-03-09 07:17:00,702 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:17:00" (1/1) ... [2025-03-09 07:17:00,704 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:17:00" (1/1) ... [2025-03-09 07:17:00,712 INFO L175 MemorySlicer]: Split 10 memory accesses to 3 slices as follows [2, 4, 4]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2025-03-09 07:17:00,713 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:17:00" (1/1) ... [2025-03-09 07:17:00,713 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:17:00" (1/1) ... [2025-03-09 07:17:00,717 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:17:00" (1/1) ... [2025-03-09 07:17:00,717 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:17:00" (1/1) ... [2025-03-09 07:17:00,719 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:17:00" (1/1) ... [2025-03-09 07:17:00,719 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:17:00" (1/1) ... [2025-03-09 07:17:00,721 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 07:17:00,722 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 07:17:00,722 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 07:17:00,722 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 07:17:00,724 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:17:00" (1/1) ... [2025-03-09 07:17:00,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:00,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:00,750 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:00,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-03-09 07:17:00,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 07:17:00,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 07:17:00,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 07:17:00,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 07:17:00,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 07:17:00,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 07:17:00,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 07:17:00,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 07:17:00,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 07:17:00,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 07:17:00,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 07:17:00,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 07:17:00,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 07:17:00,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 07:17:00,835 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 07:17:00,837 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 07:17:00,984 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L30: call ULTIMATE.dealloc(main_~#string_A~0#1.base, main_~#string_A~0#1.offset);havoc main_~#string_A~0#1.base, main_~#string_A~0#1.offset;call ULTIMATE.dealloc(main_~#string_B~0#1.base, main_~#string_B~0#1.offset);havoc main_~#string_B~0#1.base, main_~#string_B~0#1.offset; [2025-03-09 07:17:00,991 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-03-09 07:17:00,991 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 07:17:00,998 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 07:17:00,999 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 07:17:01,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 07:17:00 BoogieIcfgContainer [2025-03-09 07:17:01,000 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 07:17:01,001 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-09 07:17:01,001 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-09 07:17:01,005 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-09 07:17:01,005 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 07:17:01,005 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.03 07:17:00" (1/3) ... [2025-03-09 07:17:01,007 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4df4a3f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 07:17:01, skipping insertion in model container [2025-03-09 07:17:01,008 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 07:17:01,008 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 07:17:00" (2/3) ... [2025-03-09 07:17:01,009 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4df4a3f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.03 07:17:01, skipping insertion in model container [2025-03-09 07:17:01,009 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-09 07:17:01,009 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 07:17:00" (3/3) ... [2025-03-09 07:17:01,010 INFO L363 chiAutomizerObserver]: Analyzing ICFG string-1.i [2025-03-09 07:17:01,041 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-09 07:17:01,041 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-09 07:17:01,041 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-09 07:17:01,042 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-09 07:17:01,042 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-09 07:17:01,042 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-09 07:17:01,042 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-09 07:17:01,042 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-09 07:17:01,045 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 21 states have (on average 1.619047619047619) internal successors, (34), 21 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:17:01,055 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 8 [2025-03-09 07:17:01,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:17:01,056 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:17:01,058 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-09 07:17:01,058 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-09 07:17:01,058 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-09 07:17:01,059 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 22 states, 21 states have (on average 1.619047619047619) internal successors, (34), 21 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:17:01,059 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 8 [2025-03-09 07:17:01,059 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:17:01,060 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:17:01,060 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-09 07:17:01,060 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-09 07:17:01,063 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" [2025-03-09 07:17:01,063 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" [2025-03-09 07:17:01,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:01,066 INFO L85 PathProgramCache]: Analyzing trace with hash 2496, now seen corresponding path program 1 times [2025-03-09 07:17:01,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:01,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596735131] [2025-03-09 07:17:01,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:17:01,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:01,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:17:01,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:17:01,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:01,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:01,136 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:17:01,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:17:01,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:17:01,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:01,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:01,160 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:17:01,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:01,161 INFO L85 PathProgramCache]: Analyzing trace with hash 77, now seen corresponding path program 1 times [2025-03-09 07:17:01,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:01,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530577224] [2025-03-09 07:17:01,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:17:01,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:01,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-09 07:17:01,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-09 07:17:01,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:01,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:01,168 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:17:01,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-09 07:17:01,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-09 07:17:01,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:01,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:01,177 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:17:01,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:01,179 INFO L85 PathProgramCache]: Analyzing trace with hash 77422, now seen corresponding path program 1 times [2025-03-09 07:17:01,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:01,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901712974] [2025-03-09 07:17:01,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:17:01,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:01,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:17:01,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:17:01,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:01,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:01,212 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:17:01,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-09 07:17:01,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-09 07:17:01,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:01,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:01,230 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:17:01,537 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:17:01,538 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:17:01,538 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:17:01,538 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:17:01,538 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 07:17:01,538 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:01,539 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:17:01,539 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:17:01,539 INFO L132 ssoRankerPreferences]: Filename of dumped script: string-1.i_Iteration1_Lasso [2025-03-09 07:17:01,539 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:17:01,539 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:17:01,552 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:01,557 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:01,560 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:01,564 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:01,566 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:01,568 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:01,571 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:01,586 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:01,588 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:01,592 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:01,595 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:01,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:01,599 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:01,601 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:01,603 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:01,606 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:01,608 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:01,610 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:01,612 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:01,615 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:01,805 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:02,011 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:17:02,015 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 07:17:02,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:02,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:02,018 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:02,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-03-09 07:17:02,020 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:02,031 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:02,031 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:02,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:02,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:02,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:02,035 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:02,035 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:02,036 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:02,043 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-09 07:17:02,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:02,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:02,045 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:02,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-03-09 07:17:02,048 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:02,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:02,058 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:02,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:02,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:02,058 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:02,058 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:02,058 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:02,060 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:02,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-03-09 07:17:02,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:02,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:02,068 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:02,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-03-09 07:17:02,070 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:02,080 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:02,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:02,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:02,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:02,086 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:02,087 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:02,090 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:02,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-03-09 07:17:02,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:02,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:02,097 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:02,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-03-09 07:17:02,099 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:02,109 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:02,109 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:02,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:02,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:02,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:02,109 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:02,110 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:02,111 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:02,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-03-09 07:17:02,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:02,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:02,118 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:02,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-03-09 07:17:02,120 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:02,130 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:02,130 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:02,130 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:02,130 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:02,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:02,131 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:02,131 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:02,132 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:02,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-03-09 07:17:02,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:02,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:02,139 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:02,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-03-09 07:17:02,141 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:02,151 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:02,151 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:02,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:02,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:02,151 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:02,152 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:02,152 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:02,153 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:02,159 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-09 07:17:02,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:02,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:02,161 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:02,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-03-09 07:17:02,163 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:02,174 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:02,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:02,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:02,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:02,176 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:02,176 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:02,179 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:02,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-03-09 07:17:02,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:02,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:02,187 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:02,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-03-09 07:17:02,189 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:02,199 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:02,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:02,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:02,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:02,204 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:02,204 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:02,211 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:02,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-03-09 07:17:02,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:02,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:02,219 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:02,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-03-09 07:17:02,222 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:02,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:02,232 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:02,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:02,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:02,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:02,233 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:02,233 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:02,236 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:02,242 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-09 07:17:02,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:02,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:02,245 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:02,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-03-09 07:17:02,248 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:02,258 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:02,258 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:02,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:02,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:02,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:02,259 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:02,259 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:02,260 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:02,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-03-09 07:17:02,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:02,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:02,267 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:02,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-03-09 07:17:02,270 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:02,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:02,280 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:02,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:02,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:02,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:02,281 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:02,281 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:02,283 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:02,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-03-09 07:17:02,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:02,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:02,291 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:02,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-03-09 07:17:02,292 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:02,302 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:02,303 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:02,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:02,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:02,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:02,303 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:02,303 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:02,304 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:02,309 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-09 07:17:02,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:02,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:02,311 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:02,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-03-09 07:17:02,313 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:02,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:02,323 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:02,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:02,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:02,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:02,324 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:02,324 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:02,325 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:02,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-03-09 07:17:02,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:02,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:02,333 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:02,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-03-09 07:17:02,335 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:02,345 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:02,345 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:02,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:02,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:02,345 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:02,349 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:02,349 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:02,350 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:02,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-03-09 07:17:02,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:02,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:02,358 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-09 07:17:02,358 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-09 07:17:02,359 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:02,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:02,370 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:02,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:02,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:02,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:02,370 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:02,370 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:02,371 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:02,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-03-09 07:17:02,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:02,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:02,383 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:02,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-03-09 07:17:02,385 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:02,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:02,395 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:02,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:02,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:02,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:02,396 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:02,396 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:02,397 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:02,402 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-09 07:17:02,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:02,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:02,404 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:02,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-03-09 07:17:02,406 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:02,417 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:02,417 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:02,417 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:02,417 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:02,417 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:02,418 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:02,418 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:02,420 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:02,426 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-03-09 07:17:02,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:02,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:02,428 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:02,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-03-09 07:17:02,430 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:02,439 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:02,440 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:02,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:02,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:02,440 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:02,440 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:02,440 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:02,441 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:02,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-03-09 07:17:02,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:02,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:02,448 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:02,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-03-09 07:17:02,450 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:02,460 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:02,460 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:02,460 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:02,460 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:02,460 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:02,460 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:02,460 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:02,461 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:02,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-03-09 07:17:02,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:02,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:02,468 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:02,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-03-09 07:17:02,470 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:02,480 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:02,480 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:02,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:02,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:02,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:02,481 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:02,481 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:02,482 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:02,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-03-09 07:17:02,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:02,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:02,490 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:02,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-03-09 07:17:02,492 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:02,502 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:02,502 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:02,502 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:02,502 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:02,504 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:02,504 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:02,507 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:02,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-03-09 07:17:02,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:02,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:02,515 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:02,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-03-09 07:17:02,518 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:02,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:02,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:02,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:02,528 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:02,531 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:02,532 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:02,537 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 07:17:02,563 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-03-09 07:17:02,565 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-03-09 07:17:02,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:02,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:02,571 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:02,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-03-09 07:17:02,574 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 07:17:02,586 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 07:17:02,587 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 07:17:02,587 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#string_A~0#1.base)_1, ULTIMATE.start_main_~i~0#1) = 9*v_rep(select #length ULTIMATE.start_main_~#string_A~0#1.base)_1 - 2*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2025-03-09 07:17:02,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-03-09 07:17:02,619 INFO L156 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2025-03-09 07:17:02,625 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-09 07:17:02,626 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-09 07:17:02,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:02,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:17:02,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:17:02,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:02,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:17:02,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 07:17:02,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:17:02,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-09 07:17:02,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-09 07:17:02,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:02,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:17:02,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 07:17:02,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:17:02,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:17:02,694 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-03-09 07:17:02,695 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 22 states, 21 states have (on average 1.619047619047619) internal successors, (34), 21 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:17:02,717 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 22 states, 21 states have (on average 1.619047619047619) internal successors, (34), 21 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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 23 states and 36 transitions. Complement of second has 3 states. [2025-03-09 07:17:02,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2025-03-09 07:17:02,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:17:02,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3 transitions. [2025-03-09 07:17:02,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 2 letters. Loop has 1 letters. [2025-03-09 07:17:02,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:17:02,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 3 letters. Loop has 1 letters. [2025-03-09 07:17:02,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:17:02,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 2 letters. Loop has 2 letters. [2025-03-09 07:17:02,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:17:02,727 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 36 transitions. [2025-03-09 07:17:02,728 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 7 [2025-03-09 07:17:02,729 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 15 states and 23 transitions. [2025-03-09 07:17:02,730 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-03-09 07:17:02,731 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2025-03-09 07:17:02,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 23 transitions. [2025-03-09 07:17:02,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:17:02,732 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 23 transitions. [2025-03-09 07:17:02,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 23 transitions. [2025-03-09 07:17:02,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-03-09 07:17:02,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:17:02,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 23 transitions. [2025-03-09 07:17:02,746 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 23 transitions. [2025-03-09 07:17:02,746 INFO L432 stractBuchiCegarLoop]: Abstraction has 15 states and 23 transitions. [2025-03-09 07:17:02,746 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-09 07:17:02,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 23 transitions. [2025-03-09 07:17:02,746 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 7 [2025-03-09 07:17:02,746 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:17:02,746 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:17:02,747 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-03-09 07:17:02,747 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-09 07:17:02,747 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" [2025-03-09 07:17:02,747 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" [2025-03-09 07:17:02,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:02,747 INFO L85 PathProgramCache]: Analyzing trace with hash 2400095, now seen corresponding path program 1 times [2025-03-09 07:17:02,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:02,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087458883] [2025-03-09 07:17:02,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:17:02,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:02,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 07:17:02,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 07:17:02,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:02,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:17:02,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:17:02,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:17:02,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087458883] [2025-03-09 07:17:02,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087458883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:17:02,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:17:02,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 07:17:02,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419546589] [2025-03-09 07:17:02,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:17:02,829 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 07:17:02,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:02,829 INFO L85 PathProgramCache]: Analyzing trace with hash 70, now seen corresponding path program 1 times [2025-03-09 07:17:02,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:02,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860481149] [2025-03-09 07:17:02,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:17:02,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:02,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-09 07:17:02,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-09 07:17:02,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:02,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:02,836 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:17:02,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-09 07:17:02,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-09 07:17:02,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:02,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:02,839 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:17:02,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:17:02,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 07:17:02,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 07:17:02,889 INFO L87 Difference]: Start difference. First operand 15 states and 23 transitions. cyclomatic complexity: 13 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:17:02,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:17:02,909 INFO L93 Difference]: Finished difference Result 18 states and 24 transitions. [2025-03-09 07:17:02,910 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 24 transitions. [2025-03-09 07:17:02,910 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 7 [2025-03-09 07:17:02,912 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 24 transitions. [2025-03-09 07:17:02,912 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2025-03-09 07:17:02,912 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2025-03-09 07:17:02,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 24 transitions. [2025-03-09 07:17:02,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:17:02,913 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 24 transitions. [2025-03-09 07:17:02,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 24 transitions. [2025-03-09 07:17:02,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2025-03-09 07:17:02,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:17:02,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2025-03-09 07:17:02,915 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 21 transitions. [2025-03-09 07:17:02,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 07:17:02,916 INFO L432 stractBuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2025-03-09 07:17:02,917 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-03-09 07:17:02,917 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2025-03-09 07:17:02,917 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 7 [2025-03-09 07:17:02,918 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:17:02,918 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:17:02,919 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-03-09 07:17:02,919 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-09 07:17:02,919 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" [2025-03-09 07:17:02,919 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" [2025-03-09 07:17:02,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:02,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1988443846, now seen corresponding path program 1 times [2025-03-09 07:17:02,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:02,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571360977] [2025-03-09 07:17:02,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:17:02,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:02,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 07:17:02,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 07:17:02,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:02,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:17:02,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:17:02,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:17:02,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571360977] [2025-03-09 07:17:02,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571360977] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 07:17:02,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16646979] [2025-03-09 07:17:02,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:17:02,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 07:17:02,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:02,987 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 07:17:02,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-09 07:17:03,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 07:17:03,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-03-09 07:17:03,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 07:17:03,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:03,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:17:03,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 07:17:03,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:17:03,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:17:03,060 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 07:17:03,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:17:03,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16646979] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 07:17:03,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 07:17:03,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-09 07:17:03,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526938427] [2025-03-09 07:17:03,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 07:17:03,073 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 07:17:03,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:03,074 INFO L85 PathProgramCache]: Analyzing trace with hash 70, now seen corresponding path program 2 times [2025-03-09 07:17:03,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:03,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982625145] [2025-03-09 07:17:03,074 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:17:03,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:03,077 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-03-09 07:17:03,082 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-09 07:17:03,082 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 07:17:03,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:03,082 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:17:03,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-09 07:17:03,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-09 07:17:03,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:03,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:03,087 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:17:03,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:17:03,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 07:17:03,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 07:17:03,119 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. cyclomatic complexity: 10 Second operand has 7 states, 7 states have (on average 1.5714285714285714) 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-09 07:17:03,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:17:03,175 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2025-03-09 07:17:03,175 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 39 transitions. [2025-03-09 07:17:03,176 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 7 [2025-03-09 07:17:03,176 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 39 transitions. [2025-03-09 07:17:03,176 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2025-03-09 07:17:03,176 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2025-03-09 07:17:03,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 39 transitions. [2025-03-09 07:17:03,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:17:03,176 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 39 transitions. [2025-03-09 07:17:03,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 39 transitions. [2025-03-09 07:17:03,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 22. [2025-03-09 07:17:03,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:17:03,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2025-03-09 07:17:03,177 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 27 transitions. [2025-03-09 07:17:03,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 07:17:03,180 INFO L432 stractBuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2025-03-09 07:17:03,180 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-03-09 07:17:03,180 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2025-03-09 07:17:03,180 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 7 [2025-03-09 07:17:03,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:17:03,180 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:17:03,180 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1] [2025-03-09 07:17:03,180 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-09 07:17:03,182 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" [2025-03-09 07:17:03,182 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" [2025-03-09 07:17:03,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:03,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1167440609, now seen corresponding path program 2 times [2025-03-09 07:17:03,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:03,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484778562] [2025-03-09 07:17:03,182 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:17:03,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:03,192 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-09 07:17:03,217 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 07:17:03,217 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 07:17:03,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:17:03,302 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 07:17:03,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:17:03,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484778562] [2025-03-09 07:17:03,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484778562] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 07:17:03,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57080871] [2025-03-09 07:17:03,302 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:17:03,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 07:17:03,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:03,305 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 07:17:03,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-09 07:17:03,343 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 2 equivalence classes. [2025-03-09 07:17:03,358 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 07:17:03,358 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 07:17:03,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:17:03,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 07:17:03,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:17:03,376 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 07:17:03,376 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 07:17:03,400 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 07:17:03,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57080871] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 07:17:03,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 07:17:03,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2025-03-09 07:17:03,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295962738] [2025-03-09 07:17:03,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 07:17:03,401 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 07:17:03,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:03,401 INFO L85 PathProgramCache]: Analyzing trace with hash 70, now seen corresponding path program 3 times [2025-03-09 07:17:03,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:03,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109005291] [2025-03-09 07:17:03,401 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 07:17:03,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:03,404 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1 statements into 1 equivalence classes. [2025-03-09 07:17:03,406 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-09 07:17:03,406 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 07:17:03,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:03,406 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:17:03,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-09 07:17:03,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-09 07:17:03,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:03,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:03,409 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:17:03,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:17:03,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 07:17:03,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-09 07:17:03,450 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 10 Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 8 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-09 07:17:03,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:17:03,501 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2025-03-09 07:17:03,501 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 44 transitions. [2025-03-09 07:17:03,501 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 7 [2025-03-09 07:17:03,502 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 44 transitions. [2025-03-09 07:17:03,502 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2025-03-09 07:17:03,502 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2025-03-09 07:17:03,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 44 transitions. [2025-03-09 07:17:03,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:17:03,502 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 44 transitions. [2025-03-09 07:17:03,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 44 transitions. [2025-03-09 07:17:03,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 24. [2025-03-09 07:17:03,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:17:03,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2025-03-09 07:17:03,506 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 29 transitions. [2025-03-09 07:17:03,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 07:17:03,507 INFO L432 stractBuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2025-03-09 07:17:03,508 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-03-09 07:17:03,508 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 29 transitions. [2025-03-09 07:17:03,508 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 7 [2025-03-09 07:17:03,508 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:17:03,508 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:17:03,509 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1] [2025-03-09 07:17:03,511 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-03-09 07:17:03,511 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" [2025-03-09 07:17:03,511 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" [2025-03-09 07:17:03,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:03,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1849500026, now seen corresponding path program 3 times [2025-03-09 07:17:03,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:03,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876806395] [2025-03-09 07:17:03,512 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 07:17:03,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:03,520 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 4 equivalence classes. [2025-03-09 07:17:03,549 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 07:17:03,552 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-09 07:17:03,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:03,553 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:17:03,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 07:17:03,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 07:17:03,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:03,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:03,567 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:17:03,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:03,568 INFO L85 PathProgramCache]: Analyzing trace with hash 70, now seen corresponding path program 4 times [2025-03-09 07:17:03,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:03,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408213174] [2025-03-09 07:17:03,568 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 07:17:03,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:03,573 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1 statements into 2 equivalence classes. [2025-03-09 07:17:03,574 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 1 of 1 statements. [2025-03-09 07:17:03,575 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 07:17:03,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:03,575 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:17:03,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-03-09 07:17:03,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-03-09 07:17:03,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:03,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:03,577 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:17:03,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:03,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1499925997, now seen corresponding path program 4 times [2025-03-09 07:17:03,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:03,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303818340] [2025-03-09 07:17:03,577 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 07:17:03,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:03,587 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-03-09 07:17:03,598 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 14 of 15 statements. [2025-03-09 07:17:03,598 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 07:17:03,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:17:03,701 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 07:17:03,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:17:03,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303818340] [2025-03-09 07:17:03,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303818340] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 07:17:03,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372238503] [2025-03-09 07:17:03,702 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 07:17:03,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 07:17:03,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:03,704 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 07:17:03,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-03-09 07:17:03,748 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-03-09 07:17:03,764 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 14 of 15 statements. [2025-03-09 07:17:03,764 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 07:17:03,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:17:03,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 07:17:03,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:17:03,802 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-09 07:17:03,803 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 07:17:03,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372238503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:17:03,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 07:17:03,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2025-03-09 07:17:03,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972763345] [2025-03-09 07:17:03,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:17:03,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:17:03,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 07:17:03,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2025-03-09 07:17:03,834 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. cyclomatic complexity: 10 Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 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-09 07:17:03,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:17:03,891 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2025-03-09 07:17:03,891 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 45 transitions. [2025-03-09 07:17:03,892 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2025-03-09 07:17:03,892 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 45 transitions. [2025-03-09 07:17:03,892 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2025-03-09 07:17:03,892 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2025-03-09 07:17:03,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 45 transitions. [2025-03-09 07:17:03,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:17:03,892 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 45 transitions. [2025-03-09 07:17:03,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 45 transitions. [2025-03-09 07:17:03,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 24. [2025-03-09 07:17:03,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:17:03,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2025-03-09 07:17:03,894 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 27 transitions. [2025-03-09 07:17:03,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 07:17:03,897 INFO L432 stractBuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2025-03-09 07:17:03,897 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-03-09 07:17:03,897 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 27 transitions. [2025-03-09 07:17:03,897 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2025-03-09 07:17:03,897 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:17:03,897 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:17:03,897 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1] [2025-03-09 07:17:03,897 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 07:17:03,897 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1);" "assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0;" [2025-03-09 07:17:03,897 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" [2025-03-09 07:17:03,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:03,898 INFO L85 PathProgramCache]: Analyzing trace with hash -746934343, now seen corresponding path program 1 times [2025-03-09 07:17:03,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:03,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900945742] [2025-03-09 07:17:03,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:17:03,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:03,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 07:17:03,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 07:17:03,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:03,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:03,920 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:17:03,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 07:17:03,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 07:17:03,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:03,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:03,944 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:17:03,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:03,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1952, now seen corresponding path program 1 times [2025-03-09 07:17:03,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:03,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912736095] [2025-03-09 07:17:03,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:17:03,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:03,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:17:03,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:17:03,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:03,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:03,948 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:17:03,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:17:03,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:17:03,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:03,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:03,952 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:17:03,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:03,952 INFO L85 PathProgramCache]: Analyzing trace with hash -544364200, now seen corresponding path program 1 times [2025-03-09 07:17:03,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:03,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815740592] [2025-03-09 07:17:03,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:17:03,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:03,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 07:17:03,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 07:17:03,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:03,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:03,971 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:17:03,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-09 07:17:03,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-09 07:17:03,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:03,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:03,989 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:17:06,672 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:17:06,672 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:17:06,672 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:17:06,672 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:17:06,673 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 07:17:06,673 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:06,673 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:17:06,673 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:17:06,673 INFO L132 ssoRankerPreferences]: Filename of dumped script: string-1.i_Iteration6_Lasso [2025-03-09 07:17:06,673 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:17:06,673 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:17:06,677 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:06,680 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:06,681 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:06,684 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:06,918 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:06,919 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:06,921 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:06,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:06,924 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:06,926 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:06,934 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:06,935 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:06,938 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:06,939 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:06,940 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:06,943 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:06,945 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:06,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:06,948 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:06,950 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:06,951 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:07,136 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:17:07,136 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 07:17:07,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:07,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:07,139 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:07,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-03-09 07:17:07,142 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:07,152 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:07,152 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:07,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:07,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:07,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:07,153 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:07,153 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:07,154 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:07,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2025-03-09 07:17:07,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:07,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:07,161 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:07,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-03-09 07:17:07,162 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:07,173 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:07,173 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:07,173 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:07,173 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:07,173 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:07,173 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:07,174 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:07,174 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:07,180 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-09 07:17:07,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:07,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:07,182 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:07,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-03-09 07:17:07,184 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:07,193 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:07,193 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:07,193 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:07,193 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:07,193 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:07,193 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:07,193 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:07,194 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:07,200 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-03-09 07:17:07,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:07,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:07,202 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:07,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-03-09 07:17:07,207 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:07,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:07,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:07,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:07,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:07,218 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:07,218 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:07,221 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:07,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-03-09 07:17:07,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:07,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:07,229 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:07,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-03-09 07:17:07,232 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:07,242 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:07,242 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:07,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:07,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:07,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:07,243 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:07,243 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:07,244 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:07,250 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-09 07:17:07,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:07,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:07,252 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:07,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-03-09 07:17:07,253 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:07,263 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:07,263 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:07,263 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:07,263 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:07,266 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:07,267 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:07,270 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:07,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-03-09 07:17:07,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:07,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:07,278 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:07,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-03-09 07:17:07,281 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:07,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:07,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:07,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:07,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:07,296 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:07,296 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:07,299 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:07,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2025-03-09 07:17:07,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:07,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:07,307 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:07,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-03-09 07:17:07,310 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:07,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:07,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:07,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:07,320 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:07,321 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:07,321 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:07,324 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:07,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2025-03-09 07:17:07,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:07,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:07,333 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:07,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-03-09 07:17:07,335 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:07,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:07,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:07,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:07,345 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:07,347 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:07,347 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:07,350 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:07,355 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-09 07:17:07,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:07,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:07,358 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:07,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-03-09 07:17:07,360 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:07,370 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:07,371 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:07,371 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:07,371 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:07,372 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:07,372 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:07,376 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:07,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2025-03-09 07:17:07,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:07,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:07,383 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:07,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-03-09 07:17:07,385 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:07,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:07,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:07,395 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-09 07:17:07,398 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:07,402 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-03-09 07:17:07,402 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-03-09 07:17:07,409 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:07,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-03-09 07:17:07,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:07,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:07,417 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:07,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2025-03-09 07:17:07,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-09 07:17:07,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:07,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:07,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:07,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:07,432 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:07,432 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:07,434 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:07,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2025-03-09 07:17:07,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:07,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:07,443 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:07,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2025-03-09 07:17:07,444 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:07,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:07,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:07,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:07,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:07,456 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:07,456 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:07,461 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 07:17:07,473 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2025-03-09 07:17:07,473 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-03-09 07:17:07,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:07,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:07,475 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:07,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2025-03-09 07:17:07,477 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 07:17:07,488 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-03-09 07:17:07,488 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 07:17:07,488 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#string_A~0#1.base)_2, ULTIMATE.start_main_~nc_A~0#1) = 1*v_rep(select #length ULTIMATE.start_main_~#string_A~0#1.base)_2 - 1*ULTIMATE.start_main_~nc_A~0#1 Supporting invariants [1*ULTIMATE.start_main_~#string_A~0#1.offset >= 0] [2025-03-09 07:17:07,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2025-03-09 07:17:07,513 INFO L156 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2025-03-09 07:17:07,515 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-09 07:17:07,515 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-09 07:17:07,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:07,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 07:17:07,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 07:17:07,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:07,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:17:07,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 07:17:07,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:17:07,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:17:07,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:17:07,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:07,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:17:07,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 07:17:07,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:17:07,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:17:07,675 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2025-03-09 07:17:07,675 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 27 transitions. cyclomatic complexity: 6 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:17:07,710 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 27 transitions. cyclomatic complexity: 6. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 32 states and 39 transitions. Complement of second has 5 states. [2025-03-09 07:17:07,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-09 07:17:07,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:17:07,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2025-03-09 07:17:07,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 16 letters. Loop has 2 letters. [2025-03-09 07:17:07,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:17:07,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 18 letters. Loop has 2 letters. [2025-03-09 07:17:07,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:17:07,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 16 letters. Loop has 4 letters. [2025-03-09 07:17:07,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:17:07,712 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 39 transitions. [2025-03-09 07:17:07,713 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-09 07:17:07,713 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 26 states and 30 transitions. [2025-03-09 07:17:07,713 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2025-03-09 07:17:07,713 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2025-03-09 07:17:07,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 30 transitions. [2025-03-09 07:17:07,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:17:07,713 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 30 transitions. [2025-03-09 07:17:07,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 30 transitions. [2025-03-09 07:17:07,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-03-09 07:17:07,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:17:07,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2025-03-09 07:17:07,715 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 30 transitions. [2025-03-09 07:17:07,715 INFO L432 stractBuchiCegarLoop]: Abstraction has 26 states and 30 transitions. [2025-03-09 07:17:07,715 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-03-09 07:17:07,715 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 30 transitions. [2025-03-09 07:17:07,715 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-09 07:17:07,715 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:17:07,715 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:17:07,717 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:17:07,717 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 07:17:07,717 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1);" "assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1;" "main_~nc_B~0#1 := 0;" [2025-03-09 07:17:07,718 INFO L754 eck$LassoCheckResult]: Loop: "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" [2025-03-09 07:17:07,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:07,718 INFO L85 PathProgramCache]: Analyzing trace with hash 304578979, now seen corresponding path program 1 times [2025-03-09 07:17:07,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:07,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568105682] [2025-03-09 07:17:07,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:17:07,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:07,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 07:17:07,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 07:17:07,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:07,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:07,743 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:17:07,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 07:17:07,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 07:17:07,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:07,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:07,761 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:17:07,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:07,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1728, now seen corresponding path program 1 times [2025-03-09 07:17:07,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:07,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710331612] [2025-03-09 07:17:07,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:17:07,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:07,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:17:07,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:17:07,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:07,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:07,769 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:17:07,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:17:07,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:17:07,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:07,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:07,772 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:17:07,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:07,773 INFO L85 PathProgramCache]: Analyzing trace with hash 642623458, now seen corresponding path program 1 times [2025-03-09 07:17:07,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:07,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427522067] [2025-03-09 07:17:07,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:17:07,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:07,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 07:17:07,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 07:17:07,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:07,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:07,792 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:17:07,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 07:17:07,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 07:17:07,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:07,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:07,810 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:17:08,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2025-03-09 07:17:10,947 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:17:10,947 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:17:10,948 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:17:10,948 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:17:10,948 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 07:17:10,948 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:10,948 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:17:10,948 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:17:10,948 INFO L132 ssoRankerPreferences]: Filename of dumped script: string-1.i_Iteration7_Lasso [2025-03-09 07:17:10,948 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:17:10,948 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:17:10,950 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:10,955 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:10,958 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:10,959 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:10,961 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:10,962 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:10,963 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:10,972 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:10,974 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:10,975 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:11,175 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:11,176 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:11,177 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:11,178 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:11,179 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:11,183 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:11,184 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:11,185 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:11,187 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:11,188 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:11,343 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:17:11,343 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 07:17:11,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:11,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:11,347 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:11,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2025-03-09 07:17:11,349 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:11,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:11,359 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:11,360 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:11,360 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:11,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:11,360 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:11,360 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:11,361 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:11,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2025-03-09 07:17:11,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:11,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:11,368 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:11,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2025-03-09 07:17:11,370 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:11,381 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:11,381 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:11,381 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:11,381 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:11,381 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:11,381 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:11,381 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:11,382 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:11,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2025-03-09 07:17:11,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:11,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:11,389 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:11,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2025-03-09 07:17:11,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-09 07:17:11,401 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:11,401 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:11,401 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:11,401 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:11,401 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:11,401 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:11,401 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:11,402 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:11,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2025-03-09 07:17:11,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:11,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:11,409 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:11,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2025-03-09 07:17:11,411 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:11,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:11,421 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:11,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:11,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:11,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:11,421 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:11,421 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:11,422 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:11,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2025-03-09 07:17:11,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:11,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:11,429 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:11,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2025-03-09 07:17:11,430 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:11,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:11,440 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:11,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:11,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:11,440 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:11,441 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:11,441 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:11,442 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:11,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2025-03-09 07:17:11,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:11,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:11,449 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:11,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2025-03-09 07:17:11,451 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:11,460 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:11,460 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:11,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:11,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:11,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:11,461 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:11,461 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:11,462 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:11,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2025-03-09 07:17:11,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:11,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:11,469 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:11,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2025-03-09 07:17:11,471 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:11,480 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:11,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:11,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:11,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:11,481 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:11,481 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:11,483 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:11,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2025-03-09 07:17:11,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:11,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:11,490 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:11,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2025-03-09 07:17:11,492 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:11,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:11,502 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:11,502 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:11,502 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:11,502 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:11,502 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:11,505 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:11,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2025-03-09 07:17:11,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:11,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:11,512 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:11,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2025-03-09 07:17:11,515 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:11,524 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:11,524 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:11,524 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:11,524 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:11,524 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:11,525 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:11,525 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:11,526 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:11,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2025-03-09 07:17:11,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:11,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:11,533 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:11,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2025-03-09 07:17:11,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-09 07:17:11,545 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:11,545 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:11,545 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:11,545 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:11,545 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:11,545 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:11,545 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:11,546 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:11,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2025-03-09 07:17:11,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:11,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:11,553 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:11,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2025-03-09 07:17:11,555 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:11,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:11,564 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:11,564 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:11,564 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:11,565 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:11,565 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:11,568 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:11,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2025-03-09 07:17:11,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:11,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:11,575 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:11,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2025-03-09 07:17:11,577 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:11,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:11,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:11,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:11,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:11,588 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:11,588 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:11,591 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:11,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2025-03-09 07:17:11,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:11,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:11,598 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:11,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2025-03-09 07:17:11,600 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:11,609 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:11,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:11,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:11,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:11,610 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:11,610 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:11,612 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:11,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2025-03-09 07:17:11,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:11,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:11,620 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:11,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2025-03-09 07:17:11,623 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:11,633 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:11,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:11,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:11,634 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:11,635 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:11,635 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:11,638 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:11,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2025-03-09 07:17:11,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:11,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:11,645 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:11,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2025-03-09 07:17:11,647 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:11,656 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:11,656 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:11,656 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:11,656 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:11,657 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:11,657 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:11,660 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:11,666 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2025-03-09 07:17:11,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:11,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:11,667 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:11,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2025-03-09 07:17:11,669 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:11,678 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:11,679 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:11,679 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:11,679 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-09 07:17:11,679 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:11,679 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2025-03-09 07:17:11,679 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:11,680 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:11,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2025-03-09 07:17:11,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:11,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:11,687 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:11,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2025-03-09 07:17:11,689 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:11,698 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:11,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:11,699 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:11,699 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:11,699 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:11,699 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:11,701 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:11,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2025-03-09 07:17:11,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:11,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:11,709 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:11,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2025-03-09 07:17:11,711 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:11,721 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:11,721 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:11,721 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:11,721 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:11,722 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:11,722 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:11,724 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:11,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2025-03-09 07:17:11,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:11,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:11,732 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:11,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2025-03-09 07:17:11,733 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:11,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:11,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:11,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:11,743 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:11,744 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:11,744 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:11,746 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:11,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2025-03-09 07:17:11,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:11,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:11,754 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:11,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2025-03-09 07:17:11,756 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:11,766 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:11,766 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:11,766 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:11,766 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:11,767 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:11,767 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:11,769 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:11,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2025-03-09 07:17:11,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:11,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:11,777 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:11,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2025-03-09 07:17:11,780 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:11,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:11,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:11,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:11,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:11,791 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:11,791 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:11,793 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:11,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2025-03-09 07:17:11,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:11,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:11,802 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:11,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2025-03-09 07:17:11,805 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:11,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:11,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:11,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:11,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:11,817 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:11,817 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:11,820 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:11,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2025-03-09 07:17:11,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:11,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:11,841 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:11,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2025-03-09 07:17:11,844 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:11,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:11,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:11,854 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:11,854 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:11,856 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:11,856 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:11,859 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:11,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2025-03-09 07:17:11,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:11,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:11,867 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:11,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2025-03-09 07:17:11,869 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:11,879 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:11,879 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:11,879 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:11,879 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:11,880 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:11,880 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:11,882 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:11,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2025-03-09 07:17:11,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:11,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:11,890 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:11,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2025-03-09 07:17:11,892 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:11,901 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:11,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:11,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:11,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:11,904 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:11,904 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:11,909 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 07:17:11,916 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-03-09 07:17:11,916 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-03-09 07:17:11,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:11,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:11,918 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:11,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2025-03-09 07:17:11,920 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 07:17:11,930 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 07:17:11,931 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 07:17:11,931 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#string_B~0#1.base)_3, ULTIMATE.start_main_~nc_B~0#1, ULTIMATE.start_main_~#string_B~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_~#string_B~0#1.base)_3 - 1*ULTIMATE.start_main_~nc_B~0#1 - 1*ULTIMATE.start_main_~#string_B~0#1.offset Supporting invariants [] [2025-03-09 07:17:11,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2025-03-09 07:17:11,951 INFO L156 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2025-03-09 07:17:11,953 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-09 07:17:11,953 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-09 07:17:11,953 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#string_B~0!offset [2025-03-09 07:17:11,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:11,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 07:17:11,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 07:17:11,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:11,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:17:11,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 07:17:11,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:17:12,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:17:12,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:17:12,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:12,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:17:12,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 07:17:12,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:17:12,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:17:12,018 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-09 07:17:12,018 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 30 transitions. cyclomatic complexity: 7 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:17:12,031 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 30 transitions. cyclomatic complexity: 7. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 31 states and 38 transitions. Complement of second has 4 states. [2025-03-09 07:17:12,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-09 07:17:12,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:17:12,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2025-03-09 07:17:12,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 19 letters. Loop has 2 letters. [2025-03-09 07:17:12,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:17:12,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 21 letters. Loop has 2 letters. [2025-03-09 07:17:12,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:17:12,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 19 letters. Loop has 4 letters. [2025-03-09 07:17:12,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:17:12,032 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 38 transitions. [2025-03-09 07:17:12,033 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 07:17:12,033 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 28 states and 33 transitions. [2025-03-09 07:17:12,033 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2025-03-09 07:17:12,033 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2025-03-09 07:17:12,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 33 transitions. [2025-03-09 07:17:12,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:17:12,033 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 33 transitions. [2025-03-09 07:17:12,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 33 transitions. [2025-03-09 07:17:12,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-09 07:17:12,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 27 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:17:12,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2025-03-09 07:17:12,034 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 33 transitions. [2025-03-09 07:17:12,034 INFO L432 stractBuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2025-03-09 07:17:12,034 INFO L338 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-03-09 07:17:12,034 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 33 transitions. [2025-03-09 07:17:12,034 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 07:17:12,034 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:17:12,034 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:17:12,035 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:17:12,035 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 07:17:12,035 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1);" "assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1;" "main_~nc_B~0#1 := 0;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1;" "assume !!(main_~nc_B~0#1 >= main_~nc_A~0#1);main_~j~0#1 := 0;main_~i~0#1 := main_~j~0#1;" [2025-03-09 07:17:12,035 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume main_#t~mem11#1 == main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;main_#t~post14#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" [2025-03-09 07:17:12,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:12,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1553509294, now seen corresponding path program 1 times [2025-03-09 07:17:12,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:12,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829528142] [2025-03-09 07:17:12,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:17:12,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:12,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 07:17:12,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 07:17:12,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:12,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:12,054 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:17:12,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 07:17:12,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 07:17:12,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:12,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:12,066 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:17:12,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:12,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1407, now seen corresponding path program 1 times [2025-03-09 07:17:12,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:12,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399393467] [2025-03-09 07:17:12,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:17:12,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:12,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:17:12,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:17:12,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:12,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:12,072 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:17:12,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:17:12,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:17:12,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:12,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:12,075 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:17:12,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:12,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1726187920, now seen corresponding path program 1 times [2025-03-09 07:17:12,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:12,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346874076] [2025-03-09 07:17:12,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:17:12,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:12,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 07:17:12,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 07:17:12,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:12,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:17:12,157 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-09 07:17:12,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:17:12,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346874076] [2025-03-09 07:17:12,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346874076] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:17:12,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 07:17:12,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 07:17:12,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820207181] [2025-03-09 07:17:12,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:17:12,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:17:12,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 07:17:12,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 07:17:12,219 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:17:12,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:17:12,229 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2025-03-09 07:17:12,229 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 43 transitions. [2025-03-09 07:17:12,230 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 07:17:12,230 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 29 states and 33 transitions. [2025-03-09 07:17:12,230 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2025-03-09 07:17:12,230 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2025-03-09 07:17:12,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 33 transitions. [2025-03-09 07:17:12,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:17:12,230 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 33 transitions. [2025-03-09 07:17:12,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 33 transitions. [2025-03-09 07:17:12,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2025-03-09 07:17:12,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:17:12,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2025-03-09 07:17:12,231 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 32 transitions. [2025-03-09 07:17:12,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 07:17:12,232 INFO L432 stractBuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2025-03-09 07:17:12,232 INFO L338 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-03-09 07:17:12,232 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 32 transitions. [2025-03-09 07:17:12,232 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 07:17:12,233 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:17:12,233 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:17:12,233 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:17:12,233 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 07:17:12,233 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1);" "assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1;" "main_~nc_B~0#1 := 0;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1;" "assume !!(main_~nc_B~0#1 >= main_~nc_A~0#1);main_~j~0#1 := 0;main_~i~0#1 := main_~j~0#1;" [2025-03-09 07:17:12,233 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume main_#t~mem11#1 == main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;main_#t~post14#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" [2025-03-09 07:17:12,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:12,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1533388111, now seen corresponding path program 1 times [2025-03-09 07:17:12,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:12,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965285803] [2025-03-09 07:17:12,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:17:12,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:12,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 07:17:12,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 07:17:12,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:12,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:17:12,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2025-03-09 07:17:12,313 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-09 07:17:12,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:17:12,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965285803] [2025-03-09 07:17:12,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965285803] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 07:17:12,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585247454] [2025-03-09 07:17:12,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:17:12,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 07:17:12,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:12,316 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 07:17:12,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2025-03-09 07:17:12,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 07:17:12,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 07:17:12,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:12,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:17:12,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 07:17:12,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:17:12,404 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-09 07:17:12,404 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 07:17:12,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585247454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:17:12,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 07:17:12,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-09 07:17:12,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184772477] [2025-03-09 07:17:12,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:17:12,408 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 07:17:12,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:12,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1407, now seen corresponding path program 2 times [2025-03-09 07:17:12,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:12,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604642208] [2025-03-09 07:17:12,408 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:17:12,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:12,410 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:17:12,411 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:17:12,411 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 07:17:12,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:12,411 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:17:12,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:17:12,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:17:12,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:12,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:12,420 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:17:12,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:17:12,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 07:17:12,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-09 07:17:12,481 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. cyclomatic complexity: 7 Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:17:12,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:17:12,499 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2025-03-09 07:17:12,499 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 35 transitions. [2025-03-09 07:17:12,499 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 07:17:12,500 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 30 states and 33 transitions. [2025-03-09 07:17:12,500 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2025-03-09 07:17:12,500 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2025-03-09 07:17:12,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 33 transitions. [2025-03-09 07:17:12,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:17:12,500 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 33 transitions. [2025-03-09 07:17:12,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 33 transitions. [2025-03-09 07:17:12,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2025-03-09 07:17:12,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:17:12,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2025-03-09 07:17:12,501 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 31 transitions. [2025-03-09 07:17:12,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 07:17:12,503 INFO L432 stractBuchiCegarLoop]: Abstraction has 28 states and 31 transitions. [2025-03-09 07:17:12,503 INFO L338 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-03-09 07:17:12,503 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 31 transitions. [2025-03-09 07:17:12,503 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 07:17:12,503 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:17:12,503 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:17:12,503 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:17:12,503 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 07:17:12,504 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1);" "assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1;" "main_~nc_B~0#1 := 0;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1;" "assume !!(main_~nc_B~0#1 >= main_~nc_A~0#1);main_~j~0#1 := 0;main_~i~0#1 := main_~j~0#1;" [2025-03-09 07:17:12,504 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume main_#t~mem11#1 == main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;main_#t~post14#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" [2025-03-09 07:17:12,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:12,504 INFO L85 PathProgramCache]: Analyzing trace with hash -412156846, now seen corresponding path program 1 times [2025-03-09 07:17:12,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:12,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209054996] [2025-03-09 07:17:12,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:17:12,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:12,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 07:17:12,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 07:17:12,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:12,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:12,520 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:17:12,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 07:17:12,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 07:17:12,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:12,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:12,541 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:17:12,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:12,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1407, now seen corresponding path program 3 times [2025-03-09 07:17:12,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:12,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852165855] [2025-03-09 07:17:12,542 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 07:17:12,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:12,544 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:17:12,544 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:17:12,544 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 07:17:12,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:12,544 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:17:12,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:17:12,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:17:12,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:12,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:12,548 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:17:12,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:12,548 INFO L85 PathProgramCache]: Analyzing trace with hash -945737328, now seen corresponding path program 1 times [2025-03-09 07:17:12,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:12,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488957145] [2025-03-09 07:17:12,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:17:12,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:12,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 07:17:12,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 07:17:12,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:12,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:12,572 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:17:12,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 07:17:12,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 07:17:12,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:12,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:12,589 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:17:15,450 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:17:15,450 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:17:15,450 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:17:15,450 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:17:15,450 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 07:17:15,450 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:15,450 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:17:15,450 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:17:15,450 INFO L132 ssoRankerPreferences]: Filename of dumped script: string-1.i_Iteration10_Lasso [2025-03-09 07:17:15,450 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:17:15,450 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:17:15,451 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:15,455 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:15,458 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:15,459 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:15,461 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:15,462 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:15,468 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:15,470 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:15,471 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:15,479 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:15,480 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:15,481 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:15,483 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:15,484 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:15,810 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:15,811 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:15,813 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:16,060 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:17:16,060 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 07:17:16,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:16,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:16,062 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:16,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2025-03-09 07:17:16,063 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:16,073 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:16,073 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:16,073 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:16,073 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:16,073 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:16,073 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:16,073 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:16,074 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:16,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2025-03-09 07:17:16,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:16,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:16,082 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:16,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2025-03-09 07:17:16,084 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:16,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:16,093 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:16,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:16,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:16,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:16,094 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:16,094 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:16,095 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:16,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2025-03-09 07:17:16,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:16,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:16,103 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:16,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2025-03-09 07:17:16,106 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:16,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:16,116 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:16,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:16,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:16,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:16,116 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:16,116 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:16,118 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:16,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2025-03-09 07:17:16,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:16,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:16,127 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:16,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2025-03-09 07:17:16,130 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:16,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:16,141 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:16,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:16,141 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:16,141 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:16,141 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:16,141 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:16,142 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:16,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2025-03-09 07:17:16,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:16,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:16,150 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:16,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2025-03-09 07:17:16,152 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:16,162 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:16,162 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:16,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:16,162 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:16,162 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:16,162 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:16,163 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:16,164 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:16,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2025-03-09 07:17:16,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:16,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:16,171 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:16,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2025-03-09 07:17:16,173 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:16,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:16,183 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:16,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:16,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:16,183 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:16,183 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:16,183 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:16,184 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:16,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2025-03-09 07:17:16,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:16,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:16,192 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:16,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2025-03-09 07:17:16,194 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:16,203 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:16,203 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:16,203 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:16,203 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:16,203 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:16,203 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:16,203 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:16,204 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:16,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2025-03-09 07:17:16,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:16,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:16,211 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:16,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2025-03-09 07:17:16,213 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:16,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:16,222 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:16,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:16,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:16,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:16,223 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:16,223 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:16,224 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:16,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2025-03-09 07:17:16,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:16,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:16,232 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:16,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2025-03-09 07:17:16,234 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:16,243 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:16,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:16,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:16,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:16,244 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:16,244 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:16,247 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:16,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2025-03-09 07:17:16,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:16,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:16,254 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:16,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2025-03-09 07:17:16,255 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:16,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:16,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:16,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:16,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:16,266 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:16,266 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:16,268 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:16,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2025-03-09 07:17:16,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:16,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:16,275 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:16,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2025-03-09 07:17:16,276 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:16,286 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:16,286 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:16,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:16,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:16,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:16,286 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:16,286 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:16,287 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:16,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2025-03-09 07:17:16,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:16,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:16,294 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:16,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2025-03-09 07:17:16,296 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:16,305 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:16,305 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:16,305 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:16,305 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:16,305 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:16,305 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:16,306 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:16,306 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:16,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2025-03-09 07:17:16,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:16,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:16,314 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:16,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2025-03-09 07:17:16,315 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:16,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:16,325 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:16,325 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:16,325 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:16,325 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:16,325 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:16,325 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:16,326 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:16,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2025-03-09 07:17:16,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:16,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:16,334 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:16,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2025-03-09 07:17:16,335 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:16,345 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:16,345 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:16,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:16,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:16,345 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:16,348 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:16,349 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:16,350 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:16,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2025-03-09 07:17:16,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:16,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:16,357 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:16,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2025-03-09 07:17:16,358 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:16,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:16,368 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:16,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:16,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:16,369 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:16,369 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:16,371 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:16,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2025-03-09 07:17:16,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:16,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:16,378 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:16,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2025-03-09 07:17:16,380 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:16,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:16,391 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2025-03-09 07:17:16,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:16,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:16,393 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2025-03-09 07:17:16,393 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:16,399 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:16,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2025-03-09 07:17:16,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:16,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:16,407 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:16,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2025-03-09 07:17:16,409 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:16,418 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:16,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:16,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:16,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:16,419 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:16,419 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:16,421 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:16,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2025-03-09 07:17:16,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:16,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:16,429 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:16,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2025-03-09 07:17:16,431 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:16,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:16,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:16,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:16,440 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:16,441 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:16,441 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:16,443 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:16,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2025-03-09 07:17:16,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:16,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:16,450 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:16,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2025-03-09 07:17:16,452 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:16,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:16,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:16,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:16,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:16,462 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:16,462 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:16,464 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:16,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2025-03-09 07:17:16,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:16,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:16,472 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:16,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2025-03-09 07:17:16,475 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:16,484 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:16,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:16,484 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:16,484 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:16,485 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:16,485 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:16,487 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:16,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2025-03-09 07:17:16,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:16,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:16,494 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:16,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2025-03-09 07:17:16,496 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:16,505 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:16,505 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:16,505 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:16,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:16,506 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:16,506 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:16,509 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:16,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Forceful destruction successful, exit code 0 [2025-03-09 07:17:16,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:16,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:16,516 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:16,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2025-03-09 07:17:16,518 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:16,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:16,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:16,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:16,528 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:16,531 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:16,531 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:16,534 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:16,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2025-03-09 07:17:16,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:16,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:16,543 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:16,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2025-03-09 07:17:16,545 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:16,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:16,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:16,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:16,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:16,556 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:16,556 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:16,559 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:16,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Forceful destruction successful, exit code 0 [2025-03-09 07:17:16,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:16,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:16,569 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:16,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2025-03-09 07:17:16,574 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:16,584 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:16,584 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:16,584 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:16,584 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:16,586 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:16,586 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:16,588 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:16,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0 [2025-03-09 07:17:16,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:16,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:16,597 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:16,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2025-03-09 07:17:16,605 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:16,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:16,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:16,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:16,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:16,616 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:16,616 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:16,619 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:16,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Forceful destruction successful, exit code 0 [2025-03-09 07:17:16,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:16,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:16,626 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:16,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2025-03-09 07:17:16,629 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:16,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:16,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:16,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:16,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:16,640 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:16,640 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:16,642 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:16,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Forceful destruction successful, exit code 0 [2025-03-09 07:17:16,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:16,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:16,651 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:16,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2025-03-09 07:17:16,653 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:16,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:16,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:16,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:16,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:16,664 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:16,664 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:16,669 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 07:17:16,685 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2025-03-09 07:17:16,686 INFO L444 ModelExtractionUtils]: 1 out of 16 variables were initially zero. Simplification set additionally 12 variables to zero. [2025-03-09 07:17:16,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:16,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:16,688 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:16,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2025-03-09 07:17:16,689 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 07:17:16,699 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 07:17:16,699 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 07:17:16,699 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1, ULTIMATE.start_main_~nc_B~0#1) = -1*ULTIMATE.start_main_~j~0#1 + 1*ULTIMATE.start_main_~nc_B~0#1 Supporting invariants [] [2025-03-09 07:17:16,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Ended with exit code 0 [2025-03-09 07:17:16,734 INFO L156 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2025-03-09 07:17:16,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:16,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 07:17:16,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Ended with exit code 0 [2025-03-09 07:17:16,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 07:17:16,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:16,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:17:16,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 07:17:16,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:17:16,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:17:16,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:17:16,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:16,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:17:16,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 07:17:16,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:17:16,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:17:16,851 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-09 07:17:16,851 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 31 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:17:16,863 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 31 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 32 states and 37 transitions. Complement of second has 5 states. [2025-03-09 07:17:16,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-09 07:17:16,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:17:16,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2025-03-09 07:17:16,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 26 letters. Loop has 2 letters. [2025-03-09 07:17:16,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:17:16,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 28 letters. Loop has 2 letters. [2025-03-09 07:17:16,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:17:16,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 26 letters. Loop has 4 letters. [2025-03-09 07:17:16,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:17:16,865 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 37 transitions. [2025-03-09 07:17:16,865 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 07:17:16,866 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 37 transitions. [2025-03-09 07:17:16,867 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2025-03-09 07:17:16,867 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2025-03-09 07:17:16,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 37 transitions. [2025-03-09 07:17:16,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:17:16,867 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 37 transitions. [2025-03-09 07:17:16,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 37 transitions. [2025-03-09 07:17:16,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-03-09 07:17:16,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.15625) internal successors, (37), 31 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:17:16,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2025-03-09 07:17:16,868 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 37 transitions. [2025-03-09 07:17:16,868 INFO L432 stractBuchiCegarLoop]: Abstraction has 32 states and 37 transitions. [2025-03-09 07:17:16,868 INFO L338 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-03-09 07:17:16,868 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 37 transitions. [2025-03-09 07:17:16,868 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 07:17:16,868 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:17:16,868 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:17:16,869 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:17:16,869 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 07:17:16,869 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1);" "assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1;" "main_~nc_B~0#1 := 0;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1;" "assume !!(main_~nc_B~0#1 >= main_~nc_A~0#1);main_~j~0#1 := 0;main_~i~0#1 := main_~j~0#1;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume !(main_#t~mem11#1 == main_#t~mem12#1);havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_~i~0#1 := 1 + (main_~i~0#1 - main_~j~0#1);main_~j~0#1 := 0;" [2025-03-09 07:17:16,869 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume main_#t~mem11#1 == main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;main_#t~post14#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" [2025-03-09 07:17:16,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:16,869 INFO L85 PathProgramCache]: Analyzing trace with hash -945737327, now seen corresponding path program 1 times [2025-03-09 07:17:16,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:16,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814883044] [2025-03-09 07:17:16,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:17:16,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:16,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 07:17:16,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 07:17:16,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:16,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:16,889 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:17:16,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 07:17:16,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 07:17:16,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:16,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:16,907 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:17:16,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:16,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1407, now seen corresponding path program 4 times [2025-03-09 07:17:16,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:16,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646812706] [2025-03-09 07:17:16,908 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 07:17:16,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:16,910 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-03-09 07:17:16,911 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:17:16,911 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 07:17:16,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:16,911 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:17:16,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:17:16,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:17:16,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:16,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:16,914 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:17:16,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:16,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1679495951, now seen corresponding path program 1 times [2025-03-09 07:17:16,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:16,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967039731] [2025-03-09 07:17:16,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:17:16,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:16,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 07:17:16,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 07:17:16,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:16,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:17:17,036 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-09 07:17:17,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:17:17,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967039731] [2025-03-09 07:17:17,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967039731] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 07:17:17,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021644681] [2025-03-09 07:17:17,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:17:17,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 07:17:17,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:17,040 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 07:17:17,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Waiting until timeout for monitored process [2025-03-09 07:17:17,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 07:17:17,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 07:17:17,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:17,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:17:17,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 07:17:17,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:17:17,149 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-09 07:17:17,149 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 07:17:17,175 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-09 07:17:17,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021644681] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 07:17:17,175 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 07:17:17,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-09 07:17:17,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955058855] [2025-03-09 07:17:17,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 07:17:17,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:17:17,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 07:17:17,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-09 07:17:17,247 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. cyclomatic complexity: 9 Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:17:17,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:17:17,291 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2025-03-09 07:17:17,291 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 53 transitions. [2025-03-09 07:17:17,291 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 07:17:17,291 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 35 states and 40 transitions. [2025-03-09 07:17:17,291 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2025-03-09 07:17:17,291 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2025-03-09 07:17:17,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 40 transitions. [2025-03-09 07:17:17,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:17:17,292 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 40 transitions. [2025-03-09 07:17:17,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 40 transitions. [2025-03-09 07:17:17,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2025-03-09 07:17:17,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 33 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:17:17,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2025-03-09 07:17:17,293 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 39 transitions. [2025-03-09 07:17:17,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 07:17:17,294 INFO L432 stractBuchiCegarLoop]: Abstraction has 34 states and 39 transitions. [2025-03-09 07:17:17,295 INFO L338 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-03-09 07:17:17,295 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 39 transitions. [2025-03-09 07:17:17,295 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 07:17:17,295 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:17:17,295 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:17:17,295 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:17:17,295 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 07:17:17,295 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1);" "assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1;" "main_~nc_B~0#1 := 0;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1;" "assume !!(main_~nc_B~0#1 >= main_~nc_A~0#1);main_~j~0#1 := 0;main_~i~0#1 := main_~j~0#1;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume !(main_#t~mem11#1 == main_#t~mem12#1);havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_~i~0#1 := 1 + (main_~i~0#1 - main_~j~0#1);main_~j~0#1 := 0;" [2025-03-09 07:17:17,295 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume main_#t~mem11#1 == main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;main_#t~post14#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" [2025-03-09 07:17:17,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:17,297 INFO L85 PathProgramCache]: Analyzing trace with hash -580406096, now seen corresponding path program 2 times [2025-03-09 07:17:17,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:17,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329802412] [2025-03-09 07:17:17,297 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:17:17,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:17,305 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-09 07:17:17,311 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 07:17:17,311 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 07:17:17,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:17:17,401 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-09 07:17:17,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:17:17,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329802412] [2025-03-09 07:17:17,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329802412] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 07:17:17,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823646507] [2025-03-09 07:17:17,402 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:17:17,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 07:17:17,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:17,404 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 07:17:17,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Waiting until timeout for monitored process [2025-03-09 07:17:17,462 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-09 07:17:17,480 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 07:17:17,480 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 07:17:17,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:17:17,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 07:17:17,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:17:17,531 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-09 07:17:17,531 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 07:17:17,565 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-09 07:17:17,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823646507] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 07:17:17,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 07:17:17,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-09 07:17:17,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990264378] [2025-03-09 07:17:17,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 07:17:17,565 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 07:17:17,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:17,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1407, now seen corresponding path program 5 times [2025-03-09 07:17:17,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:17,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904744671] [2025-03-09 07:17:17,566 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 07:17:17,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:17,569 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:17:17,570 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:17:17,570 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 07:17:17,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:17,570 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:17:17,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:17:17,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:17:17,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:17,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:17,572 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:17:17,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:17:17,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 07:17:17,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-03-09 07:17:17,633 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. cyclomatic complexity: 9 Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:17:17,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:17:17,677 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2025-03-09 07:17:17,677 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 45 transitions. [2025-03-09 07:17:17,677 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 07:17:17,677 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 38 states and 43 transitions. [2025-03-09 07:17:17,677 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2025-03-09 07:17:17,677 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2025-03-09 07:17:17,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 43 transitions. [2025-03-09 07:17:17,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:17:17,678 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 43 transitions. [2025-03-09 07:17:17,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 43 transitions. [2025-03-09 07:17:17,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2025-03-09 07:17:17,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 35 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:17:17,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2025-03-09 07:17:17,679 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 41 transitions. [2025-03-09 07:17:17,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 07:17:17,679 INFO L432 stractBuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2025-03-09 07:17:17,679 INFO L338 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-03-09 07:17:17,679 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 41 transitions. [2025-03-09 07:17:17,682 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 07:17:17,682 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:17:17,682 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:17:17,682 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:17:17,682 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 07:17:17,682 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1);" "assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1;" "main_~nc_B~0#1 := 0;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1;" "assume !!(main_~nc_B~0#1 >= main_~nc_A~0#1);main_~j~0#1 := 0;main_~i~0#1 := main_~j~0#1;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume !(main_#t~mem11#1 == main_#t~mem12#1);havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_~i~0#1 := 1 + (main_~i~0#1 - main_~j~0#1);main_~j~0#1 := 0;" [2025-03-09 07:17:17,682 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume main_#t~mem11#1 == main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;main_#t~post14#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" [2025-03-09 07:17:17,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:17,683 INFO L85 PathProgramCache]: Analyzing trace with hash 608981521, now seen corresponding path program 3 times [2025-03-09 07:17:17,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:17,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240522816] [2025-03-09 07:17:17,683 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 07:17:17,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:17,691 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 4 equivalence classes. [2025-03-09 07:17:17,714 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 07:17:17,714 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-09 07:17:17,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:17,714 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:17:17,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-09 07:17:17,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 07:17:17,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:17,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:17,736 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:17:17,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:17,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1407, now seen corresponding path program 6 times [2025-03-09 07:17:17,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:17,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115913383] [2025-03-09 07:17:17,736 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 07:17:17,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:17,739 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:17:17,740 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:17:17,740 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-09 07:17:17,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:17,740 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:17:17,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:17:17,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:17:17,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:17,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:17,742 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:17:17,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:17,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1115689871, now seen corresponding path program 2 times [2025-03-09 07:17:17,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:17,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572450150] [2025-03-09 07:17:17,742 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:17:17,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:17,751 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-09 07:17:17,763 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 07:17:17,763 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 07:17:17,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:17,763 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:17:17,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 07:17:17,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 07:17:17,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:17,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:17,779 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:17:21,063 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:17:21,063 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:17:21,063 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:17:21,063 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:17:21,063 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 07:17:21,063 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:21,063 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:17:21,063 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:17:21,063 INFO L132 ssoRankerPreferences]: Filename of dumped script: string-1.i_Iteration13_Lasso [2025-03-09 07:17:21,063 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:17:21,063 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:17:21,064 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:21,072 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:21,073 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:21,075 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:21,076 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:21,077 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:21,079 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:21,082 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:21,084 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:21,085 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:21,087 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:21,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:21,410 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:21,411 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:21,412 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:21,413 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:21,414 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:21,815 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:17:21,816 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 07:17:21,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:21,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:21,818 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:21,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2025-03-09 07:17:21,820 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:21,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:21,830 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:21,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:21,830 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:21,831 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:21,831 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:21,833 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:21,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0 [2025-03-09 07:17:21,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:21,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:21,841 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:21,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2025-03-09 07:17:21,842 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:21,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:21,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:21,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:21,852 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:21,853 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:21,853 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:21,855 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:21,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2025-03-09 07:17:21,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:21,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:21,863 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:21,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2025-03-09 07:17:21,864 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:21,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:21,874 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:21,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:21,874 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:21,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:21,874 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:21,874 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:21,875 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:21,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Ended with exit code 0 [2025-03-09 07:17:21,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:21,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:21,883 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:21,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2025-03-09 07:17:21,886 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:21,895 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:21,896 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:21,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:21,896 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:21,896 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:21,896 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:21,896 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:21,897 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:21,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Forceful destruction successful, exit code 0 [2025-03-09 07:17:21,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:21,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:21,905 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:21,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2025-03-09 07:17:21,907 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:21,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:21,917 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:21,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:21,917 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:21,917 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:21,917 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:21,917 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:21,918 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:21,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Ended with exit code 0 [2025-03-09 07:17:21,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:21,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:21,925 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:21,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2025-03-09 07:17:21,927 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:21,936 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:21,936 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:21,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:21,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:21,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:21,937 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:21,937 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:21,938 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:21,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Ended with exit code 0 [2025-03-09 07:17:21,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:21,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:21,945 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:21,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2025-03-09 07:17:21,950 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:21,959 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:21,959 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:21,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:21,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:21,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:21,960 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:21,960 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:21,961 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:21,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Ended with exit code 0 [2025-03-09 07:17:21,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:21,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:21,967 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:21,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2025-03-09 07:17:21,969 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:21,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:21,979 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:21,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:21,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:21,979 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:21,979 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:21,979 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:21,980 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:21,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Ended with exit code 0 [2025-03-09 07:17:21,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:21,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:21,988 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:21,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2025-03-09 07:17:21,989 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:21,999 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:21,999 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:21,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:21,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:21,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:22,000 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:22,000 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:22,001 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:22,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Forceful destruction successful, exit code 0 [2025-03-09 07:17:22,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:22,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:22,008 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:22,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2025-03-09 07:17:22,011 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:22,020 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:22,020 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:22,021 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:22,021 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:22,021 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:22,021 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:22,021 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:22,022 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:22,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Ended with exit code 0 [2025-03-09 07:17:22,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:22,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:22,030 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:22,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2025-03-09 07:17:22,031 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:22,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:22,041 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:22,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:22,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:22,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:22,041 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:22,041 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:22,042 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:22,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Ended with exit code 0 [2025-03-09 07:17:22,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:22,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:22,050 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:22,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2025-03-09 07:17:22,051 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:22,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:22,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:22,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:22,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:22,062 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:22,062 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:22,063 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:22,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2025-03-09 07:17:22,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:22,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:22,071 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:22,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2025-03-09 07:17:22,072 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:22,082 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:22,082 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:22,082 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:22,082 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:22,083 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:22,083 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:22,086 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:22,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Ended with exit code 0 [2025-03-09 07:17:22,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:22,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:22,093 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:22,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2025-03-09 07:17:22,095 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:22,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:22,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:22,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:22,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:22,105 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:22,105 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:22,109 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:22,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Ended with exit code 0 [2025-03-09 07:17:22,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:22,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:22,117 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:22,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2025-03-09 07:17:22,118 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:22,127 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:22,127 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:22,128 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:22,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:22,128 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:22,128 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:22,131 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:22,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0 [2025-03-09 07:17:22,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:22,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:22,139 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:22,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2025-03-09 07:17:22,140 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:22,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:22,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:22,149 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:22,149 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:22,150 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:22,150 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:22,152 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:22,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Ended with exit code 0 [2025-03-09 07:17:22,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:22,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:22,160 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:22,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2025-03-09 07:17:22,162 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:22,172 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:22,173 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:22,173 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:22,173 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:22,173 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:22,174 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:22,176 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:22,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Forceful destruction successful, exit code 0 [2025-03-09 07:17:22,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:22,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:22,183 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:22,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2025-03-09 07:17:22,185 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:22,196 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:22,196 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:22,196 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:22,196 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:22,197 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:22,197 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:22,200 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:22,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Forceful destruction successful, exit code 0 [2025-03-09 07:17:22,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:22,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:22,207 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:22,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2025-03-09 07:17:22,208 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:22,218 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:22,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:22,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:22,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:22,219 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:22,219 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:22,221 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:22,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Ended with exit code 0 [2025-03-09 07:17:22,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:22,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:22,228 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:22,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2025-03-09 07:17:22,230 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:22,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:22,240 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-03-09 07:17:22,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:22,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:22,241 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-03-09 07:17:22,241 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:22,243 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:22,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Ended with exit code 0 [2025-03-09 07:17:22,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:22,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:22,251 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:22,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2025-03-09 07:17:22,252 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:22,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:22,262 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:22,262 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:22,262 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:22,263 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:22,263 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:22,265 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:22,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Ended with exit code 0 [2025-03-09 07:17:22,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:22,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:22,273 INFO L229 MonitoredProcess]: Starting monitored process 120 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:22,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2025-03-09 07:17:22,274 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:22,284 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:22,284 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:22,284 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:22,284 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:22,285 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:22,285 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:22,287 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:22,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Ended with exit code 0 [2025-03-09 07:17:22,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:22,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:22,295 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:22,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2025-03-09 07:17:22,296 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:22,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:22,306 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:22,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:22,306 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:22,306 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:22,306 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:22,306 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:22,307 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:22,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Ended with exit code 0 [2025-03-09 07:17:22,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:22,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:22,314 INFO L229 MonitoredProcess]: Starting monitored process 122 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:22,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2025-03-09 07:17: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-09 07:17:22,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:22,326 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:22,326 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:22,326 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:22,328 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:22,328 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:22,334 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 07:17:22,343 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-03-09 07:17:22,343 INFO L444 ModelExtractionUtils]: 0 out of 16 variables were initially zero. Simplification set additionally 12 variables to zero. [2025-03-09 07:17:22,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:22,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:22,345 INFO L229 MonitoredProcess]: Starting monitored process 123 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:22,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2025-03-09 07:17:22,346 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 07:17:22,357 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 07:17:22,357 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 07:17:22,357 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#string_A~0#1.base)_5, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~#string_A~0#1.offset) = 1*v_rep(select #length ULTIMATE.start_main_~#string_A~0#1.base)_5 - 1*ULTIMATE.start_main_~i~0#1 - 1*ULTIMATE.start_main_~#string_A~0#1.offset Supporting invariants [] [2025-03-09 07:17:22,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Ended with exit code 0 [2025-03-09 07:17:22,377 INFO L156 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2025-03-09 07:17:22,378 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-09 07:17:22,378 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-09 07:17:22,378 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#string_A~0!offset [2025-03-09 07:17:22,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:22,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-09 07:17:22,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 07:17:22,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:22,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:17:22,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 07:17:22,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:17:22,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:17:22,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:17:22,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:22,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:17:22,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 07:17:22,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:17:22,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:17:22,459 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-03-09 07:17:22,459 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 36 states and 41 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:17:22,472 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 36 states and 41 transitions. cyclomatic complexity: 9. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 40 states and 47 transitions. Complement of second has 5 states. [2025-03-09 07:17:22,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-03-09 07:17:22,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:17:22,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2025-03-09 07:17:22,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 32 letters. Loop has 2 letters. [2025-03-09 07:17:22,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:17:22,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 34 letters. Loop has 2 letters. [2025-03-09 07:17:22,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:17:22,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 32 letters. Loop has 4 letters. [2025-03-09 07:17:22,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:17:22,474 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 47 transitions. [2025-03-09 07:17:22,474 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 07:17:22,474 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 47 transitions. [2025-03-09 07:17:22,474 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2025-03-09 07:17:22,474 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2025-03-09 07:17:22,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 47 transitions. [2025-03-09 07:17:22,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:17:22,474 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 47 transitions. [2025-03-09 07:17:22,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 47 transitions. [2025-03-09 07:17:22,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-09 07:17:22,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.175) internal successors, (47), 39 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:17:22,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2025-03-09 07:17:22,476 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 47 transitions. [2025-03-09 07:17:22,476 INFO L432 stractBuchiCegarLoop]: Abstraction has 40 states and 47 transitions. [2025-03-09 07:17:22,476 INFO L338 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-03-09 07:17:22,476 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 47 transitions. [2025-03-09 07:17:22,476 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 07:17:22,476 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:17:22,476 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:17:22,477 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:17:22,477 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 07:17:22,477 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1);" "assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1;" "main_~nc_B~0#1 := 0;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1;" "assume !!(main_~nc_B~0#1 >= main_~nc_A~0#1);main_~j~0#1 := 0;main_~i~0#1 := main_~j~0#1;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume !(main_#t~mem11#1 == main_#t~mem12#1);havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_~i~0#1 := 1 + (main_~i~0#1 - main_~j~0#1);main_~j~0#1 := 0;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume !(main_#t~mem11#1 == main_#t~mem12#1);havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_~i~0#1 := 1 + (main_~i~0#1 - main_~j~0#1);main_~j~0#1 := 0;" [2025-03-09 07:17:22,477 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume main_#t~mem11#1 == main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;main_#t~post14#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" [2025-03-09 07:17:22,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:22,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1115689872, now seen corresponding path program 4 times [2025-03-09 07:17:22,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:22,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260080087] [2025-03-09 07:17:22,478 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 07:17:22,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:22,485 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 34 statements into 2 equivalence classes. [2025-03-09 07:17:22,499 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 07:17:22,499 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 07:17:22,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:22,500 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:17:22,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 07:17:22,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 07:17:22,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:22,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:22,519 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:17:22,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:22,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1407, now seen corresponding path program 7 times [2025-03-09 07:17:22,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:22,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581018535] [2025-03-09 07:17:22,520 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 07:17:22,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:22,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:17:22,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:17:22,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:22,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:22,524 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:17:22,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:17:22,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:17:22,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:22,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:22,526 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:17:22,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:22,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1563856562, now seen corresponding path program 3 times [2025-03-09 07:17:22,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:22,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109801350] [2025-03-09 07:17:22,527 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 07:17:22,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:22,536 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 4 equivalence classes. [2025-03-09 07:17:22,549 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 34 of 36 statements. [2025-03-09 07:17:22,551 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-09 07:17:22,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:17:22,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Ended with exit code 0 [2025-03-09 07:17:22,684 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-09 07:17:22,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:17:22,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109801350] [2025-03-09 07:17:22,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109801350] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 07:17:22,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1732734828] [2025-03-09 07:17:22,685 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 07:17:22,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 07:17:22,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:22,687 INFO L229 MonitoredProcess]: Starting monitored process 124 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 07:17:22,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (124)] Waiting until timeout for monitored process [2025-03-09 07:17:22,760 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 4 equivalence classes. [2025-03-09 07:17:22,786 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 34 of 36 statements. [2025-03-09 07:17:22,786 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-09 07:17:22,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:17:22,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 07:17:22,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:17:22,849 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-09 07:17:22,849 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 07:17:22,890 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-09 07:17:22,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1732734828] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 07:17:22,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 07:17:22,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2025-03-09 07:17:22,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664175852] [2025-03-09 07:17:22,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 07:17:22,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:17:22,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 07:17:22,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-03-09 07:17:22,938 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. cyclomatic complexity: 12 Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:17:23,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:17:23,002 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2025-03-09 07:17:23,002 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 73 transitions. [2025-03-09 07:17:23,002 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 07:17:23,003 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 43 states and 50 transitions. [2025-03-09 07:17:23,003 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2025-03-09 07:17:23,003 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2025-03-09 07:17:23,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 50 transitions. [2025-03-09 07:17:23,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:17:23,003 INFO L218 hiAutomatonCegarLoop]: Abstraction has 43 states and 50 transitions. [2025-03-09 07:17:23,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 50 transitions. [2025-03-09 07:17:23,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2025-03-09 07:17:23,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 41 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:17:23,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2025-03-09 07:17:23,006 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 49 transitions. [2025-03-09 07:17:23,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 07:17:23,006 INFO L432 stractBuchiCegarLoop]: Abstraction has 42 states and 49 transitions. [2025-03-09 07:17:23,006 INFO L338 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2025-03-09 07:17:23,006 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 49 transitions. [2025-03-09 07:17:23,007 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 07:17:23,007 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:17:23,007 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:17:23,007 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:17:23,007 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 07:17:23,007 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1);" "assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1;" "main_~nc_B~0#1 := 0;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1;" "assume !!(main_~nc_B~0#1 >= main_~nc_A~0#1);main_~j~0#1 := 0;main_~i~0#1 := main_~j~0#1;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume !(main_#t~mem11#1 == main_#t~mem12#1);havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_~i~0#1 := 1 + (main_~i~0#1 - main_~j~0#1);main_~j~0#1 := 0;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume !(main_#t~mem11#1 == main_#t~mem12#1);havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_~i~0#1 := 1 + (main_~i~0#1 - main_~j~0#1);main_~j~0#1 := 0;" [2025-03-09 07:17:23,007 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume main_#t~mem11#1 == main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;main_#t~post14#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" [2025-03-09 07:17:23,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:23,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1543928977, now seen corresponding path program 5 times [2025-03-09 07:17:23,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:23,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763219444] [2025-03-09 07:17:23,008 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 07:17:23,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:23,015 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 36 statements into 4 equivalence classes. [2025-03-09 07:17:23,023 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 07:17:23,023 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-09 07:17:23,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:17:23,134 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-09 07:17:23,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:17:23,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763219444] [2025-03-09 07:17:23,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763219444] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 07:17:23,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446180846] [2025-03-09 07:17:23,135 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 07:17:23,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 07:17:23,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:23,137 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 07:17:23,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Waiting until timeout for monitored process [2025-03-09 07:17:23,209 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 36 statements into 4 equivalence classes. [2025-03-09 07:17:23,268 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 07:17:23,268 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-09 07:17:23,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:17:23,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 07:17:23,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:17:23,320 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-09 07:17:23,321 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 07:17:23,369 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-09 07:17:23,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446180846] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 07:17:23,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 07:17:23,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2025-03-09 07:17:23,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095320022] [2025-03-09 07:17:23,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 07:17:23,370 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 07:17:23,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:23,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1407, now seen corresponding path program 8 times [2025-03-09 07:17:23,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:23,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510377359] [2025-03-09 07:17:23,370 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:17:23,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:23,372 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:17:23,373 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:17:23,373 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 07:17:23,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:23,373 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:17:23,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:17:23,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:17:23,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:23,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:23,375 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:17:23,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:17:23,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 07:17:23,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2025-03-09 07:17:23,442 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. cyclomatic complexity: 12 Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:17:23,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:17:23,487 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2025-03-09 07:17:23,488 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 55 transitions. [2025-03-09 07:17:23,488 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 07:17:23,488 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 46 states and 53 transitions. [2025-03-09 07:17:23,488 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2025-03-09 07:17:23,488 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2025-03-09 07:17:23,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 53 transitions. [2025-03-09 07:17:23,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:17:23,489 INFO L218 hiAutomatonCegarLoop]: Abstraction has 46 states and 53 transitions. [2025-03-09 07:17:23,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 53 transitions. [2025-03-09 07:17:23,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2025-03-09 07:17:23,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:17:23,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2025-03-09 07:17:23,490 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 51 transitions. [2025-03-09 07:17:23,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 07:17:23,491 INFO L432 stractBuchiCegarLoop]: Abstraction has 44 states and 51 transitions. [2025-03-09 07:17:23,491 INFO L338 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2025-03-09 07:17:23,491 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 51 transitions. [2025-03-09 07:17:23,492 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 07:17:23,492 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:17:23,492 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:17:23,492 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:17:23,492 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 07:17:23,492 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1);" "assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1;" "main_~nc_B~0#1 := 0;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1;" "assume !!(main_~nc_B~0#1 >= main_~nc_A~0#1);main_~j~0#1 := 0;main_~i~0#1 := main_~j~0#1;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume !(main_#t~mem11#1 == main_#t~mem12#1);havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_~i~0#1 := 1 + (main_~i~0#1 - main_~j~0#1);main_~j~0#1 := 0;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume !(main_#t~mem11#1 == main_#t~mem12#1);havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_~i~0#1 := 1 + (main_~i~0#1 - main_~j~0#1);main_~j~0#1 := 0;" [2025-03-09 07:17:23,492 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume main_#t~mem11#1 == main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;main_#t~post14#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" [2025-03-09 07:17:23,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:23,494 INFO L85 PathProgramCache]: Analyzing trace with hash 167906448, now seen corresponding path program 6 times [2025-03-09 07:17:23,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:23,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49742719] [2025-03-09 07:17:23,494 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 07:17:23,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:23,504 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 38 statements into 4 equivalence classes. [2025-03-09 07:17:23,518 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 07:17:23,519 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-03-09 07:17:23,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:23,519 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:17:23,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-09 07:17:23,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 07:17:23,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:23,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:23,539 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:17:23,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:23,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1407, now seen corresponding path program 9 times [2025-03-09 07:17:23,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:23,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818273518] [2025-03-09 07:17:23,540 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 07:17:23,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:23,542 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:17:23,543 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:17:23,543 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 07:17:23,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:23,543 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:17:23,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:17:23,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:17:23,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:23,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:23,546 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:17:23,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:23,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1850660274, now seen corresponding path program 4 times [2025-03-09 07:17:23,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:23,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515851465] [2025-03-09 07:17:23,546 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 07:17:23,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:23,554 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-03-09 07:17:23,568 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 07:17:23,569 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 07:17:23,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:23,569 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:17:23,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-09 07:17:23,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 07:17:23,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:23,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:23,595 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:17:28,176 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:17:28,176 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:17:28,176 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:17:28,176 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:17:28,176 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 07:17:28,176 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:28,176 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:17:28,176 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:17:28,176 INFO L132 ssoRankerPreferences]: Filename of dumped script: string-1.i_Iteration16_Lasso [2025-03-09 07:17:28,176 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:17:28,176 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:17:28,178 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:28,181 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:28,182 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:28,189 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:28,190 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:28,191 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:28,577 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:28,578 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:28,579 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:28,580 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:28,581 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:28,582 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:28,583 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:28,584 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:28,585 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:28,586 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:28,587 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:28,697 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2025-03-09 07:17:29,707 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:17:29,707 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 07:17:29,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:29,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:29,709 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:29,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process [2025-03-09 07:17:29,711 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:29,721 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:29,721 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:29,721 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:29,721 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:29,721 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:29,721 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:29,721 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:29,722 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:29,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Ended with exit code 0 [2025-03-09 07:17:29,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:29,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:29,730 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:29,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2025-03-09 07:17:29,731 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:29,741 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:29,741 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:29,741 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:29,741 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:29,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:29,741 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:29,741 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:29,742 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:29,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Ended with exit code 0 [2025-03-09 07:17:29,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:29,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:29,749 INFO L229 MonitoredProcess]: Starting monitored process 128 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:29,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2025-03-09 07:17:29,751 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:29,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:29,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:29,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:29,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:29,762 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:29,762 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:29,764 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:29,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Forceful destruction successful, exit code 0 [2025-03-09 07:17:29,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:29,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:29,774 INFO L229 MonitoredProcess]: Starting monitored process 129 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:29,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2025-03-09 07:17:29,775 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:29,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:29,785 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:29,785 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:29,785 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:29,786 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:29,786 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:29,788 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:29,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Ended with exit code 0 [2025-03-09 07:17:29,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:29,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:29,795 INFO L229 MonitoredProcess]: Starting monitored process 130 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:29,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2025-03-09 07:17:29,797 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:29,806 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:29,806 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:29,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:29,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:29,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:29,807 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:29,807 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:29,808 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:29,813 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Ended with exit code 0 [2025-03-09 07:17:29,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:29,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:29,815 INFO L229 MonitoredProcess]: Starting monitored process 131 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:29,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process [2025-03-09 07:17:29,817 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:29,826 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:29,826 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:29,826 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:29,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:29,826 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:29,827 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:29,827 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:29,828 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:29,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Ended with exit code 0 [2025-03-09 07:17:29,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:29,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:29,836 INFO L229 MonitoredProcess]: Starting monitored process 132 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:29,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2025-03-09 07:17:29,838 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:29,847 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:29,847 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:29,847 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:29,847 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:29,848 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:29,848 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:29,850 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:29,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Ended with exit code 0 [2025-03-09 07:17:29,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:29,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:29,858 INFO L229 MonitoredProcess]: Starting monitored process 133 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:29,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2025-03-09 07:17:29,860 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:29,870 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:29,870 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:29,870 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:29,870 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:29,872 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:29,872 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:29,877 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 07:17:29,887 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2025-03-09 07:17:29,887 INFO L444 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-03-09 07:17:29,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:29,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:29,889 INFO L229 MonitoredProcess]: Starting monitored process 134 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:29,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2025-03-09 07:17:29,891 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 07:17:29,901 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-03-09 07:17:29,901 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 07:17:29,901 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 5 Supporting invariants [-1*ULTIMATE.start_main_~nc_A~0#1 + 3 >= 0] [2025-03-09 07:17:29,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Forceful destruction successful, exit code 0 [2025-03-09 07:17:29,933 INFO L156 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2025-03-09 07:17:29,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:29,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-09 07:17:29,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 07:17:29,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:29,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:17:29,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 07:17:29,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:17:30,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:17:30,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:17:30,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:30,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:17:30,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 07:17:30,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:17:30,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:17:30,132 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2025-03-09 07:17:30,132 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states and 51 transitions. cyclomatic complexity: 12 Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 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-09 07:17:30,199 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 44 states and 51 transitions. cyclomatic complexity: 12. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 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) Result 70 states and 85 transitions. Complement of second has 10 states. [2025-03-09 07:17:30,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 5 stem states 1 non-accepting loop states 2 accepting loop states [2025-03-09 07:17:30,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 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-09 07:17:30,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 38 transitions. [2025-03-09 07:17:30,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 38 transitions. Stem has 38 letters. Loop has 2 letters. [2025-03-09 07:17:30,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:17:30,200 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 07:17:30,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:30,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-09 07:17:30,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 07:17:30,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:30,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:17:30,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 07:17:30,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:17:30,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:17:30,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:17:30,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:30,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:17:30,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 07:17:30,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:17:30,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:17:30,398 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.5 stem predicates 2 loop predicates [2025-03-09 07:17:30,398 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states and 51 transitions. cyclomatic complexity: 12 Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 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-09 07:17:30,457 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 44 states and 51 transitions. cyclomatic complexity: 12. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 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) Result 70 states and 85 transitions. Complement of second has 10 states. [2025-03-09 07:17:30,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 5 stem states 1 non-accepting loop states 2 accepting loop states [2025-03-09 07:17:30,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 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-09 07:17:30,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 38 transitions. [2025-03-09 07:17:30,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 38 transitions. Stem has 38 letters. Loop has 2 letters. [2025-03-09 07:17:30,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:17:30,458 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 07:17:30,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:30,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-09 07:17:30,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 07:17:30,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:30,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:17:30,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 07:17:30,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:17:30,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Ended with exit code 0 [2025-03-09 07:17:30,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:17:30,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:17:30,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:30,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:17:30,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 07:17:30,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:17:30,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:17:30,661 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2025-03-09 07:17:30,661 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states and 51 transitions. cyclomatic complexity: 12 Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 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-09 07:17:30,731 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 44 states and 51 transitions. cyclomatic complexity: 12. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 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) Result 76 states and 94 transitions. Complement of second has 9 states. [2025-03-09 07:17:30,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 5 stem states 1 non-accepting loop states 2 accepting loop states [2025-03-09 07:17:30,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 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-09 07:17:30,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2025-03-09 07:17:30,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 38 letters. Loop has 2 letters. [2025-03-09 07:17:30,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:17:30,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 40 letters. Loop has 2 letters. [2025-03-09 07:17:30,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:17:30,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 40 transitions. Stem has 38 letters. Loop has 4 letters. [2025-03-09 07:17:30,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:17:30,732 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 94 transitions. [2025-03-09 07:17:30,733 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-03-09 07:17:30,734 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 74 states and 90 transitions. [2025-03-09 07:17:30,734 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2025-03-09 07:17:30,734 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2025-03-09 07:17:30,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 90 transitions. [2025-03-09 07:17:30,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:17:30,734 INFO L218 hiAutomatonCegarLoop]: Abstraction has 74 states and 90 transitions. [2025-03-09 07:17:30,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 90 transitions. [2025-03-09 07:17:30,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 61. [2025-03-09 07:17:30,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 1.180327868852459) internal successors, (72), 60 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:17:30,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2025-03-09 07:17:30,736 INFO L240 hiAutomatonCegarLoop]: Abstraction has 61 states and 72 transitions. [2025-03-09 07:17:30,736 INFO L432 stractBuchiCegarLoop]: Abstraction has 61 states and 72 transitions. [2025-03-09 07:17:30,736 INFO L338 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2025-03-09 07:17:30,737 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 72 transitions. [2025-03-09 07:17:30,737 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-03-09 07:17:30,737 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:17:30,737 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:17:30,737 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:17:30,737 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 07:17:30,738 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1);" "assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1;" "main_~nc_B~0#1 := 0;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1;" "assume !!(main_~nc_B~0#1 >= main_~nc_A~0#1);main_~j~0#1 := 0;main_~i~0#1 := main_~j~0#1;" [2025-03-09 07:17:30,738 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume !(main_#t~mem11#1 == main_#t~mem12#1);havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_~i~0#1 := 1 + (main_~i~0#1 - main_~j~0#1);main_~j~0#1 := 0;" [2025-03-09 07:17:30,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:30,738 INFO L85 PathProgramCache]: Analyzing trace with hash 516863442, now seen corresponding path program 2 times [2025-03-09 07:17:30,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:30,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134428735] [2025-03-09 07:17:30,738 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:17:30,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:30,745 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-09 07:17:30,754 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 07:17:30,755 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 07:17:30,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:30,755 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:17:30,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 07:17:30,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 07:17:30,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:30,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:30,769 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:17:30,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:30,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1408, now seen corresponding path program 1 times [2025-03-09 07:17:30,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:30,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639389480] [2025-03-09 07:17:30,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 07:17:30,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:30,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:17:30,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:17:30,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:30,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:30,773 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:17:30,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:17:30,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:17:30,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:30,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:30,775 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:17:30,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:30,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1510438127, now seen corresponding path program 7 times [2025-03-09 07:17:30,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:30,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911373916] [2025-03-09 07:17:30,776 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 07:17:30,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:30,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-09 07:17:30,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 07:17:30,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:30,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:30,791 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:17:30,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-09 07:17:30,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 07:17:30,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:30,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:30,809 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:17:36,170 WARN L286 SmtUtils]: Spent 5.30s on a formula simplification. DAG size of input: 335 DAG size of output: 258 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-03-09 07:17:36,794 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:17:36,794 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:17:36,794 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:17:36,794 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:17:36,794 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 07:17:36,795 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:36,795 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:17:36,795 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:17:36,795 INFO L132 ssoRankerPreferences]: Filename of dumped script: string-1.i_Iteration17_Lasso [2025-03-09 07:17:36,795 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:17:36,795 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:17:36,796 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:36,798 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:36,799 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:36,800 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:36,802 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:37,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:37,224 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:37,225 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:37,226 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:37,227 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:37,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:37,230 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:37,231 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:37,232 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:37,240 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:37,248 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:37,250 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:37,507 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:17:37,507 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 07:17:37,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:37,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:37,509 INFO L229 MonitoredProcess]: Starting monitored process 135 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:37,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2025-03-09 07:17:37,510 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:37,520 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:37,520 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:37,520 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:37,521 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:37,521 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:37,521 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:37,521 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:37,523 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:37,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Forceful destruction successful, exit code 0 [2025-03-09 07:17:37,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:37,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:37,531 INFO L229 MonitoredProcess]: Starting monitored process 136 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:37,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2025-03-09 07:17:37,533 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:37,542 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:37,543 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:37,543 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:37,543 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:37,543 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:37,543 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:37,543 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:37,544 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:37,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Ended with exit code 0 [2025-03-09 07:17:37,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:37,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:37,552 INFO L229 MonitoredProcess]: Starting monitored process 137 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:37,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process [2025-03-09 07:17:37,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-09 07:17:37,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:37,564 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:37,564 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:37,564 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:37,564 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:37,564 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:37,564 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:37,565 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:37,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Forceful destruction successful, exit code 0 [2025-03-09 07:17:37,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:37,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:37,575 INFO L229 MonitoredProcess]: Starting monitored process 138 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:37,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process [2025-03-09 07:17:37,576 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:37,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:37,586 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:37,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:37,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:37,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:37,587 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:37,587 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:37,587 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:37,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Forceful destruction successful, exit code 0 [2025-03-09 07:17:37,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:37,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:37,595 INFO L229 MonitoredProcess]: Starting monitored process 139 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:37,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Waiting until timeout for monitored process [2025-03-09 07:17:37,596 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:37,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:37,606 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:37,606 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:37,606 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:37,607 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:37,607 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:37,610 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:37,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Ended with exit code 0 [2025-03-09 07:17:37,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:37,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:37,618 INFO L229 MonitoredProcess]: Starting monitored process 140 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:37,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Waiting until timeout for monitored process [2025-03-09 07:17:37,621 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:37,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:37,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:37,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:37,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:37,636 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:37,636 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:37,646 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 07:17:37,663 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-03-09 07:17:37,664 INFO L444 ModelExtractionUtils]: 3 out of 28 variables were initially zero. Simplification set additionally 22 variables to zero. [2025-03-09 07:17:37,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:37,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:37,666 INFO L229 MonitoredProcess]: Starting monitored process 141 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:37,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Waiting until timeout for monitored process [2025-03-09 07:17:37,668 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 07:17:37,679 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 07:17:37,679 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 07:17:37,679 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, v_rep(select #length ULTIMATE.start_main_~#string_A~0#1.base)_7) = -2*ULTIMATE.start_main_~i~0#1 + 5*v_rep(select #length ULTIMATE.start_main_~#string_A~0#1.base)_7 Supporting invariants [] [2025-03-09 07:17:37,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Forceful destruction successful, exit code 0 [2025-03-09 07:17:37,726 INFO L156 tatePredicateManager]: 16 out of 18 supporting invariants were superfluous and have been removed [2025-03-09 07:17:37,729 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-09 07:17:37,730 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-09 07:17:37,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:37,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 07:17:37,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 07:17:37,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:37,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:17:37,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 07:17:37,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:17:37,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:17:37,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:17:37,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:37,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:17:37,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 07:17:37,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:17:37,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:17:37,883 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2025-03-09 07:17:37,884 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 61 states and 72 transitions. cyclomatic complexity: 18 Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:17:37,961 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 61 states and 72 transitions. cyclomatic complexity: 18. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 73 states and 89 transitions. Complement of second has 10 states. [2025-03-09 07:17:37,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 5 stem states 1 non-accepting loop states 2 accepting loop states [2025-03-09 07:17:37,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:17:37,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 33 transitions. [2025-03-09 07:17:37,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 33 transitions. Stem has 34 letters. Loop has 2 letters. [2025-03-09 07:17:37,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:17:37,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 33 transitions. Stem has 36 letters. Loop has 2 letters. [2025-03-09 07:17:37,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:17:37,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 33 transitions. Stem has 34 letters. Loop has 4 letters. [2025-03-09 07:17:37,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:17:37,963 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 89 transitions. [2025-03-09 07:17:37,963 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-03-09 07:17:37,964 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 71 states and 85 transitions. [2025-03-09 07:17:37,964 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2025-03-09 07:17:37,964 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2025-03-09 07:17:37,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 85 transitions. [2025-03-09 07:17:37,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:17:37,964 INFO L218 hiAutomatonCegarLoop]: Abstraction has 71 states and 85 transitions. [2025-03-09 07:17:37,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 85 transitions. [2025-03-09 07:17:37,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 64. [2025-03-09 07:17:37,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 1.203125) internal successors, (77), 63 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:17:37,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 77 transitions. [2025-03-09 07:17:37,969 INFO L240 hiAutomatonCegarLoop]: Abstraction has 64 states and 77 transitions. [2025-03-09 07:17:37,969 INFO L432 stractBuchiCegarLoop]: Abstraction has 64 states and 77 transitions. [2025-03-09 07:17:37,969 INFO L338 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2025-03-09 07:17:37,969 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 77 transitions. [2025-03-09 07:17:37,969 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-03-09 07:17:37,970 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:17:37,970 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:17:37,970 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:17:37,970 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 07:17:37,970 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1);" "assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1;" "main_~nc_B~0#1 := 0;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1;" "assume !!(main_~nc_B~0#1 >= main_~nc_A~0#1);main_~j~0#1 := 0;main_~i~0#1 := main_~j~0#1;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume main_#t~mem11#1 == main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;main_#t~post14#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" [2025-03-09 07:17:37,970 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_#t~mem11#1 == main_#t~mem12#1);havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_~i~0#1 := 1 + (main_~i~0#1 - main_~j~0#1);main_~j~0#1 := 0;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" [2025-03-09 07:17:37,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:37,970 INFO L85 PathProgramCache]: Analyzing trace with hash 421058302, now seen corresponding path program 2 times [2025-03-09 07:17:37,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:37,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2814990] [2025-03-09 07:17:37,971 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:17:37,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:37,983 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-09 07:17:38,021 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-09 07:17:38,021 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 07:17:38,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:38,021 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:17:38,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-09 07:17:38,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Forceful destruction successful, exit code 0 [2025-03-09 07:17:38,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-09 07:17:38,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:38,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:38,038 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:17:38,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:38,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1378, now seen corresponding path program 2 times [2025-03-09 07:17:38,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:38,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443360164] [2025-03-09 07:17:38,039 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:17:38,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:38,041 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:17:38,042 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:17:38,042 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 07:17:38,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:38,042 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:17:38,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:17:38,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:17:38,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:38,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:38,045 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:17:38,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:38,045 INFO L85 PathProgramCache]: Analyzing trace with hash 910102815, now seen corresponding path program 5 times [2025-03-09 07:17:38,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:38,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094174108] [2025-03-09 07:17:38,046 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 07:17:38,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:38,055 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 39 statements into 4 equivalence classes. [2025-03-09 07:17:38,066 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 39 of 39 statements. [2025-03-09 07:17:38,067 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-09 07:17:38,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:38,067 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:17:38,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-09 07:17:38,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-09 07:17:38,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:38,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:38,083 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:17:44,972 WARN L286 SmtUtils]: Spent 6.82s on a formula simplification. DAG size of input: 374 DAG size of output: 280 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-03-09 07:17:45,757 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:17:45,757 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:17:45,757 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:17:45,757 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:17:45,757 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 07:17:45,757 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:45,757 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:17:45,757 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:17:45,757 INFO L132 ssoRankerPreferences]: Filename of dumped script: string-1.i_Iteration18_Lasso [2025-03-09 07:17:45,757 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:17:45,757 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:17:45,758 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:45,760 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:45,761 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:45,763 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:46,285 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:46,286 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:46,287 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:46,288 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:46,289 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:46,298 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:46,299 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:46,300 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:46,301 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:46,302 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:46,303 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:46,306 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:46,647 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:17:46,648 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 07:17:46,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:46,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:46,649 INFO L229 MonitoredProcess]: Starting monitored process 142 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:46,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Waiting until timeout for monitored process [2025-03-09 07:17:46,651 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:46,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:46,661 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:46,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:46,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:46,661 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:46,661 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:46,661 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:46,662 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:46,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Ended with exit code 0 [2025-03-09 07:17:46,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:46,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:46,670 INFO L229 MonitoredProcess]: Starting monitored process 143 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:46,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Waiting until timeout for monitored process [2025-03-09 07:17:46,672 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:46,682 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:46,683 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:46,683 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:46,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:46,683 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:46,683 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:46,683 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:46,684 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:46,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Ended with exit code 0 [2025-03-09 07:17:46,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:46,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:46,691 INFO L229 MonitoredProcess]: Starting monitored process 144 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:46,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Waiting until timeout for monitored process [2025-03-09 07:17:46,692 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:46,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:46,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:46,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:46,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:46,703 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:46,703 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:46,706 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:46,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Ended with exit code 0 [2025-03-09 07:17:46,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:46,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:46,713 INFO L229 MonitoredProcess]: Starting monitored process 145 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:46,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Waiting until timeout for monitored process [2025-03-09 07:17:46,715 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:46,725 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:46,725 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:46,725 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:46,725 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:46,726 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:46,726 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:46,728 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:46,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Ended with exit code 0 [2025-03-09 07:17:46,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:46,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:46,735 INFO L229 MonitoredProcess]: Starting monitored process 146 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:46,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Waiting until timeout for monitored process [2025-03-09 07:17:46,736 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:46,746 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:46,746 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:46,746 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:46,746 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:46,747 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:46,747 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:46,750 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:46,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Ended with exit code 0 [2025-03-09 07:17:46,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:46,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:46,757 INFO L229 MonitoredProcess]: Starting monitored process 147 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:46,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Waiting until timeout for monitored process [2025-03-09 07:17:46,758 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:46,768 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:46,769 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-03-09 07:17:46,769 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:46,769 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:46,769 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-03-09 07:17:46,769 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:46,772 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:46,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Ended with exit code 0 [2025-03-09 07:17:46,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:46,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:46,779 INFO L229 MonitoredProcess]: Starting monitored process 148 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:46,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Waiting until timeout for monitored process [2025-03-09 07:17:46,781 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:46,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:46,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:46,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:46,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:46,793 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:46,793 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:46,797 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:46,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Ended with exit code 0 [2025-03-09 07:17:46,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:46,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:46,804 INFO L229 MonitoredProcess]: Starting monitored process 149 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:46,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Waiting until timeout for monitored process [2025-03-09 07:17:46,805 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:46,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:46,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:46,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:46,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:46,816 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:46,816 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:46,819 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:46,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Ended with exit code 0 [2025-03-09 07:17:46,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:46,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:46,827 INFO L229 MonitoredProcess]: Starting monitored process 150 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:46,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Waiting until timeout for monitored process [2025-03-09 07:17:46,829 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:46,839 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:46,839 INFO L203 nArgumentSynthesizer]: 8 stem disjuncts [2025-03-09 07:17:46,839 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-09 07:17:46,839 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:46,858 INFO L401 nArgumentSynthesizer]: We have 44 Motzkin's Theorem applications. [2025-03-09 07:17:46,859 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-03-09 07:17:46,893 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:46,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Ended with exit code 0 [2025-03-09 07:17:46,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:46,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:46,900 INFO L229 MonitoredProcess]: Starting monitored process 151 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:46,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Waiting until timeout for monitored process [2025-03-09 07:17:46,903 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:46,912 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:46,912 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-03-09 07:17:46,912 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:46,912 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:46,913 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-03-09 07:17:46,913 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:46,915 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:46,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Ended with exit code 0 [2025-03-09 07:17:46,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:46,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:46,922 INFO L229 MonitoredProcess]: Starting monitored process 152 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:46,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Waiting until timeout for monitored process [2025-03-09 07:17:46,923 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:46,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:46,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:46,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:46,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:46,934 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:46,934 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:46,935 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:46,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Forceful destruction successful, exit code 0 [2025-03-09 07:17:46,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:46,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:46,942 INFO L229 MonitoredProcess]: Starting monitored process 153 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:46,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Waiting until timeout for monitored process [2025-03-09 07:17:46,944 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:46,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:46,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:46,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:46,953 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:46,954 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:46,954 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:46,957 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:46,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Ended with exit code 0 [2025-03-09 07:17:46,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:46,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:46,964 INFO L229 MonitoredProcess]: Starting monitored process 154 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:46,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Waiting until timeout for monitored process [2025-03-09 07:17:46,965 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:46,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:46,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:46,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:46,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:46,975 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:46,975 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:46,977 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:46,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Ended with exit code 0 [2025-03-09 07:17:46,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:46,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:46,985 INFO L229 MonitoredProcess]: Starting monitored process 155 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:46,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Waiting until timeout for monitored process [2025-03-09 07:17:46,986 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:46,995 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:46,995 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:46,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:46,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:46,996 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:46,996 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:46,998 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:47,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Ended with exit code 0 [2025-03-09 07:17:47,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:47,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:47,006 INFO L229 MonitoredProcess]: Starting monitored process 156 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:47,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Waiting until timeout for monitored process [2025-03-09 07:17:47,007 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:47,016 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:47,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:47,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:47,016 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:47,017 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:47,017 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:47,019 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:47,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Ended with exit code 0 [2025-03-09 07:17:47,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:47,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:47,026 INFO L229 MonitoredProcess]: Starting monitored process 157 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:47,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Waiting until timeout for monitored process [2025-03-09 07:17:47,027 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:47,037 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:47,037 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:47,037 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:47,037 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:47,038 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:47,038 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:47,040 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:47,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Ended with exit code 0 [2025-03-09 07:17:47,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:47,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:47,047 INFO L229 MonitoredProcess]: Starting monitored process 158 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:47,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Waiting until timeout for monitored process [2025-03-09 07:17:47,048 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:47,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:47,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:47,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:47,058 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:47,058 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:47,059 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:47,061 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:47,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Ended with exit code 0 [2025-03-09 07:17:47,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:47,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:47,069 INFO L229 MonitoredProcess]: Starting monitored process 159 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:47,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Waiting until timeout for monitored process [2025-03-09 07:17:47,070 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:47,080 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:47,080 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:47,080 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:47,080 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:47,081 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:47,081 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:47,083 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:47,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Ended with exit code 0 [2025-03-09 07:17:47,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:47,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:47,090 INFO L229 MonitoredProcess]: Starting monitored process 160 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:47,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Waiting until timeout for monitored process [2025-03-09 07:17:47,092 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:47,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:47,102 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:47,102 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:47,102 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:47,104 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:47,104 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:47,111 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 07:17:47,124 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-03-09 07:17:47,124 INFO L444 ModelExtractionUtils]: 0 out of 19 variables were initially zero. Simplification set additionally 15 variables to zero. [2025-03-09 07:17:47,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:47,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:47,126 INFO L229 MonitoredProcess]: Starting monitored process 161 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:47,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Waiting until timeout for monitored process [2025-03-09 07:17:47,127 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 07:17:47,137 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 07:17:47,137 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 07:17:47,137 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~j~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 2*ULTIMATE.start_main_~j~0#1 + 3 Supporting invariants [] [2025-03-09 07:17:47,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Ended with exit code 0 [2025-03-09 07:17:47,183 INFO L156 tatePredicateManager]: 18 out of 19 supporting invariants were superfluous and have been removed [2025-03-09 07:17:47,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:47,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-09 07:17:47,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-09 07:17:47,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:47,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:17:47,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 07:17:47,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:17:47,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:17:47,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:17:47,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:47,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:17:47,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 07:17:47,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:17:47,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:17:47,323 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 2 loop predicates [2025-03-09 07:17:47,323 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 77 transitions. cyclomatic complexity: 21 Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 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-09 07:17:47,380 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 64 states and 77 transitions. cyclomatic complexity: 21. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 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) Result 81 states and 99 transitions. Complement of second has 12 states. [2025-03-09 07:17:47,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 5 stem states 2 non-accepting loop states 2 accepting loop states [2025-03-09 07:17:47,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 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-09 07:17:47,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 38 transitions. [2025-03-09 07:17:47,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 38 transitions. Stem has 37 letters. Loop has 2 letters. [2025-03-09 07:17:47,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:17:47,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 38 transitions. Stem has 39 letters. Loop has 2 letters. [2025-03-09 07:17:47,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:17:47,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 38 transitions. Stem has 37 letters. Loop has 4 letters. [2025-03-09 07:17:47,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:17:47,381 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 99 transitions. [2025-03-09 07:17:47,382 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 07:17:47,382 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 50 states and 58 transitions. [2025-03-09 07:17:47,382 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2025-03-09 07:17:47,382 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2025-03-09 07:17:47,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 58 transitions. [2025-03-09 07:17:47,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:17:47,382 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 58 transitions. [2025-03-09 07:17:47,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 58 transitions. [2025-03-09 07:17:47,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2025-03-09 07:17:47,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.148936170212766) internal successors, (54), 46 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:17:47,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2025-03-09 07:17:47,384 INFO L240 hiAutomatonCegarLoop]: Abstraction has 47 states and 54 transitions. [2025-03-09 07:17:47,384 INFO L432 stractBuchiCegarLoop]: Abstraction has 47 states and 54 transitions. [2025-03-09 07:17:47,384 INFO L338 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2025-03-09 07:17:47,384 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 54 transitions. [2025-03-09 07:17:47,384 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 07:17:47,384 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:17:47,384 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:17:47,385 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 5, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:17:47,385 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 07:17:47,385 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1);" "assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1;" "main_~nc_B~0#1 := 0;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1;" "assume !!(main_~nc_B~0#1 >= main_~nc_A~0#1);main_~j~0#1 := 0;main_~i~0#1 := main_~j~0#1;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume !(main_#t~mem11#1 == main_#t~mem12#1);havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_~i~0#1 := 1 + (main_~i~0#1 - main_~j~0#1);main_~j~0#1 := 0;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume !(main_#t~mem11#1 == main_#t~mem12#1);havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_~i~0#1 := 1 + (main_~i~0#1 - main_~j~0#1);main_~j~0#1 := 0;" [2025-03-09 07:17:47,385 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume main_#t~mem11#1 == main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;main_#t~post14#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" [2025-03-09 07:17:47,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:47,385 INFO L85 PathProgramCache]: Analyzing trace with hash 796030191, now seen corresponding path program 8 times [2025-03-09 07:17:47,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:47,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296094067] [2025-03-09 07:17:47,385 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:17:47,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:47,392 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-03-09 07:17:47,398 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 07:17:47,398 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 07:17:47,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:17:47,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Ended with exit code 0 [2025-03-09 07:17:47,585 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 12 proven. 20 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-09 07:17:47,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:17:47,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296094067] [2025-03-09 07:17:47,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296094067] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 07:17:47,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001586961] [2025-03-09 07:17:47,585 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:17:47,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 07:17:47,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:47,587 INFO L229 MonitoredProcess]: Starting monitored process 162 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 07:17:47,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (162)] Waiting until timeout for monitored process [2025-03-09 07:17:47,677 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-03-09 07:17:47,702 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 07:17:47,702 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 07:17:47,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:17:47,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-09 07:17:47,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:17:47,779 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-09 07:17:47,779 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 07:17:47,835 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-09 07:17:47,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001586961] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 07:17:47,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 07:17:47,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2025-03-09 07:17:47,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803562024] [2025-03-09 07:17:47,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 07:17:47,835 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 07:17:47,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:47,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1407, now seen corresponding path program 10 times [2025-03-09 07:17:47,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:47,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776126014] [2025-03-09 07:17:47,836 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 07:17:47,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:47,837 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-03-09 07:17:47,838 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:17:47,838 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 07:17:47,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:47,838 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:17:47,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:17:47,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:17:47,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:47,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:47,841 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:17:47,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:17:47,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-09 07:17:47,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2025-03-09 07:17:47,887 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. cyclomatic complexity: 12 Second operand has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 17 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:17:47,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:17:47,924 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2025-03-09 07:17:47,925 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 60 transitions. [2025-03-09 07:17:47,925 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 07:17:47,925 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 51 states and 58 transitions. [2025-03-09 07:17:47,925 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2025-03-09 07:17:47,925 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2025-03-09 07:17:47,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 58 transitions. [2025-03-09 07:17:47,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:17:47,925 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 58 transitions. [2025-03-09 07:17:47,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 58 transitions. [2025-03-09 07:17:47,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2025-03-09 07:17:47,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 48 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:17:47,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2025-03-09 07:17:47,926 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 56 transitions. [2025-03-09 07:17:47,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 07:17:47,930 INFO L432 stractBuchiCegarLoop]: Abstraction has 49 states and 56 transitions. [2025-03-09 07:17:47,930 INFO L338 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2025-03-09 07:17:47,930 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 56 transitions. [2025-03-09 07:17:47,930 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2025-03-09 07:17:47,930 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:17:47,930 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:17:47,930 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:17:47,930 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 07:17:47,931 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1);" "assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1;" "main_~nc_B~0#1 := 0;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1;" "assume !!(main_~nc_B~0#1 >= main_~nc_A~0#1);main_~j~0#1 := 0;main_~i~0#1 := main_~j~0#1;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume !(main_#t~mem11#1 == main_#t~mem12#1);havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_~i~0#1 := 1 + (main_~i~0#1 - main_~j~0#1);main_~j~0#1 := 0;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume !(main_#t~mem11#1 == main_#t~mem12#1);havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_~i~0#1 := 1 + (main_~i~0#1 - main_~j~0#1);main_~j~0#1 := 0;" [2025-03-09 07:17:47,931 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume main_#t~mem11#1 == main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;main_#t~post14#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" [2025-03-09 07:17:47,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:47,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1694196208, now seen corresponding path program 9 times [2025-03-09 07:17:47,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:47,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354634405] [2025-03-09 07:17:47,932 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 07:17:47,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:47,941 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 5 equivalence classes. [2025-03-09 07:17:47,962 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 07:17:47,962 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-09 07:17:47,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:47,962 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:17:47,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-09 07:17:47,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 07:17:47,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:47,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:47,976 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:17:47,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:47,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1407, now seen corresponding path program 11 times [2025-03-09 07:17:47,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:47,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068261606] [2025-03-09 07:17:47,978 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 07:17:47,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:47,980 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:17:47,980 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:17:47,980 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 07:17:47,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:47,980 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:17:47,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:17:47,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:17:47,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:47,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:47,983 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:17:47,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:47,983 INFO L85 PathProgramCache]: Analyzing trace with hash -329950258, now seen corresponding path program 6 times [2025-03-09 07:17:47,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:47,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013887822] [2025-03-09 07:17:47,983 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 07:17:47,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:47,991 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 44 statements into 5 equivalence classes. [2025-03-09 07:17:48,007 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 07:17:48,007 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-09 07:17:48,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:48,007 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:17:48,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-09 07:17:48,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 07:17:48,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:48,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:48,025 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:17:53,214 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:17:53,214 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:17:53,214 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:17:53,214 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:17:53,214 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 07:17:53,214 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:53,214 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:17:53,214 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:17:53,214 INFO L132 ssoRankerPreferences]: Filename of dumped script: string-1.i_Iteration20_Lasso [2025-03-09 07:17:53,215 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:17:53,215 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:17:53,216 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:53,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:53,219 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:53,220 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:53,221 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:53,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:53,223 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:53,224 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:53,225 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:53,226 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:53,227 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:53,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:53,234 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:53,235 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:53,236 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:53,237 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:53,743 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:17:53,859 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2025-03-09 07:17:54,818 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:17:54,818 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 07:17:54,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:54,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:54,820 INFO L229 MonitoredProcess]: Starting monitored process 163 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:54,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Waiting until timeout for monitored process [2025-03-09 07:17:54,822 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:54,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:54,832 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:54,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:54,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:54,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:54,832 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:54,832 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:54,833 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:54,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Forceful destruction successful, exit code 0 [2025-03-09 07:17:54,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:54,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:54,841 INFO L229 MonitoredProcess]: Starting monitored process 164 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:54,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Waiting until timeout for monitored process [2025-03-09 07:17:54,843 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:54,853 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:54,853 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:54,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:54,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:54,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:54,853 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:54,853 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:54,854 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:54,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Forceful destruction successful, exit code 0 [2025-03-09 07:17:54,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:54,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:54,862 INFO L229 MonitoredProcess]: Starting monitored process 165 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:54,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Waiting until timeout for monitored process [2025-03-09 07:17:54,863 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:54,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:54,872 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:54,872 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:54,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:54,873 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:54,873 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:54,873 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:54,874 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:54,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Ended with exit code 0 [2025-03-09 07:17:54,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:54,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:54,881 INFO L229 MonitoredProcess]: Starting monitored process 166 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:54,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Waiting until timeout for monitored process [2025-03-09 07:17:54,882 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:54,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:54,891 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:54,891 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:54,891 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:54,891 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:54,892 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:54,892 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:54,893 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:54,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Ended with exit code 0 [2025-03-09 07:17:54,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:54,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:54,900 INFO L229 MonitoredProcess]: Starting monitored process 167 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:54,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Waiting until timeout for monitored process [2025-03-09 07:17:54,902 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:54,912 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:54,912 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:54,912 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:54,912 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:54,912 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:54,913 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:54,913 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:54,913 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:54,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Forceful destruction successful, exit code 0 [2025-03-09 07:17:54,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:54,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:54,921 INFO L229 MonitoredProcess]: Starting monitored process 168 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:54,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Waiting until timeout for monitored process [2025-03-09 07:17:54,923 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:54,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:54,932 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:54,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:54,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:54,932 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:54,932 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:54,932 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:54,933 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:54,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (168)] Ended with exit code 0 [2025-03-09 07:17:54,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:54,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:54,942 INFO L229 MonitoredProcess]: Starting monitored process 169 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:54,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Waiting until timeout for monitored process [2025-03-09 07:17:54,945 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:54,955 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:54,955 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:54,955 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:54,955 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:54,955 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:54,955 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:54,955 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:54,956 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:54,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (169)] Forceful destruction successful, exit code 0 [2025-03-09 07:17:54,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:54,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:54,963 INFO L229 MonitoredProcess]: Starting monitored process 170 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:54,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Waiting until timeout for monitored process [2025-03-09 07:17:54,965 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:54,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:54,974 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:54,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:54,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:54,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:54,974 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:54,974 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:54,975 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:54,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (170)] Ended with exit code 0 [2025-03-09 07:17:54,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:54,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:54,982 INFO L229 MonitoredProcess]: Starting monitored process 171 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:54,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Waiting until timeout for monitored process [2025-03-09 07:17:54,984 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:54,993 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:54,993 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:54,993 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:54,993 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:54,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:54,993 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:54,993 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:54,994 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:54,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (171)] Ended with exit code 0 [2025-03-09 07:17:54,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:55,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:55,001 INFO L229 MonitoredProcess]: Starting monitored process 172 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:55,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Waiting until timeout for monitored process [2025-03-09 07:17:55,002 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:55,013 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:55,013 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:55,013 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:55,013 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:55,013 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:55,013 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:55,013 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:55,014 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:55,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (172)] Ended with exit code 0 [2025-03-09 07:17:55,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:55,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:55,023 INFO L229 MonitoredProcess]: Starting monitored process 173 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:55,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Waiting until timeout for monitored process [2025-03-09 07:17:55,024 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:55,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:55,034 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:55,034 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:55,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:55,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:55,034 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:55,034 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:55,035 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:55,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (173)] Ended with exit code 0 [2025-03-09 07:17:55,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:55,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:55,043 INFO L229 MonitoredProcess]: Starting monitored process 174 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:55,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Waiting until timeout for monitored process [2025-03-09 07:17:55,044 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:55,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:55,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:55,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:55,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:55,055 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:55,055 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:55,057 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:55,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (174)] Ended with exit code 0 [2025-03-09 07:17:55,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:55,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:55,065 INFO L229 MonitoredProcess]: Starting monitored process 175 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:55,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Waiting until timeout for monitored process [2025-03-09 07:17:55,066 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:55,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:55,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:55,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:55,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:55,077 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:55,077 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:55,079 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:55,085 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (175)] Ended with exit code 0 [2025-03-09 07:17:55,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:55,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:55,087 INFO L229 MonitoredProcess]: Starting monitored process 176 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:55,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Waiting until timeout for monitored process [2025-03-09 07:17:55,088 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:55,097 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:55,097 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:55,097 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:55,097 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:55,097 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:55,098 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:55,098 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:55,098 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:55,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (176)] Ended with exit code 0 [2025-03-09 07:17:55,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:55,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:55,106 INFO L229 MonitoredProcess]: Starting monitored process 177 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:55,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Waiting until timeout for monitored process [2025-03-09 07:17:55,108 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:55,117 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:55,117 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:55,117 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:55,117 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:55,117 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:55,117 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:55,117 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:55,118 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:55,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (177)] Ended with exit code 0 [2025-03-09 07:17:55,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:55,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:55,126 INFO L229 MonitoredProcess]: Starting monitored process 178 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:55,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Waiting until timeout for monitored process [2025-03-09 07:17:55,127 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:55,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:55,136 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:17:55,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:55,137 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:55,137 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:55,137 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:17:55,137 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:17:55,138 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:55,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (178)] Ended with exit code 0 [2025-03-09 07:17:55,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:55,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:55,145 INFO L229 MonitoredProcess]: Starting monitored process 179 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:55,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Waiting until timeout for monitored process [2025-03-09 07:17:55,146 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:55,156 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:55,156 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-03-09 07:17:55,156 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:55,156 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:55,157 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-03-09 07:17:55,157 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:55,160 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:55,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (179)] Ended with exit code 0 [2025-03-09 07:17:55,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:55,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:55,166 INFO L229 MonitoredProcess]: Starting monitored process 180 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:55,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Waiting until timeout for monitored process [2025-03-09 07:17:55,168 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:55,178 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:55,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:55,178 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:55,178 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:55,179 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:55,179 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:55,181 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:55,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (180)] Ended with exit code 0 [2025-03-09 07:17:55,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:55,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:55,189 INFO L229 MonitoredProcess]: Starting monitored process 181 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:55,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Waiting until timeout for monitored process [2025-03-09 07:17:55,191 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:55,200 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:55,201 INFO L203 nArgumentSynthesizer]: 36 stem disjuncts [2025-03-09 07:17:55,201 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:55,201 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:55,226 INFO L401 nArgumentSynthesizer]: We have 76 Motzkin's Theorem applications. [2025-03-09 07:17:55,226 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:55,265 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:55,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Ended with exit code 0 [2025-03-09 07:17:55,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:55,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:55,274 INFO L229 MonitoredProcess]: Starting monitored process 182 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:55,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Waiting until timeout for monitored process [2025-03-09 07:17:55,276 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:55,285 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:55,286 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-03-09 07:17:55,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:55,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:55,287 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-03-09 07:17:55,287 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:55,290 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:55,296 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Ended with exit code 0 [2025-03-09 07:17:55,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:55,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:55,298 INFO L229 MonitoredProcess]: Starting monitored process 183 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:55,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Waiting until timeout for monitored process [2025-03-09 07:17:55,299 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:55,309 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:55,309 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-03-09 07:17:55,309 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:55,309 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:55,310 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-03-09 07:17:55,310 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:55,314 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:17:55,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Ended with exit code 0 [2025-03-09 07:17:55,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:55,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:55,321 INFO L229 MonitoredProcess]: Starting monitored process 184 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:55,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Waiting until timeout for monitored process [2025-03-09 07:17:55,322 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:17:55,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:17:55,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:17:55,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:17:55,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:17:55,334 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:17:55,334 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:17:55,339 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 07:17:55,347 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-03-09 07:17:55,347 INFO L444 ModelExtractionUtils]: 3 out of 16 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-03-09 07:17:55,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:17:55,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:17:55,349 INFO L229 MonitoredProcess]: Starting monitored process 185 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:17:55,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Waiting until timeout for monitored process [2025-03-09 07:17:55,350 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 07:17:55,361 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 07:17:55,361 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 07:17:55,361 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = -2*ULTIMATE.start_main_~j~0#1 + 7 Supporting invariants [] [2025-03-09 07:17:55,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Ended with exit code 0 [2025-03-09 07:17:55,407 INFO L156 tatePredicateManager]: 18 out of 19 supporting invariants were superfluous and have been removed [2025-03-09 07:17:55,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:55,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-09 07:17:55,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 07:17:55,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:55,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:17:55,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 07:17:55,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:17:55,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:17:55,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:17:55,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:55,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:17:55,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 07:17:55,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:17:55,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:17:55,570 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2025-03-09 07:17:55,570 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 56 transitions. cyclomatic complexity: 12 Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:17:55,638 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 56 transitions. cyclomatic complexity: 12. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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 73 states and 89 transitions. Complement of second has 11 states. [2025-03-09 07:17:55,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 6 stem states 1 non-accepting loop states 2 accepting loop states [2025-03-09 07:17:55,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:17:55,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 36 transitions. [2025-03-09 07:17:55,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 36 transitions. Stem has 42 letters. Loop has 2 letters. [2025-03-09 07:17:55,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:17:55,639 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 07:17:55,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:55,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-09 07:17:55,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 07:17:55,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:55,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:17:55,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 07:17:55,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:17:55,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:17:55,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:17:55,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:55,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:17:55,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 07:17:55,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:17:55,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:17:55,773 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.6 stem predicates 2 loop predicates [2025-03-09 07:17:55,773 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 56 transitions. cyclomatic complexity: 12 Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:17:55,830 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 56 transitions. cyclomatic complexity: 12. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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 73 states and 89 transitions. Complement of second has 11 states. [2025-03-09 07:17:55,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 6 stem states 1 non-accepting loop states 2 accepting loop states [2025-03-09 07:17:55,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:17:55,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 36 transitions. [2025-03-09 07:17:55,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 36 transitions. Stem has 42 letters. Loop has 2 letters. [2025-03-09 07:17:55,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:17:55,831 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-03-09 07:17:55,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:55,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-09 07:17:55,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 07:17:55,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:55,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:17:55,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 07:17:55,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:17:55,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:17:55,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:17:55,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:55,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:17:55,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 07:17:55,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:17:55,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:17:55,969 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2025-03-09 07:17:55,969 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 56 transitions. cyclomatic complexity: 12 Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:17:56,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (185)] Ended with exit code 0 [2025-03-09 07:17:56,043 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 56 transitions. cyclomatic complexity: 12. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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 79 states and 98 transitions. Complement of second has 10 states. [2025-03-09 07:17:56,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 6 stem states 1 non-accepting loop states 2 accepting loop states [2025-03-09 07:17:56,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:17:56,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 38 transitions. [2025-03-09 07:17:56,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 38 transitions. Stem has 42 letters. Loop has 2 letters. [2025-03-09 07:17:56,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:17:56,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 38 transitions. Stem has 44 letters. Loop has 2 letters. [2025-03-09 07:17:56,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:17:56,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 38 transitions. Stem has 42 letters. Loop has 4 letters. [2025-03-09 07:17:56,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:17:56,044 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 98 transitions. [2025-03-09 07:17:56,045 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2025-03-09 07:17:56,045 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 75 states and 92 transitions. [2025-03-09 07:17:56,045 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2025-03-09 07:17:56,045 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2025-03-09 07:17:56,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 92 transitions. [2025-03-09 07:17:56,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:17:56,045 INFO L218 hiAutomatonCegarLoop]: Abstraction has 75 states and 92 transitions. [2025-03-09 07:17:56,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 92 transitions. [2025-03-09 07:17:56,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 59. [2025-03-09 07:17:56,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 1.1864406779661016) internal successors, (70), 58 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:17:56,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2025-03-09 07:17:56,047 INFO L240 hiAutomatonCegarLoop]: Abstraction has 59 states and 70 transitions. [2025-03-09 07:17:56,047 INFO L432 stractBuchiCegarLoop]: Abstraction has 59 states and 70 transitions. [2025-03-09 07:17:56,047 INFO L338 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2025-03-09 07:17:56,047 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 70 transitions. [2025-03-09 07:17:56,047 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-03-09 07:17:56,048 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:17:56,048 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:17:56,048 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:17:56,048 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 07:17:56,048 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1);" "assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1;" "main_~nc_B~0#1 := 0;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1;" "assume !!(main_~nc_B~0#1 >= main_~nc_A~0#1);main_~j~0#1 := 0;main_~i~0#1 := main_~j~0#1;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume !(main_#t~mem11#1 == main_#t~mem12#1);havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_~i~0#1 := 1 + (main_~i~0#1 - main_~j~0#1);main_~j~0#1 := 0;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" [2025-03-09 07:17:56,048 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_#t~mem11#1 == main_#t~mem12#1);havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_~i~0#1 := 1 + (main_~i~0#1 - main_~j~0#1);main_~j~0#1 := 0;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" [2025-03-09 07:17:56,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:56,049 INFO L85 PathProgramCache]: Analyzing trace with hash -54651491, now seen corresponding path program 10 times [2025-03-09 07:17:56,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:56,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683317562] [2025-03-09 07:17:56,049 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 07:17:56,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:56,057 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 41 statements into 2 equivalence classes. [2025-03-09 07:17:56,069 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-03-09 07:17:56,070 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 07:17:56,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:56,070 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:17:56,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-09 07:17:56,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-09 07:17:56,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:56,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:56,085 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:17:56,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:56,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1378, now seen corresponding path program 3 times [2025-03-09 07:17:56,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:56,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167614315] [2025-03-09 07:17:56,086 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 07:17:56,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:56,089 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:17:56,089 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:17:56,090 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-09 07:17:56,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:56,090 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:17:56,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:17:56,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:17:56,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:56,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:56,092 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:17:56,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:17:56,093 INFO L85 PathProgramCache]: Analyzing trace with hash -980474882, now seen corresponding path program 11 times [2025-03-09 07:17:56,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:17:56,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619321688] [2025-03-09 07:17:56,093 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 07:17:56,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:17:56,103 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 43 statements into 5 equivalence classes. [2025-03-09 07:17:56,119 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 43 of 43 statements. [2025-03-09 07:17:56,119 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-09 07:17:56,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:56,120 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:17:56,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-09 07:17:56,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-09 07:17:56,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:17:56,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:17:56,139 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:18:00,941 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:18:00,942 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:18:00,942 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:18:00,942 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:18:00,942 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 07:18:00,942 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:00,942 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:18:00,942 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:18:00,942 INFO L132 ssoRankerPreferences]: Filename of dumped script: string-1.i_Iteration21_Lasso [2025-03-09 07:18:00,942 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:18:00,942 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:18:00,943 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:00,944 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:00,945 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:00,946 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:00,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:00,948 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:00,949 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:00,950 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:00,951 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:00,955 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:00,956 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:00,957 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:00,958 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:00,965 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:01,297 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:01,784 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:18:01,785 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 07:18:01,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:01,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:01,786 INFO L229 MonitoredProcess]: Starting monitored process 186 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:01,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Waiting until timeout for monitored process [2025-03-09 07:18:01,788 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:01,797 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:01,797 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:18:01,797 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:01,797 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:01,797 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:01,797 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:18:01,798 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:18:01,798 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:18:01,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (186)] Ended with exit code 0 [2025-03-09 07:18:01,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:01,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:01,805 INFO L229 MonitoredProcess]: Starting monitored process 187 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:01,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Waiting until timeout for monitored process [2025-03-09 07:18:01,807 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:01,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:01,816 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:18:01,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:01,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:01,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:01,817 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:18:01,817 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:18:01,818 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:18:01,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (187)] Ended with exit code 0 [2025-03-09 07:18:01,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:01,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:01,825 INFO L229 MonitoredProcess]: Starting monitored process 188 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:01,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Waiting until timeout for monitored process [2025-03-09 07:18:01,826 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:01,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:01,836 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:18:01,836 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:01,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:01,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:01,836 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:18:01,836 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:18:01,837 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:18:01,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (188)] Ended with exit code 0 [2025-03-09 07:18:01,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:01,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:01,845 INFO L229 MonitoredProcess]: Starting monitored process 189 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:01,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Waiting until timeout for monitored process [2025-03-09 07:18:01,847 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:01,857 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:01,857 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:18:01,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:01,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:01,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:01,857 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:18:01,857 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:18:01,858 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:18:01,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (189)] Ended with exit code 0 [2025-03-09 07:18:01,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:01,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:01,865 INFO L229 MonitoredProcess]: Starting monitored process 190 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:01,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Waiting until timeout for monitored process [2025-03-09 07:18:01,870 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:01,879 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:01,879 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:18:01,879 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:01,879 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:01,879 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:01,880 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:18:01,880 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:18:01,880 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:18:01,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (190)] Ended with exit code 0 [2025-03-09 07:18:01,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:01,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:01,888 INFO L229 MonitoredProcess]: Starting monitored process 191 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:01,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Waiting until timeout for monitored process [2025-03-09 07:18:01,889 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:01,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:01,898 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:18:01,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:01,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:01,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:01,899 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:18:01,899 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:18:01,900 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:18:01,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (191)] Ended with exit code 0 [2025-03-09 07:18:01,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:01,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:01,907 INFO L229 MonitoredProcess]: Starting monitored process 192 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:01,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Waiting until timeout for monitored process [2025-03-09 07:18:01,908 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:01,918 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:01,918 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:18:01,918 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:01,918 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:01,918 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:01,918 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:18:01,918 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:18:01,919 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:18:01,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (192)] Ended with exit code 0 [2025-03-09 07:18:01,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:01,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:01,926 INFO L229 MonitoredProcess]: Starting monitored process 193 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:01,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Waiting until timeout for monitored process [2025-03-09 07:18:01,927 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:01,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:01,937 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:18:01,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:01,937 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:01,937 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:01,937 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:18:01,937 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:18:01,938 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:18:01,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (193)] Ended with exit code 0 [2025-03-09 07:18:01,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:01,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:01,945 INFO L229 MonitoredProcess]: Starting monitored process 194 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:01,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Waiting until timeout for monitored process [2025-03-09 07:18:01,946 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:01,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:01,956 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:18:01,956 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:01,956 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:01,956 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:01,956 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:18:01,956 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:18:01,957 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:18:01,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (194)] Ended with exit code 0 [2025-03-09 07:18:01,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:01,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:01,963 INFO L229 MonitoredProcess]: Starting monitored process 195 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:01,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Waiting until timeout for monitored process [2025-03-09 07:18:01,965 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:01,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:01,974 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:18:01,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:01,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:01,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:01,975 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:18:01,975 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:18:01,976 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:18:01,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (195)] Ended with exit code 0 [2025-03-09 07:18:01,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:01,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:01,982 INFO L229 MonitoredProcess]: Starting monitored process 196 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:01,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Waiting until timeout for monitored process [2025-03-09 07:18:01,984 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:01,993 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:01,993 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:18:01,993 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:01,993 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:01,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:01,993 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:18:01,993 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:18:01,994 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:18:01,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (196)] Ended with exit code 0 [2025-03-09 07:18:01,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:01,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:02,001 INFO L229 MonitoredProcess]: Starting monitored process 197 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:02,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Waiting until timeout for monitored process [2025-03-09 07:18:02,002 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:02,012 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:02,012 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:18:02,012 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:02,012 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:02,012 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:02,012 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:18:02,012 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:18:02,013 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:18:02,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (197)] Forceful destruction successful, exit code 0 [2025-03-09 07:18:02,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:02,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:02,021 INFO L229 MonitoredProcess]: Starting monitored process 198 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:02,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Waiting until timeout for monitored process [2025-03-09 07:18:02,022 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:02,031 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:02,031 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:02,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:02,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:02,032 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:18:02,032 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:18:02,035 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:18:02,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (198)] Ended with exit code 0 [2025-03-09 07:18:02,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:02,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:02,042 INFO L229 MonitoredProcess]: Starting monitored process 199 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:02,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (199)] Waiting until timeout for monitored process [2025-03-09 07:18:02,044 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:02,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:02,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:02,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:02,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:02,054 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:18:02,054 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:18:02,056 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:18:02,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (199)] Ended with exit code 0 [2025-03-09 07:18:02,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:02,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:02,063 INFO L229 MonitoredProcess]: Starting monitored process 200 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:02,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (200)] Waiting until timeout for monitored process [2025-03-09 07:18:02,064 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:02,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:02,074 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-03-09 07:18:02,074 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:02,074 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:02,075 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-03-09 07:18:02,075 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:18:02,077 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:18:02,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (200)] Ended with exit code 0 [2025-03-09 07:18:02,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:02,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:02,084 INFO L229 MonitoredProcess]: Starting monitored process 201 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:02,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Waiting until timeout for monitored process [2025-03-09 07:18:02,085 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:02,095 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:02,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:02,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:02,095 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:02,096 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:18:02,096 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:18:02,099 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:18:02,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (201)] Ended with exit code 0 [2025-03-09 07:18:02,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:02,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:02,106 INFO L229 MonitoredProcess]: Starting monitored process 202 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:02,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Waiting until timeout for monitored process [2025-03-09 07:18:02,108 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:02,117 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:02,117 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-03-09 07:18:02,117 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:02,117 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:02,118 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-03-09 07:18:02,118 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:18:02,120 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:18:02,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (202)] Forceful destruction successful, exit code 0 [2025-03-09 07:18:02,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:02,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:02,128 INFO L229 MonitoredProcess]: Starting monitored process 203 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:02,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (203)] Waiting until timeout for monitored process [2025-03-09 07:18:02,129 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:02,138 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:02,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:02,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:02,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:02,140 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:18:02,140 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:18:02,142 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:18:02,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (203)] Ended with exit code 0 [2025-03-09 07:18:02,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:02,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:02,150 INFO L229 MonitoredProcess]: Starting monitored process 204 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:02,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (204)] Waiting until timeout for monitored process [2025-03-09 07:18:02,151 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:02,160 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:02,160 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:02,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:02,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:02,161 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:18:02,161 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:18:02,163 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:18:02,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (204)] Ended with exit code 0 [2025-03-09 07:18:02,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:02,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:02,171 INFO L229 MonitoredProcess]: Starting monitored process 205 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:02,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (205)] Waiting until timeout for monitored process [2025-03-09 07:18:02,172 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:02,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:02,182 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:02,182 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:02,182 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:02,182 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:18:02,182 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:18:02,185 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:18:02,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (205)] Ended with exit code 0 [2025-03-09 07:18:02,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:02,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:02,191 INFO L229 MonitoredProcess]: Starting monitored process 206 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:02,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (206)] Waiting until timeout for monitored process [2025-03-09 07:18:02,193 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:02,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:02,202 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-03-09 07:18:02,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:02,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:02,203 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-03-09 07:18:02,203 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:18:02,205 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:18:02,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (206)] Ended with exit code 0 [2025-03-09 07:18:02,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:02,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:02,211 INFO L229 MonitoredProcess]: Starting monitored process 207 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:02,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (207)] Waiting until timeout for monitored process [2025-03-09 07:18:02,213 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:02,223 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:02,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:02,223 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:02,223 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:02,226 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:18:02,226 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:18:02,232 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 07:18:02,246 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-03-09 07:18:02,246 INFO L444 ModelExtractionUtils]: 0 out of 19 variables were initially zero. Simplification set additionally 14 variables to zero. [2025-03-09 07:18:02,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:02,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:02,248 INFO L229 MonitoredProcess]: Starting monitored process 208 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:02,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (208)] Waiting until timeout for monitored process [2025-03-09 07:18:02,249 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 07:18:02,259 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-03-09 07:18:02,260 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 07:18:02,260 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 5 Supporting invariants [-1*ULTIMATE.start_main_~j~0#1 >= 0] [2025-03-09 07:18:02,266 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (207)] Ended with exit code 0 [2025-03-09 07:18:02,297 INFO L156 tatePredicateManager]: 16 out of 18 supporting invariants were superfluous and have been removed [2025-03-09 07:18:02,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:18:02,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-09 07:18:02,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-09 07:18:02,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:02,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:18:02,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-09 07:18:02,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:18:02,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:18:02,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:18:02,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:02,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:18:02,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 07:18:02,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:18:02,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:18:02,486 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 2 loop predicates [2025-03-09 07:18:02,486 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 59 states and 70 transitions. cyclomatic complexity: 17 Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:02,555 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 59 states and 70 transitions. cyclomatic complexity: 17. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 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 103 states and 126 transitions. Complement of second has 12 states. [2025-03-09 07:18:02,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 7 stem states 1 non-accepting loop states 2 accepting loop states [2025-03-09 07:18:02,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:02,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 36 transitions. [2025-03-09 07:18:02,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 36 transitions. Stem has 41 letters. Loop has 2 letters. [2025-03-09 07:18:02,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:18:02,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 36 transitions. Stem has 43 letters. Loop has 2 letters. [2025-03-09 07:18:02,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:18:02,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 36 transitions. Stem has 41 letters. Loop has 4 letters. [2025-03-09 07:18:02,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:18:02,556 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 126 transitions. [2025-03-09 07:18:02,557 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-03-09 07:18:02,557 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 99 states and 121 transitions. [2025-03-09 07:18:02,557 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2025-03-09 07:18:02,557 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2025-03-09 07:18:02,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 121 transitions. [2025-03-09 07:18:02,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:18:02,557 INFO L218 hiAutomatonCegarLoop]: Abstraction has 99 states and 121 transitions. [2025-03-09 07:18:02,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 121 transitions. [2025-03-09 07:18:02,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 88. [2025-03-09 07:18:02,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 87 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:02,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 107 transitions. [2025-03-09 07:18:02,559 INFO L240 hiAutomatonCegarLoop]: Abstraction has 88 states and 107 transitions. [2025-03-09 07:18:02,559 INFO L432 stractBuchiCegarLoop]: Abstraction has 88 states and 107 transitions. [2025-03-09 07:18:02,559 INFO L338 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2025-03-09 07:18:02,559 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states and 107 transitions. [2025-03-09 07:18:02,560 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-03-09 07:18:02,560 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:18:02,560 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:18:02,560 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:18:02,560 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 07:18:02,560 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1);" "assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1;" "main_~nc_B~0#1 := 0;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1;" "assume !!(main_~nc_B~0#1 >= main_~nc_A~0#1);main_~j~0#1 := 0;main_~i~0#1 := main_~j~0#1;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume main_#t~mem11#1 == main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;main_#t~post14#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" [2025-03-09 07:18:02,560 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_#t~mem11#1 == main_#t~mem12#1);havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_~i~0#1 := 1 + (main_~i~0#1 - main_~j~0#1);main_~j~0#1 := 0;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" [2025-03-09 07:18:02,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:18:02,561 INFO L85 PathProgramCache]: Analyzing trace with hash -54651522, now seen corresponding path program 3 times [2025-03-09 07:18:02,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:18:02,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144723098] [2025-03-09 07:18:02,561 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 07:18:02,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:18:02,568 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 5 equivalence classes. [2025-03-09 07:18:02,580 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 41 of 41 statements. [2025-03-09 07:18:02,580 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-09 07:18:02,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:18:02,580 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:18:02,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-09 07:18:02,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-09 07:18:02,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:02,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:18:02,609 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:18:02,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:18:02,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1378, now seen corresponding path program 4 times [2025-03-09 07:18:02,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:18:02,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118758651] [2025-03-09 07:18:02,610 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 07:18:02,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:18:02,613 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 2 statements into 2 equivalence classes. [2025-03-09 07:18:02,614 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:18:02,614 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-09 07:18:02,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:18:02,614 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:18:02,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:18:02,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:18:02,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:02,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:18:02,617 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:18:02,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:18:02,617 INFO L85 PathProgramCache]: Analyzing trace with hash -980504673, now seen corresponding path program 7 times [2025-03-09 07:18:02,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:18:02,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371051219] [2025-03-09 07:18:02,617 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-09 07:18:02,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:18:02,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-09 07:18:02,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (208)] Ended with exit code 0 [2025-03-09 07:18:02,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-09 07:18:02,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:02,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:18:02,634 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:18:02,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-09 07:18:02,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-09 07:18:02,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:02,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:18:02,652 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:18:10,996 WARN L286 SmtUtils]: Spent 8.28s on a formula simplification. DAG size of input: 402 DAG size of output: 296 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-03-09 07:18:11,741 INFO L204 LassoAnalysis]: Preferences: [2025-03-09 07:18:11,741 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-03-09 07:18:11,741 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-03-09 07:18:11,741 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-03-09 07:18:11,741 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-03-09 07:18:11,741 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:11,741 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-03-09 07:18:11,741 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-03-09 07:18:11,741 INFO L132 ssoRankerPreferences]: Filename of dumped script: string-1.i_Iteration22_Lasso [2025-03-09 07:18:11,741 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-03-09 07:18:11,741 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-03-09 07:18:11,742 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:11,744 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:11,745 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:11,746 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:11,747 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:11,748 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:11,749 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:11,750 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:12,288 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:12,289 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:12,290 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:12,291 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:12,299 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:12,300 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:12,305 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-03-09 07:18:12,680 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-03-09 07:18:12,680 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-03-09 07:18:12,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:12,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:12,685 INFO L229 MonitoredProcess]: Starting monitored process 209 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:12,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (209)] Waiting until timeout for monitored process [2025-03-09 07:18:12,686 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:12,696 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:12,696 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:18:12,696 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:12,696 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:12,696 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:12,697 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:18:12,697 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:18:12,698 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:18:12,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (209)] Ended with exit code 0 [2025-03-09 07:18:12,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:12,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:12,705 INFO L229 MonitoredProcess]: Starting monitored process 210 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:12,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (210)] Waiting until timeout for monitored process [2025-03-09 07:18:12,706 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:12,716 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:12,716 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:18:12,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:12,716 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:12,716 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:12,717 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:18:12,717 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:18:12,718 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:18:12,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (210)] Ended with exit code 0 [2025-03-09 07:18:12,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:12,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:12,726 INFO L229 MonitoredProcess]: Starting monitored process 211 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:12,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (211)] Waiting until timeout for monitored process [2025-03-09 07:18:12,727 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:12,737 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:12,737 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:18:12,737 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:12,737 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:12,737 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:12,738 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:18:12,738 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:18:12,739 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:18:12,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (211)] Forceful destruction successful, exit code 0 [2025-03-09 07:18:12,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:12,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:12,747 INFO L229 MonitoredProcess]: Starting monitored process 212 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:12,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (212)] Waiting until timeout for monitored process [2025-03-09 07:18:12,748 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:12,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:12,758 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:18:12,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:12,758 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:12,758 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:12,758 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:18:12,758 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:18:12,759 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:18:12,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (212)] Ended with exit code 0 [2025-03-09 07:18:12,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:12,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:12,767 INFO L229 MonitoredProcess]: Starting monitored process 213 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:12,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (213)] Waiting until timeout for monitored process [2025-03-09 07:18:12,768 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:12,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:12,778 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:18:12,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:12,778 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:12,778 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:12,778 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:18:12,778 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:18:12,779 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:18:12,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (213)] Ended with exit code 0 [2025-03-09 07:18:12,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:12,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:12,787 INFO L229 MonitoredProcess]: Starting monitored process 214 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:12,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (214)] Waiting until timeout for monitored process [2025-03-09 07:18:12,788 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:12,798 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:12,798 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:18:12,798 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:12,798 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:12,799 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:12,799 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:18:12,799 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:18:12,800 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:18:12,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (214)] Ended with exit code 0 [2025-03-09 07:18:12,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:12,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:12,807 INFO L229 MonitoredProcess]: Starting monitored process 215 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:12,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (215)] Waiting until timeout for monitored process [2025-03-09 07:18:12,808 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:12,818 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:12,818 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-03-09 07:18:12,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:12,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:12,818 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:12,818 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-03-09 07:18:12,818 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-03-09 07:18:12,819 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:18:12,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (215)] Ended with exit code 0 [2025-03-09 07:18:12,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:12,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:12,827 INFO L229 MonitoredProcess]: Starting monitored process 216 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:12,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (216)] Waiting until timeout for monitored process [2025-03-09 07:18:12,828 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:12,838 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:12,838 INFO L203 nArgumentSynthesizer]: 8 stem disjuncts [2025-03-09 07:18:12,838 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-03-09 07:18:12,838 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:12,859 INFO L401 nArgumentSynthesizer]: We have 44 Motzkin's Theorem applications. [2025-03-09 07:18:12,859 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-03-09 07:18:12,895 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:18:12,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (216)] Ended with exit code 0 [2025-03-09 07:18:12,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:12,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:12,903 INFO L229 MonitoredProcess]: Starting monitored process 217 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:12,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (217)] Waiting until timeout for monitored process [2025-03-09 07:18:12,906 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:12,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:12,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:12,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:12,916 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:12,917 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:18:12,917 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:18:12,920 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:18:12,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (217)] Forceful destruction successful, exit code 0 [2025-03-09 07:18:12,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:12,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:12,928 INFO L229 MonitoredProcess]: Starting monitored process 218 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:12,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (218)] Waiting until timeout for monitored process [2025-03-09 07:18:12,931 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:12,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:12,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:12,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:12,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:12,942 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:18:12,942 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:18:12,945 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:18:12,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (218)] Forceful destruction successful, exit code 0 [2025-03-09 07:18:12,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:12,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:12,953 INFO L229 MonitoredProcess]: Starting monitored process 219 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:12,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (219)] Waiting until timeout for monitored process [2025-03-09 07:18:12,956 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:12,966 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:12,966 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-03-09 07:18:12,966 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:12,966 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:12,967 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-03-09 07:18:12,967 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:18:12,969 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:18:12,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (219)] Forceful destruction successful, exit code 0 [2025-03-09 07:18:12,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:12,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:12,977 INFO L229 MonitoredProcess]: Starting monitored process 220 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:12,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (220)] Waiting until timeout for monitored process [2025-03-09 07:18:12,980 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:12,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:12,990 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-03-09 07:18:12,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:12,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:12,991 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2025-03-09 07:18:12,991 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:18:12,994 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:18:12,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (220)] Forceful destruction successful, exit code 0 [2025-03-09 07:18:13,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:13,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:13,001 INFO L229 MonitoredProcess]: Starting monitored process 221 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:13,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (221)] Waiting until timeout for monitored process [2025-03-09 07:18:13,004 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:13,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:13,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:13,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:13,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:13,015 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:18:13,015 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:18:13,018 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:18:13,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (221)] Forceful destruction successful, exit code 0 [2025-03-09 07:18:13,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:13,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:13,027 INFO L229 MonitoredProcess]: Starting monitored process 222 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:13,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (222)] Waiting until timeout for monitored process [2025-03-09 07:18:13,029 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:13,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:13,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:13,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:13,039 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:13,040 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:18:13,040 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:18:13,045 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-03-09 07:18:13,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (222)] Forceful destruction successful, exit code 0 [2025-03-09 07:18:13,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:13,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:13,054 INFO L229 MonitoredProcess]: Starting monitored process 223 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:13,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (223)] Waiting until timeout for monitored process [2025-03-09 07:18:13,056 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-03-09 07:18:13,066 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-03-09 07:18:13,067 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-03-09 07:18:13,067 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-03-09 07:18:13,067 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-03-09 07:18:13,070 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-03-09 07:18:13,070 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-03-09 07:18:13,077 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-03-09 07:18:13,095 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2025-03-09 07:18:13,095 INFO L444 ModelExtractionUtils]: 0 out of 19 variables were initially zero. Simplification set additionally 15 variables to zero. [2025-03-09 07:18:13,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-09 07:18:13,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:13,097 INFO L229 MonitoredProcess]: Starting monitored process 224 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-03-09 07:18:13,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (224)] Waiting until timeout for monitored process [2025-03-09 07:18:13,098 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-03-09 07:18:13,109 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-03-09 07:18:13,109 INFO L474 LassoAnalysis]: Proved termination. [2025-03-09 07:18:13,109 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~j~0#1, v_rep(select #length ULTIMATE.start_main_~#string_A~0#1.base)_11) = -2*ULTIMATE.start_main_~i~0#1 + 2*ULTIMATE.start_main_~j~0#1 + 5*v_rep(select #length ULTIMATE.start_main_~#string_A~0#1.base)_11 Supporting invariants [] [2025-03-09 07:18:13,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (223)] Forceful destruction successful, exit code 0 [2025-03-09 07:18:13,157 INFO L156 tatePredicateManager]: 20 out of 21 supporting invariants were superfluous and have been removed [2025-03-09 07:18:13,158 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-03-09 07:18:13,158 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-03-09 07:18:13,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:18:13,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-09 07:18:13,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-09 07:18:13,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:13,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:18:13,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-09 07:18:13,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:18:13,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:18:13,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:18:13,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:13,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:18:13,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 07:18:13,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:18:13,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 07:18:13,319 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 2 loop predicates [2025-03-09 07:18:13,319 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 88 states and 107 transitions. cyclomatic complexity: 28 Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:13,382 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 88 states and 107 transitions. cyclomatic complexity: 28. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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 139 states and 180 transitions. Complement of second has 13 states. [2025-03-09 07:18:13,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 6 stem states 2 non-accepting loop states 2 accepting loop states [2025-03-09 07:18:13,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:13,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 40 transitions. [2025-03-09 07:18:13,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 40 transitions. Stem has 41 letters. Loop has 2 letters. [2025-03-09 07:18:13,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:18:13,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 40 transitions. Stem has 43 letters. Loop has 2 letters. [2025-03-09 07:18:13,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:18:13,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 40 transitions. Stem has 41 letters. Loop has 4 letters. [2025-03-09 07:18:13,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-03-09 07:18:13,384 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 180 transitions. [2025-03-09 07:18:13,384 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2025-03-09 07:18:13,385 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 104 states and 129 transitions. [2025-03-09 07:18:13,385 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2025-03-09 07:18:13,385 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2025-03-09 07:18:13,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 129 transitions. [2025-03-09 07:18:13,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:18:13,385 INFO L218 hiAutomatonCegarLoop]: Abstraction has 104 states and 129 transitions. [2025-03-09 07:18:13,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 129 transitions. [2025-03-09 07:18:13,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 89. [2025-03-09 07:18:13,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 89 states have (on average 1.2134831460674158) internal successors, (108), 88 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:13,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 108 transitions. [2025-03-09 07:18:13,386 INFO L240 hiAutomatonCegarLoop]: Abstraction has 89 states and 108 transitions. [2025-03-09 07:18:13,386 INFO L432 stractBuchiCegarLoop]: Abstraction has 89 states and 108 transitions. [2025-03-09 07:18:13,386 INFO L338 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2025-03-09 07:18:13,386 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 108 transitions. [2025-03-09 07:18:13,387 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2025-03-09 07:18:13,387 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:18:13,387 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:18:13,387 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:18:13,387 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 07:18:13,387 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1);" "assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1;" "main_~nc_B~0#1 := 0;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1;" "assume !!(main_~nc_B~0#1 >= main_~nc_A~0#1);main_~j~0#1 := 0;main_~i~0#1 := main_~j~0#1;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume main_#t~mem11#1 == main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;main_#t~post14#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" [2025-03-09 07:18:13,387 INFO L754 eck$LassoCheckResult]: Loop: "assume !(main_#t~mem11#1 == main_#t~mem12#1);havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_~i~0#1 := 1 + (main_~i~0#1 - main_~j~0#1);main_~j~0#1 := 0;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" [2025-03-09 07:18:13,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:18:13,388 INFO L85 PathProgramCache]: Analyzing trace with hash -792732481, now seen corresponding path program 4 times [2025-03-09 07:18:13,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:18:13,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209935489] [2025-03-09 07:18:13,389 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 07:18:13,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:18:13,396 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 43 statements into 2 equivalence classes. [2025-03-09 07:18:13,401 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 42 of 43 statements. [2025-03-09 07:18:13,401 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 07:18:13,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:18:13,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (224)] Ended with exit code 0 [2025-03-09 07:18:13,592 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 20 proven. 30 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-09 07:18:13,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:18:13,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209935489] [2025-03-09 07:18:13,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209935489] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 07:18:13,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016296513] [2025-03-09 07:18:13,593 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-09 07:18:13,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 07:18:13,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:13,595 INFO L229 MonitoredProcess]: Starting monitored process 225 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 07:18:13,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (225)] Waiting until timeout for monitored process [2025-03-09 07:18:13,700 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 43 statements into 2 equivalence classes. [2025-03-09 07:18:13,725 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 42 of 43 statements. [2025-03-09 07:18:13,725 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-09 07:18:13,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:18:13,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-09 07:18:13,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:18:13,813 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 30 proven. 20 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-09 07:18:13,813 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 07:18:13,887 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 30 proven. 20 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-09 07:18:13,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016296513] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 07:18:13,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 07:18:13,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2025-03-09 07:18:13,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147412633] [2025-03-09 07:18:13,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 07:18:13,888 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 07:18:13,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:18:13,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1378, now seen corresponding path program 5 times [2025-03-09 07:18:13,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:18:13,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798448606] [2025-03-09 07:18:13,888 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-09 07:18:13,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:18:13,891 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:18:13,892 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:18:13,892 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 07:18:13,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:18:13,892 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:18:13,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:18:13,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:18:13,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:13,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:18:13,898 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:18:13,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:18:13,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-09 07:18:13,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2025-03-09 07:18:13,962 INFO L87 Difference]: Start difference. First operand 89 states and 108 transitions. cyclomatic complexity: 30 Second operand has 20 states, 20 states have (on average 2.6) internal successors, (52), 20 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:14,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:18:14,055 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions. [2025-03-09 07:18:14,056 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 100 transitions. [2025-03-09 07:18:14,056 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-09 07:18:14,057 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 83 states and 98 transitions. [2025-03-09 07:18:14,057 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2025-03-09 07:18:14,057 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2025-03-09 07:18:14,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 98 transitions. [2025-03-09 07:18:14,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-03-09 07:18:14,057 INFO L218 hiAutomatonCegarLoop]: Abstraction has 83 states and 98 transitions. [2025-03-09 07:18:14,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 98 transitions. [2025-03-09 07:18:14,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2025-03-09 07:18:14,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 81 states have (on average 1.1851851851851851) internal successors, (96), 80 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:14,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 96 transitions. [2025-03-09 07:18:14,058 INFO L240 hiAutomatonCegarLoop]: Abstraction has 81 states and 96 transitions. [2025-03-09 07:18:14,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-09 07:18:14,059 INFO L432 stractBuchiCegarLoop]: Abstraction has 81 states and 96 transitions. [2025-03-09 07:18:14,059 INFO L338 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2025-03-09 07:18:14,059 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 81 states and 96 transitions. [2025-03-09 07:18:14,059 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2025-03-09 07:18:14,059 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-09 07:18:14,059 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-09 07:18:14,060 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 07:18:14,060 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-03-09 07:18:14,060 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~mem3#1, main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~post8#1, main_#t~mem9#1, main_#t~post10#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post13#1, main_#t~post14#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset, main_~#string_B~0#1.base, main_~#string_B~0#1.offset, main_~i~0#1, main_~j~0#1, main_~nc_A~0#1, main_~nc_B~0#1, main_~found~0#1;call main_~#string_A~0#1.base, main_~#string_A~0#1.offset := #Ultimate.allocOnStack(5);call main_~#string_B~0#1.base, main_~#string_B~0#1.offset := #Ultimate.allocOnStack(5);havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~nc_A~0#1;havoc main_~nc_B~0#1;main_~found~0#1 := 0;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet1#1;call write~int#2(main_#t~nondet1#1, main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1);" "assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 5;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < 5);call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1);" "assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume 0 != main_#t~mem7#1;havoc main_#t~mem7#1;main_#t~post8#1 := main_~nc_A~0#1;main_~nc_A~0#1 := 1 + main_#t~post8#1;" "assume true;call main_#t~mem7#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~nc_A~0#1, 1);" "assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1;" "main_~nc_B~0#1 := 0;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume 0 != main_#t~mem9#1;havoc main_#t~mem9#1;main_#t~post10#1 := main_~nc_B~0#1;main_~nc_B~0#1 := 1 + main_#t~post10#1;" "assume true;call main_#t~mem9#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~nc_B~0#1, 1);" "assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1;" "assume !!(main_~nc_B~0#1 >= main_~nc_A~0#1);main_~j~0#1 := 0;main_~i~0#1 := main_~j~0#1;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume !(main_#t~mem11#1 == main_#t~mem12#1);havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_~i~0#1 := 1 + (main_~i~0#1 - main_~j~0#1);main_~j~0#1 := 0;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume !(main_#t~mem11#1 == main_#t~mem12#1);havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_~i~0#1 := 1 + (main_~i~0#1 - main_~j~0#1);main_~j~0#1 := 0;" "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume main_#t~mem11#1 == main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;main_#t~post14#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" [2025-03-09 07:18:14,060 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < main_~nc_A~0#1 && main_~j~0#1 < main_~nc_B~0#1;call main_#t~mem11#1 := read~int#2(main_~#string_A~0#1.base, main_~#string_A~0#1.offset + main_~i~0#1, 1);call main_#t~mem12#1 := read~int#1(main_~#string_B~0#1.base, main_~#string_B~0#1.offset + main_~j~0#1, 1);" "assume main_#t~mem11#1 == main_#t~mem12#1;havoc main_#t~mem11#1;havoc main_#t~mem12#1;main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1;main_#t~post14#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post14#1;havoc main_#t~post14#1;" [2025-03-09 07:18:14,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:18:14,060 INFO L85 PathProgramCache]: Analyzing trace with hash -2105799569, now seen corresponding path program 8 times [2025-03-09 07:18:14,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:18:14,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606070089] [2025-03-09 07:18:14,060 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:18:14,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:18:14,068 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-03-09 07:18:14,073 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-03-09 07:18:14,073 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 07:18:14,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:18:14,270 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-09 07:18:14,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 07:18:14,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606070089] [2025-03-09 07:18:14,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606070089] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 07:18:14,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025031283] [2025-03-09 07:18:14,271 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 07:18:14,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 07:18:14,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 07:18:14,273 INFO L229 MonitoredProcess]: Starting monitored process 226 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 07:18:14,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (226)] Waiting until timeout for monitored process [2025-03-09 07:18:14,384 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-03-09 07:18:14,415 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-03-09 07:18:14,415 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 07:18:14,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 07:18:14,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-09 07:18:14,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 07:18:14,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-03-09 07:18:14,596 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-09 07:18:14,597 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 07:18:14,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1025031283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 07:18:14,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 07:18:14,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 16 [2025-03-09 07:18:14,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960967326] [2025-03-09 07:18:14,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 07:18:14,598 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-03-09 07:18:14,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 07:18:14,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1407, now seen corresponding path program 12 times [2025-03-09 07:18:14,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 07:18:14,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501858025] [2025-03-09 07:18:14,599 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-09 07:18:14,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 07:18:14,602 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:18:14,602 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:18:14,602 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-09 07:18:14,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:18:14,603 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 07:18:14,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-09 07:18:14,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-09 07:18:14,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 07:18:14,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 07:18:14,605 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 07:18:14,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 07:18:14,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 07:18:14,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2025-03-09 07:18:14,663 INFO L87 Difference]: Start difference. First operand 81 states and 96 transitions. cyclomatic complexity: 25 Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 07:18:14,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 07:18:14,697 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2025-03-09 07:18:14,697 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 53 transitions. [2025-03-09 07:18:14,697 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-09 07:18:14,697 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 0 states and 0 transitions. [2025-03-09 07:18:14,697 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-03-09 07:18:14,698 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-03-09 07:18:14,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-03-09 07:18:14,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-09 07:18:14,698 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 07:18:14,698 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 07:18:14,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 07:18:14,699 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 07:18:14,700 INFO L338 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2025-03-09 07:18:14,701 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-03-09 07:18:14,701 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-03-09 07:18:14,701 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-03-09 07:18:14,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.03 07:18:14 BoogieIcfgContainer [2025-03-09 07:18:14,709 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-09 07:18:14,709 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 07:18:14,709 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 07:18:14,710 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 07:18:14,710 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 07:17:00" (3/4) ... [2025-03-09 07:18:14,711 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-09 07:18:14,712 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 07:18:14,712 INFO L158 Benchmark]: Toolchain (without parser) took 74201.04ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 129.3MB in the beginning and 115.7MB in the end (delta: 13.6MB). Peak memory consumption was 139.8MB. Max. memory is 16.1GB. [2025-03-09 07:18:14,713 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 07:18:14,713 INFO L158 Benchmark]: CACSL2BoogieTranslator took 155.08ms. Allocated memory is still 167.8MB. Free memory was 128.9MB in the beginning and 117.8MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 07:18:14,713 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.41ms. Allocated memory is still 167.8MB. Free memory was 117.8MB in the beginning and 116.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 07:18:14,714 INFO L158 Benchmark]: Boogie Preprocessor took 24.92ms. Allocated memory is still 167.8MB. Free memory was 116.5MB in the beginning and 114.9MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 07:18:14,714 INFO L158 Benchmark]: IcfgBuilder took 278.44ms. Allocated memory is still 167.8MB. Free memory was 114.9MB in the beginning and 100.8MB in the end (delta: 14.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 07:18:14,714 INFO L158 Benchmark]: BuchiAutomizer took 73708.07ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 100.8MB in the beginning and 115.8MB in the end (delta: -15.0MB). Peak memory consumption was 114.6MB. Max. memory is 16.1GB. [2025-03-09 07:18:14,715 INFO L158 Benchmark]: Witness Printer took 2.91ms. Allocated memory is still 293.6MB. Free memory was 115.8MB in the beginning and 115.7MB in the end (delta: 92.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 07:18:14,715 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.14ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 155.08ms. Allocated memory is still 167.8MB. Free memory was 128.9MB in the beginning and 117.8MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.41ms. Allocated memory is still 167.8MB. Free memory was 117.8MB in the beginning and 116.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.92ms. Allocated memory is still 167.8MB. Free memory was 116.5MB in the beginning and 114.9MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 278.44ms. Allocated memory is still 167.8MB. Free memory was 114.9MB in the beginning and 100.8MB in the end (delta: 14.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 73708.07ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 100.8MB in the beginning and 115.8MB in the end (delta: -15.0MB). Peak memory consumption was 114.6MB. Max. memory is 16.1GB. * Witness Printer took 2.91ms. Allocated memory is still 293.6MB. Free memory was 115.8MB in the beginning and 115.7MB in the end (delta: 92.3kB). 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: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - 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: ~#string_B~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: ~#string_A~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: #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 24 terminating modules (13 trivial, 9 deterministic, 2 nondeterministic). One deterministic module has affine ranking function null and consists of 2 locations. One deterministic module has affine ranking function null and consists of 4 locations. One deterministic module has affine ranking function null and consists of 3 locations. One deterministic module has affine ranking function (((long long) -1 * j) + nc_B) and consists of 3 locations. One deterministic module has affine ranking function null and consists of 3 locations. One deterministic module has affine ranking function null and consists of 8 locations. One deterministic module has affine ranking function ((((long long) -2 * i) + ((long long) 2 * j)) + 3) and consists of 9 locations. One deterministic module has affine ranking function (((long long) -2 * i) + 5) and consists of 10 locations. One deterministic module has affine ranking function null and consists of 10 locations. One nondeterministic module has affine ranking function (((long long) -2 * i) + 5) and consists of 8 locations. One nondeterministic module has affine ranking function (((long long) -2 * j) + 7) and consists of 9 locations. 13 modules have a trivial ranking function, the largest among these consists of 20 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 73.6s and 25 iterations. TraceHistogramMax:6. Analysis of lassos took 69.9s. Construction of modules took 0.6s. Büchi inclusion checks took 2.9s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 18. Automata minimization 0.0s AutomataMinimizationTime, 23 MinimizatonAttempts, 110 StatesRemovedByMinimization, 18 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 [9, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 631 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 627 mSDsluCounter, 1306 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 928 mSDsCounter, 183 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1354 IncrementalHoareTripleChecker+Invalid, 1537 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 183 mSolverCounterUnsat, 378 mSDtfsCounter, 1354 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc4 concLT0 SILN0 SILU9 SILI0 SILT0 lasso11 LassoPreprocessingBenchmarks: Lassos: inital342 mio100 ax100 hnf100 lsp94 ukn49 mio100 lsp25 div100 bol100 ite100 ukn100 eq176 hnf92 smp100 dnf801 smp84 tf100 neg100 sie115 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 78ms VariablesStem: 6 VariablesLoop: 2 DisjunctsStem: 36 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 76 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-03-09 07:18:14,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (226)] Ended with exit code 0 [2025-03-09 07:18:14,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (225)] Forceful destruction successful, exit code 0 [2025-03-09 07:18:15,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (162)] Forceful destruction successful, exit code 0 [2025-03-09 07:18:15,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Forceful destruction successful, exit code 0 [2025-03-09 07:18:15,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (124)] Forceful destruction successful, exit code 0 [2025-03-09 07:18:15,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Forceful destruction successful, exit code 0 [2025-03-09 07:18:15,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Ended with exit code 0 [2025-03-09 07:18:16,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Forceful destruction successful, exit code 0 [2025-03-09 07:18:16,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2025-03-09 07:18:16,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-03-09 07:18:16,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2025-03-09 07:18:16,936 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