./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 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 08:32:05,370 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 08:32:05,407 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-17 08:32:05,411 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 08:32:05,412 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 08:32:05,412 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-17 08:32:05,432 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 08:32:05,433 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 08:32:05,433 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 08:32:05,434 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 08:32:05,434 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 08:32:05,435 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 08:32:05,435 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 08:32:05,436 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 08:32:05,436 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-17 08:32:05,436 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-17 08:32:05,436 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-17 08:32:05,437 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-17 08:32:05,437 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-17 08:32:05,437 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-17 08:32:05,438 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 08:32:05,442 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-17 08:32:05,442 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 08:32:05,443 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 08:32:05,443 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 08:32:05,443 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 08:32:05,443 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-17 08:32:05,443 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-17 08:32:05,444 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-17 08:32:05,444 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 08:32:05,444 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 08:32:05,444 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 08:32:05,444 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 08:32:05,445 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-17 08:32:05,445 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 08:32:05,445 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 08:32:05,445 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 08:32:05,446 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 08:32:05,446 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 08:32:05,446 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-17 08:32:05,446 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 [2024-11-17 08:32:05,634 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 08:32:05,660 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 08:32:05,663 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 08:32:05,664 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 08:32:05,664 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 08:32:05,665 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/string-1.i [2024-11-17 08:32:07,137 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 08:32:07,276 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 08:32:07,276 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/string-1.i [2024-11-17 08:32:07,288 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f36bb814/6da80134fc184c6d90ca2fa5b4394135/FLAG9cff9877b [2024-11-17 08:32:07,303 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f36bb814/6da80134fc184c6d90ca2fa5b4394135 [2024-11-17 08:32:07,306 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 08:32:07,309 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 08:32:07,310 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 08:32:07,310 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 08:32:07,315 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 08:32:07,316 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:32:07" (1/1) ... [2024-11-17 08:32:07,317 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77931158 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:32:07, skipping insertion in model container [2024-11-17 08:32:07,317 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:32:07" (1/1) ... [2024-11-17 08:32:07,336 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 08:32:07,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:32:07,493 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 08:32:07,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:32:07,560 INFO L204 MainTranslator]: Completed translation [2024-11-17 08:32:07,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:32:07 WrapperNode [2024-11-17 08:32:07,561 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 08:32:07,561 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 08:32:07,562 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 08:32:07,562 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 08:32:07,582 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:32:07" (1/1) ... [2024-11-17 08:32:07,588 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:32:07" (1/1) ... [2024-11-17 08:32:07,602 INFO L138 Inliner]: procedures = 17, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 118 [2024-11-17 08:32:07,603 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 08:32:07,603 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 08:32:07,603 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 08:32:07,604 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 08:32:07,615 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:32:07" (1/1) ... [2024-11-17 08:32:07,615 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:32:07" (1/1) ... [2024-11-17 08:32:07,622 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:32:07" (1/1) ... [2024-11-17 08:32:07,652 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]. [2024-11-17 08:32:07,652 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:32:07" (1/1) ... [2024-11-17 08:32:07,652 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:32:07" (1/1) ... [2024-11-17 08:32:07,665 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:32:07" (1/1) ... [2024-11-17 08:32:07,665 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:32:07" (1/1) ... [2024-11-17 08:32:07,666 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:32:07" (1/1) ... [2024-11-17 08:32:07,667 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:32:07" (1/1) ... [2024-11-17 08:32:07,678 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 08:32:07,679 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 08:32:07,679 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 08:32:07,679 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 08:32:07,680 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:32:07" (1/1) ... [2024-11-17 08:32:07,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:07,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:07,718 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) [2024-11-17 08:32:07,725 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 [2024-11-17 08:32:07,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 08:32:07,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 08:32:07,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-17 08:32:07,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-17 08:32:07,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-17 08:32:07,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 08:32:07,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-17 08:32:07,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-17 08:32:07,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 08:32:07,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 08:32:07,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 08:32:07,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-17 08:32:07,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-17 08:32:07,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 08:32:07,833 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 08:32:07,835 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 08:32:07,988 INFO L1250 $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; [2024-11-17 08:32:07,999 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-17 08:32:08,003 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 08:32:08,022 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 08:32:08,023 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 08:32:08,023 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:32:08 BoogieIcfgContainer [2024-11-17 08:32:08,023 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 08:32:08,024 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-17 08:32:08,024 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-17 08:32:08,031 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-17 08:32:08,032 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:32:08,032 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.11 08:32:07" (1/3) ... [2024-11-17 08:32:08,033 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@617dd923 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:32:08, skipping insertion in model container [2024-11-17 08:32:08,033 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:32:08,033 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:32:07" (2/3) ... [2024-11-17 08:32:08,033 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@617dd923 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:32:08, skipping insertion in model container [2024-11-17 08:32:08,033 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:32:08,033 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:32:08" (3/3) ... [2024-11-17 08:32:08,034 INFO L332 chiAutomizerObserver]: Analyzing ICFG string-1.i [2024-11-17 08:32:08,073 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-17 08:32:08,073 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-17 08:32:08,073 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-17 08:32:08,073 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-17 08:32:08,073 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-17 08:32:08,073 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-17 08:32:08,074 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-17 08:32:08,074 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-17 08:32:08,077 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 28 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 27 states have internal predecessors, (43), 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) [2024-11-17 08:32:08,093 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 11 [2024-11-17 08:32:08,093 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:32:08,093 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:32:08,098 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:32:08,098 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:32:08,098 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-17 08:32:08,099 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 28 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 27 states have internal predecessors, (43), 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) [2024-11-17 08:32:08,100 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 11 [2024-11-17 08:32:08,100 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:32:08,100 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:32:08,100 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:32:08,100 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:32:08,104 INFO L745 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue 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); 24#ULTIMATE.init_returnLabel#1true assume true;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; 17#L33true [2024-11-17 08:32:08,105 INFO L747 eck$LassoCheckResult]: Loop: 17#L33true assume true; 16#L33-1true 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; 17#L33true [2024-11-17 08:32:08,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:08,109 INFO L85 PathProgramCache]: Analyzing trace with hash 2976, now seen corresponding path program 1 times [2024-11-17 08:32:08,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:32:08,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725761144] [2024-11-17 08:32:08,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:32:08,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:32:08,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:08,193 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:32:08,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:08,214 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:32:08,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:08,217 INFO L85 PathProgramCache]: Analyzing trace with hash 2880, now seen corresponding path program 1 times [2024-11-17 08:32:08,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:32:08,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643002879] [2024-11-17 08:32:08,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:32:08,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:32:08,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:08,227 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:32:08,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:08,234 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:32:08,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:08,236 INFO L85 PathProgramCache]: Analyzing trace with hash 2861855, now seen corresponding path program 1 times [2024-11-17 08:32:08,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:32:08,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284060248] [2024-11-17 08:32:08,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:32:08,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:32:08,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:08,274 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:32:08,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:08,299 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:32:08,766 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:32:08,766 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:32:08,767 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:32:08,767 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:32:08,767 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:32:08,768 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:08,768 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:32:08,768 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:32:08,768 INFO L132 ssoRankerPreferences]: Filename of dumped script: string-1.i_Iteration1_Lasso [2024-11-17 08:32:08,768 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:32:08,768 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:32:08,783 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:08,790 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:08,793 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:08,795 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:08,800 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:08,802 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:08,817 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:08,819 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:08,821 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:08,824 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:08,827 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:08,830 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:08,832 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:08,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:08,837 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:08,839 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:08,842 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:08,845 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:08,847 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:08,849 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:09,045 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:09,227 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:32:09,230 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:32:09,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:09,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:09,234 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) [2024-11-17 08:32:09,238 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 [2024-11-17 08:32:09,240 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:09,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:09,253 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:09,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:09,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:09,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:09,255 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:09,255 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:09,260 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:09,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-11-17 08:32:09,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:09,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:09,277 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) [2024-11-17 08:32:09,282 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:09,286 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 [2024-11-17 08:32:09,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:09,294 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:09,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:09,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:09,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:09,295 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:09,295 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:09,296 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:09,308 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 [2024-11-17 08:32:09,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:09,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:09,310 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) [2024-11-17 08:32:09,311 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 [2024-11-17 08:32:09,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 [2024-11-17 08:32:09,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:09,323 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:09,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:09,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:09,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:09,324 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:09,324 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:09,325 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:09,339 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 [2024-11-17 08:32:09,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:09,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:09,341 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) [2024-11-17 08:32:09,342 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 [2024-11-17 08:32:09,343 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:09,353 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:09,353 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:09,353 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:09,353 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:09,355 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:32:09,356 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:09,358 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:09,368 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 [2024-11-17 08:32:09,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:09,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:09,370 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) [2024-11-17 08:32:09,371 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 [2024-11-17 08:32:09,372 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:09,381 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:09,381 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:09,382 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:09,382 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:09,382 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:09,382 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:09,382 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:09,383 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:09,394 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 [2024-11-17 08:32:09,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:09,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:09,396 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) [2024-11-17 08:32:09,397 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 [2024-11-17 08:32:09,398 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:09,407 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:09,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:09,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:09,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:09,410 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:32:09,410 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:09,412 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:09,423 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 [2024-11-17 08:32:09,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:09,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:09,425 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) [2024-11-17 08:32:09,426 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 [2024-11-17 08:32:09,428 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:09,439 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:09,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:09,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:09,440 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:09,442 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:32:09,442 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:09,445 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:09,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-17 08:32:09,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:09,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:09,461 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:32:09,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-17 08:32:09,463 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:09,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:09,473 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:09,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:09,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:09,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:09,474 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:09,474 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:09,476 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:09,487 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 [2024-11-17 08:32:09,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:09,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:09,489 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) [2024-11-17 08:32:09,490 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 [2024-11-17 08:32:09,491 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:09,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:09,501 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:09,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:09,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:09,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:09,501 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:09,501 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:09,503 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:09,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-17 08:32:09,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:09,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:09,519 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) [2024-11-17 08:32:09,520 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 [2024-11-17 08:32:09,521 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:09,531 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:09,531 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:09,531 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:09,531 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:09,531 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:09,532 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:09,532 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:09,533 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:09,546 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 [2024-11-17 08:32:09,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:09,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:09,547 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) [2024-11-17 08:32:09,548 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 [2024-11-17 08:32:09,550 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:09,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:09,560 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:09,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:09,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:09,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:09,560 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:09,560 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:09,561 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:09,572 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 [2024-11-17 08:32:09,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:09,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:09,573 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) [2024-11-17 08:32:09,577 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 [2024-11-17 08:32:09,578 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:09,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:09,588 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:09,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:09,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:09,588 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:09,589 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:09,589 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:09,590 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:09,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-11-17 08:32:09,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:09,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:09,602 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) [2024-11-17 08:32:09,605 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 [2024-11-17 08:32:09,610 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:09,627 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:09,627 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:09,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:09,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:09,627 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:09,628 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:09,628 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:09,633 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:09,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-11-17 08:32:09,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:09,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:09,654 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) [2024-11-17 08:32:09,655 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 [2024-11-17 08:32:09,656 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:09,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:09,666 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:09,666 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:09,666 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:09,666 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:09,666 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:09,666 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:09,668 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:09,678 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 [2024-11-17 08:32:09,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:09,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:09,680 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) [2024-11-17 08:32:09,682 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 [2024-11-17 08:32:09,682 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:09,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:09,693 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:09,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:09,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:09,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:09,693 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:09,693 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:09,694 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:09,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-11-17 08:32:09,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:09,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:09,706 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) [2024-11-17 08:32:09,707 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 [2024-11-17 08:32:09,708 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:09,718 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:09,719 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:09,719 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:09,719 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:09,719 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:09,720 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:09,720 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:09,724 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:09,739 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 [2024-11-17 08:32:09,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:09,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:09,741 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) [2024-11-17 08:32:09,742 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 [2024-11-17 08:32:09,743 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:09,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:09,755 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:09,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:09,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:09,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:09,756 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:09,756 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:09,764 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:09,774 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 [2024-11-17 08:32:09,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:09,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:09,776 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) [2024-11-17 08:32:09,777 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 [2024-11-17 08:32:09,778 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:09,789 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:09,789 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:09,789 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:09,789 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:09,789 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:09,789 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:09,790 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:09,791 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:09,801 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 [2024-11-17 08:32:09,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:09,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:09,802 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) [2024-11-17 08:32:09,804 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 [2024-11-17 08:32:09,806 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:09,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:09,816 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:09,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:09,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:09,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:09,817 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:09,817 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:09,818 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:09,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-11-17 08:32:09,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:09,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:09,830 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) [2024-11-17 08:32:09,833 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 [2024-11-17 08:32:09,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:09,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:09,844 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:09,844 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:09,844 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:09,844 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:09,845 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:09,845 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:09,846 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:09,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2024-11-17 08:32:09,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:09,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:09,858 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) [2024-11-17 08:32:09,859 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 [2024-11-17 08:32:09,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 [2024-11-17 08:32:09,870 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:09,870 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:09,871 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:09,871 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:09,872 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:32:09,872 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:09,875 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:09,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-11-17 08:32:09,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:09,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:09,889 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) [2024-11-17 08:32:09,890 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 [2024-11-17 08:32:09,891 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:09,901 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:09,901 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:09,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:09,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:09,905 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:32:09,905 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:09,910 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:32:09,922 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-11-17 08:32:09,923 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-11-17 08:32:09,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:09,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:09,925 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) [2024-11-17 08:32:09,926 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 [2024-11-17 08:32:09,927 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:32:09,938 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-17 08:32:09,939 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:32:09,939 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 [] [2024-11-17 08:32:09,950 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 [2024-11-17 08:32:09,973 INFO L156 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2024-11-17 08:32:09,981 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-17 08:32:09,981 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-17 08:32:09,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:10,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:32:10,008 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:32:10,008 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:32:10,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:32:10,029 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 08:32:10,030 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:32:10,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:32:10,057 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 [2024-11-17 08:32:10,058 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 28 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 27 states have internal predecessors, (43), 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 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) [2024-11-17 08:32:10,082 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 28 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 27 states have internal predecessors, (43), 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 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) Result 54 states and 84 transitions. Complement of second has 6 states. [2024-11-17 08:32:10,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-17 08:32:10,087 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2024-11-17 08:32:10,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2024-11-17 08:32:10,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 42 transitions. Stem has 2 letters. Loop has 2 letters. [2024-11-17 08:32:10,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:32:10,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 42 transitions. Stem has 4 letters. Loop has 2 letters. [2024-11-17 08:32:10,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:32:10,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 42 transitions. Stem has 2 letters. Loop has 4 letters. [2024-11-17 08:32:10,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:32:10,090 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 84 transitions. [2024-11-17 08:32:10,091 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 9 [2024-11-17 08:32:10,094 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 21 states and 30 transitions. [2024-11-17 08:32:10,094 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2024-11-17 08:32:10,094 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-11-17 08:32:10,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 30 transitions. [2024-11-17 08:32:10,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:32:10,095 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 30 transitions. [2024-11-17 08:32:10,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 30 transitions. [2024-11-17 08:32:10,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-17 08:32:10,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 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) [2024-11-17 08:32:10,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2024-11-17 08:32:10,112 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 30 transitions. [2024-11-17 08:32:10,112 INFO L425 stractBuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2024-11-17 08:32:10,112 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-17 08:32:10,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2024-11-17 08:32:10,113 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 9 [2024-11-17 08:32:10,113 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:32:10,113 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:32:10,113 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-17 08:32:10,113 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:32:10,113 INFO L745 eck$LassoCheckResult]: Stem: 152#ULTIMATE.startENTRY 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); 153#ULTIMATE.init_returnLabel#1 assume true;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; 161#L33 assume true; 157#L33-1 assume !(main_~i~0#1 < 5); 158#L35-2 call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1); 168#L35-1 assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0; 163#L37 [2024-11-17 08:32:10,114 INFO L747 eck$LassoCheckResult]: Loop: 163#L37 assume true; 164#L37-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; 163#L37 [2024-11-17 08:32:10,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:10,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1544724804, now seen corresponding path program 1 times [2024-11-17 08:32:10,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:32:10,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181559586] [2024-11-17 08:32:10,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:32:10,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:32:10,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:32:10,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:32:10,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:32:10,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181559586] [2024-11-17 08:32:10,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181559586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:32:10,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:32:10,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 08:32:10,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873935271] [2024-11-17 08:32:10,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:32:10,163 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:32:10,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:10,164 INFO L85 PathProgramCache]: Analyzing trace with hash 2496, now seen corresponding path program 1 times [2024-11-17 08:32:10,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:32:10,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156039140] [2024-11-17 08:32:10,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:32:10,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:32:10,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:10,168 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:32:10,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:10,184 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:32:10,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-11-17 08:32:10,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:32:10,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 08:32:10,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 08:32:10,238 INFO L87 Difference]: Start difference. First operand 21 states and 30 transitions. cyclomatic complexity: 14 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2024-11-17 08:32:10,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:32:10,257 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2024-11-17 08:32:10,257 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 34 transitions. [2024-11-17 08:32:10,258 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 9 [2024-11-17 08:32:10,259 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 27 states and 33 transitions. [2024-11-17 08:32:10,259 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2024-11-17 08:32:10,259 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-11-17 08:32:10,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 33 transitions. [2024-11-17 08:32:10,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:32:10,260 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 33 transitions. [2024-11-17 08:32:10,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 33 transitions. [2024-11-17 08:32:10,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2024-11-17 08:32:10,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 22 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) [2024-11-17 08:32:10,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2024-11-17 08:32:10,262 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 28 transitions. [2024-11-17 08:32:10,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 08:32:10,263 INFO L425 stractBuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2024-11-17 08:32:10,263 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-17 08:32:10,263 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. [2024-11-17 08:32:10,263 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 9 [2024-11-17 08:32:10,263 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:32:10,264 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:32:10,264 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:32:10,264 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:32:10,264 INFO L745 eck$LassoCheckResult]: Stem: 207#ULTIMATE.startENTRY 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); 208#ULTIMATE.init_returnLabel#1 assume true;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; 216#L33 assume true; 214#L33-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; 215#L33 assume true; 212#L33-1 assume !(main_~i~0#1 < 5); 213#L35-2 call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1); 223#L35-1 assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0; 218#L37 assume true; 219#L37-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; 220#L37 [2024-11-17 08:32:10,264 INFO L747 eck$LassoCheckResult]: Loop: 220#L37 assume true; 226#L37-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; 220#L37 [2024-11-17 08:32:10,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:10,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1895798278, now seen corresponding path program 1 times [2024-11-17 08:32:10,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:32:10,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708976279] [2024-11-17 08:32:10,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:32:10,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:32:10,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:32:10,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:32:10,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:32:10,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708976279] [2024-11-17 08:32:10,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708976279] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:32:10,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119137301] [2024-11-17 08:32:10,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:32:10,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:32:10,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:10,328 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) [2024-11-17 08:32:10,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-11-17 08:32:10,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:32:10,370 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 08:32:10,370 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:32:10,384 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:32:10,384 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:32:10,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:32:10,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119137301] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:32:10,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:32:10,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-17 08:32:10,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759717187] [2024-11-17 08:32:10,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:32:10,400 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:32:10,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:10,401 INFO L85 PathProgramCache]: Analyzing trace with hash 2496, now seen corresponding path program 2 times [2024-11-17 08:32:10,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:32:10,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736373613] [2024-11-17 08:32:10,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:32:10,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:32:10,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:10,405 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:32:10,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:10,408 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:32:10,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:32:10,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 08:32:10,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-17 08:32:10,447 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. cyclomatic complexity: 10 Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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) [2024-11-17 08:32:10,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:32:10,502 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2024-11-17 08:32:10,502 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 60 transitions. [2024-11-17 08:32:10,503 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 9 [2024-11-17 08:32:10,504 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 48 states and 57 transitions. [2024-11-17 08:32:10,504 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2024-11-17 08:32:10,504 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2024-11-17 08:32:10,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 57 transitions. [2024-11-17 08:32:10,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:32:10,504 INFO L218 hiAutomatonCegarLoop]: Abstraction has 48 states and 57 transitions. [2024-11-17 08:32:10,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 57 transitions. [2024-11-17 08:32:10,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 35. [2024-11-17 08:32:10,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 34 states have internal predecessors, (40), 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) [2024-11-17 08:32:10,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2024-11-17 08:32:10,507 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35 states and 40 transitions. [2024-11-17 08:32:10,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 08:32:10,508 INFO L425 stractBuchiCegarLoop]: Abstraction has 35 states and 40 transitions. [2024-11-17 08:32:10,509 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-17 08:32:10,509 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 40 transitions. [2024-11-17 08:32:10,509 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 9 [2024-11-17 08:32:10,509 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:32:10,509 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:32:10,510 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 1, 1, 1, 1, 1] [2024-11-17 08:32:10,510 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:32:10,510 INFO L745 eck$LassoCheckResult]: Stem: 345#ULTIMATE.startENTRY 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); 346#ULTIMATE.init_returnLabel#1 assume true;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; 354#L33 assume true; 352#L33-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; 353#L33 assume true; 355#L33-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; 376#L33 assume true; 375#L33-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; 374#L33 assume true; 366#L33-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; 365#L33 assume true; 350#L33-1 assume !(main_~i~0#1 < 5); 351#L35-2 call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1); 362#L35-1 assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0; 357#L37 assume true; 358#L37-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; 359#L37 assume true; 373#L37-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; 372#L37 assume true; 371#L37-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; 370#L37 assume true; 369#L37-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; 368#L37 [2024-11-17 08:32:10,510 INFO L747 eck$LassoCheckResult]: Loop: 368#L37 assume true; 367#L37-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; 368#L37 [2024-11-17 08:32:10,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:10,511 INFO L85 PathProgramCache]: Analyzing trace with hash -2089340492, now seen corresponding path program 2 times [2024-11-17 08:32:10,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:32:10,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940900538] [2024-11-17 08:32:10,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:32:10,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:32:10,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:32:10,622 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-17 08:32:10,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:32:10,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940900538] [2024-11-17 08:32:10,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940900538] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:32:10,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150887723] [2024-11-17 08:32:10,623 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 08:32:10,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:32:10,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:10,625 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) [2024-11-17 08:32:10,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-11-17 08:32:10,683 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 08:32:10,684 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:32:10,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 08:32:10,686 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:32:10,712 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-17 08:32:10,712 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:32:10,755 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-17 08:32:10,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150887723] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:32:10,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:32:10,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2024-11-17 08:32:10,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559226865] [2024-11-17 08:32:10,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:32:10,756 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:32:10,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:10,756 INFO L85 PathProgramCache]: Analyzing trace with hash 2496, now seen corresponding path program 3 times [2024-11-17 08:32:10,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:32:10,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948613859] [2024-11-17 08:32:10,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:32:10,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:32:10,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:10,761 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:32:10,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:10,763 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:32:10,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:32:10,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 08:32:10,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-17 08:32:10,798 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. cyclomatic complexity: 10 Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:32:10,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:32:10,844 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2024-11-17 08:32:10,844 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 66 transitions. [2024-11-17 08:32:10,845 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 9 [2024-11-17 08:32:10,846 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 55 states and 65 transitions. [2024-11-17 08:32:10,846 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2024-11-17 08:32:10,846 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2024-11-17 08:32:10,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 65 transitions. [2024-11-17 08:32:10,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:32:10,847 INFO L218 hiAutomatonCegarLoop]: Abstraction has 55 states and 65 transitions. [2024-11-17 08:32:10,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 65 transitions. [2024-11-17 08:32:10,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 39. [2024-11-17 08:32:10,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 38 states have internal predecessors, (44), 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) [2024-11-17 08:32:10,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2024-11-17 08:32:10,849 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 44 transitions. [2024-11-17 08:32:10,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 08:32:10,850 INFO L425 stractBuchiCegarLoop]: Abstraction has 39 states and 44 transitions. [2024-11-17 08:32:10,850 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-17 08:32:10,850 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 44 transitions. [2024-11-17 08:32:10,851 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 9 [2024-11-17 08:32:10,851 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:32:10,851 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:32:10,851 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 5, 5, 1, 1, 1, 1, 1] [2024-11-17 08:32:10,851 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:32:10,852 INFO L745 eck$LassoCheckResult]: Stem: 573#ULTIMATE.startENTRY 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); 574#ULTIMATE.init_returnLabel#1 assume true;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; 582#L33 assume true; 580#L33-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; 581#L33 assume true; 583#L33-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; 608#L33 assume true; 607#L33-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; 606#L33 assume true; 605#L33-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; 604#L33 assume true; 594#L33-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; 593#L33 assume true; 578#L33-1 assume !(main_~i~0#1 < 5); 579#L35-2 call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1); 590#L35-1 assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0; 585#L37 assume true; 586#L37-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; 587#L37 assume true; 603#L37-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; 602#L37 assume true; 601#L37-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; 600#L37 assume true; 599#L37-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; 598#L37 assume true; 597#L37-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; 596#L37 [2024-11-17 08:32:10,852 INFO L747 eck$LassoCheckResult]: Loop: 596#L37 assume true; 595#L37-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; 596#L37 [2024-11-17 08:32:10,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:10,852 INFO L85 PathProgramCache]: Analyzing trace with hash -584646414, now seen corresponding path program 3 times [2024-11-17 08:32:10,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:32:10,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028474970] [2024-11-17 08:32:10,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:32:10,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:32:10,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:10,873 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:32:10,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:10,891 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:32:10,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:10,892 INFO L85 PathProgramCache]: Analyzing trace with hash 2496, now seen corresponding path program 4 times [2024-11-17 08:32:10,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:32:10,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971285000] [2024-11-17 08:32:10,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:32:10,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:32:10,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:10,896 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:32:10,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:10,898 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:32:10,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:10,899 INFO L85 PathProgramCache]: Analyzing trace with hash 795513457, now seen corresponding path program 4 times [2024-11-17 08:32:10,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:32:10,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701341378] [2024-11-17 08:32:10,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:32:10,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:32:10,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:32:11,024 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-17 08:32:11,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:32:11,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701341378] [2024-11-17 08:32:11,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701341378] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:32:11,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185009544] [2024-11-17 08:32:11,024 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-17 08:32:11,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:32:11,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:11,026 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) [2024-11-17 08:32:11,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-11-17 08:32:11,095 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-17 08:32:11,095 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:32:11,096 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-17 08:32:11,097 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:32:11,118 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-17 08:32:11,118 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 08:32:11,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185009544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:32:11,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 08:32:11,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2024-11-17 08:32:11,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47987582] [2024-11-17 08:32:11,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:32:11,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:32:11,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 08:32:11,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-11-17 08:32:11,198 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. cyclomatic complexity: 10 Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:32:11,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:32:11,301 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2024-11-17 08:32:11,301 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 67 transitions. [2024-11-17 08:32:11,302 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2024-11-17 08:32:11,302 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 57 states and 66 transitions. [2024-11-17 08:32:11,302 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2024-11-17 08:32:11,302 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2024-11-17 08:32:11,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 66 transitions. [2024-11-17 08:32:11,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:32:11,303 INFO L218 hiAutomatonCegarLoop]: Abstraction has 57 states and 66 transitions. [2024-11-17 08:32:11,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 66 transitions. [2024-11-17 08:32:11,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 39. [2024-11-17 08:32:11,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 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) [2024-11-17 08:32:11,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2024-11-17 08:32:11,308 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 42 transitions. [2024-11-17 08:32:11,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 08:32:11,310 INFO L425 stractBuchiCegarLoop]: Abstraction has 39 states and 42 transitions. [2024-11-17 08:32:11,310 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-17 08:32:11,310 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 42 transitions. [2024-11-17 08:32:11,311 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2024-11-17 08:32:11,311 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:32:11,311 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:32:11,311 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:32:11,312 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:32:11,313 INFO L745 eck$LassoCheckResult]: Stem: 765#ULTIMATE.startENTRY 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); 766#ULTIMATE.init_returnLabel#1 assume true;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; 772#L33 assume true; 770#L33-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; 771#L33 assume true; 797#L33-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; 795#L33 assume true; 793#L33-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; 791#L33 assume true; 789#L33-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; 787#L33 assume true; 785#L33-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; 784#L33 assume true; 783#L33-1 assume !(main_~i~0#1 < 5); 782#L35-2 call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1); 779#L35-1 assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0; 774#L37 assume true; 775#L37-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; 776#L37 assume true; 800#L37-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; 799#L37 assume true; 798#L37-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; 796#L37 assume true; 794#L37-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; 792#L37 assume true; 790#L37-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; 788#L37 assume true; 786#L37-1 assume !(main_~i~0#1 < 5); 780#L39-2 call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1); 773#L39-1 assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0; 764#L42 [2024-11-17 08:32:11,313 INFO L747 eck$LassoCheckResult]: Loop: 764#L42 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); 762#L42-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; 764#L42 [2024-11-17 08:32:11,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:11,313 INFO L85 PathProgramCache]: Analyzing trace with hash -15747058, now seen corresponding path program 1 times [2024-11-17 08:32:11,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:32:11,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658394021] [2024-11-17 08:32:11,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:32:11,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:32:11,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:11,334 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:32:11,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:11,345 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:32:11,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:11,345 INFO L85 PathProgramCache]: Analyzing trace with hash 2112, now seen corresponding path program 1 times [2024-11-17 08:32:11,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:32:11,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357315253] [2024-11-17 08:32:11,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:32:11,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:32:11,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:11,349 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:32:11,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:11,351 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:32:11,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:11,351 INFO L85 PathProgramCache]: Analyzing trace with hash 2046947597, now seen corresponding path program 1 times [2024-11-17 08:32:11,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:32:11,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465070867] [2024-11-17 08:32:11,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:32:11,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:32:11,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:11,365 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:32:11,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:11,375 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:32:14,245 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:32:14,245 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:32:14,245 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:32:14,245 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:32:14,245 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:32:14,245 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:14,245 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:32:14,245 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:32:14,245 INFO L132 ssoRankerPreferences]: Filename of dumped script: string-1.i_Iteration6_Lasso [2024-11-17 08:32:14,246 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:32:14,246 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:32:14,247 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:14,250 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:14,252 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:14,253 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:14,533 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:14,535 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:14,536 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:14,538 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:14,539 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:14,541 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:14,548 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:14,550 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:14,552 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:14,554 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:14,555 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:14,557 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:14,559 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:14,561 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:14,563 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:14,564 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:14,566 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:14,759 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:32:14,760 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:32:14,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:14,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:14,763 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) [2024-11-17 08:32:14,764 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 [2024-11-17 08:32:14,767 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:14,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:14,780 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:14,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:14,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:14,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:14,781 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:14,781 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:14,782 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:14,792 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 [2024-11-17 08:32:14,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:14,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:14,794 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) [2024-11-17 08:32:14,795 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 [2024-11-17 08:32:14,796 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:14,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:14,806 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:14,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:14,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:14,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:14,806 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:14,806 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:14,807 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:14,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2024-11-17 08:32:14,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:14,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:14,819 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) [2024-11-17 08:32:14,820 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 [2024-11-17 08:32:14,821 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:14,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:14,830 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:14,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:14,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:14,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:14,831 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:14,831 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:14,832 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:14,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2024-11-17 08:32:14,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:14,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:14,843 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) [2024-11-17 08:32:14,844 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 [2024-11-17 08:32:14,845 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:14,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:14,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:14,855 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:14,855 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:14,856 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:32:14,856 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:14,858 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:14,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-11-17 08:32:14,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:14,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:14,869 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) [2024-11-17 08:32:14,870 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 [2024-11-17 08:32:14,871 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:14,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:14,881 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:14,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:14,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:14,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:14,881 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:14,882 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:14,883 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:14,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2024-11-17 08:32:14,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:14,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:14,894 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) [2024-11-17 08:32:14,895 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 [2024-11-17 08:32:14,896 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:14,905 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:14,906 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:14,906 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:14,906 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:14,907 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:32:14,907 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:14,909 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:14,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2024-11-17 08:32:14,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:14,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:14,921 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) [2024-11-17 08:32:14,922 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 [2024-11-17 08:32:14,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 [2024-11-17 08:32:14,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:14,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:14,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:14,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:14,935 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:32:14,935 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:14,939 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:14,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2024-11-17 08:32:14,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:14,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:14,950 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) [2024-11-17 08:32:14,951 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 [2024-11-17 08:32:14,952 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:14,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:14,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:14,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:14,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:14,964 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:32:14,964 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:14,967 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:14,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2024-11-17 08:32:14,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:14,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:14,979 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) [2024-11-17 08:32:14,980 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 [2024-11-17 08:32:14,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 [2024-11-17 08:32:14,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:14,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:14,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:14,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:14,991 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:32:14,991 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:14,996 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:15,006 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 [2024-11-17 08:32:15,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:15,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:15,008 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) [2024-11-17 08:32:15,009 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 [2024-11-17 08:32:15,010 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:15,020 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:15,020 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:15,020 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:15,020 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:15,022 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:32:15,022 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:15,025 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:15,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2024-11-17 08:32:15,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:15,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:15,036 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) [2024-11-17 08:32:15,037 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 [2024-11-17 08:32:15,038 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:15,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:15,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:15,048 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-17 08:32:15,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:15,051 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2024-11-17 08:32:15,051 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-11-17 08:32:15,058 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:15,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2024-11-17 08:32:15,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:15,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:15,070 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) [2024-11-17 08:32:15,071 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 [2024-11-17 08:32:15,071 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:15,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:15,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:15,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:15,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:15,083 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:32:15,083 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:15,085 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:15,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2024-11-17 08:32:15,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:15,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:15,096 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) [2024-11-17 08:32:15,098 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 [2024-11-17 08:32:15,098 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:15,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:15,109 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:15,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:15,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:15,111 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:32:15,111 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:15,115 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:32:15,132 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2024-11-17 08:32:15,132 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2024-11-17 08:32:15,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:15,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:15,135 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) [2024-11-17 08:32:15,135 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 [2024-11-17 08:32:15,136 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:32:15,146 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-11-17 08:32:15,147 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:32:15,147 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] [2024-11-17 08:32:15,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2024-11-17 08:32:15,173 INFO L156 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2024-11-17 08:32:15,175 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-17 08:32:15,175 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-17 08:32:15,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:15,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:32:15,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 08:32:15,240 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:32:15,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:32:15,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 08:32:15,515 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:32:15,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:32:15,538 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 [2024-11-17 08:32:15,538 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 42 transitions. cyclomatic complexity: 6 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:32:15,582 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 42 transitions. cyclomatic complexity: 6. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 48 states and 55 transitions. Complement of second has 5 states. [2024-11-17 08:32:15,586 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 [2024-11-17 08:32:15,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:32:15,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2024-11-17 08:32:15,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 30 letters. Loop has 2 letters. [2024-11-17 08:32:15,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:32:15,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 32 letters. Loop has 2 letters. [2024-11-17 08:32:15,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:32:15,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 30 letters. Loop has 4 letters. [2024-11-17 08:32:15,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:32:15,588 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 55 transitions. [2024-11-17 08:32:15,588 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2024-11-17 08:32:15,589 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 41 states and 45 transitions. [2024-11-17 08:32:15,589 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2024-11-17 08:32:15,589 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2024-11-17 08:32:15,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 45 transitions. [2024-11-17 08:32:15,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:32:15,589 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 45 transitions. [2024-11-17 08:32:15,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 45 transitions. [2024-11-17 08:32:15,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-17 08:32:15,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 40 states have internal predecessors, (45), 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) [2024-11-17 08:32:15,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2024-11-17 08:32:15,597 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 45 transitions. [2024-11-17 08:32:15,597 INFO L425 stractBuchiCegarLoop]: Abstraction has 41 states and 45 transitions. [2024-11-17 08:32:15,597 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-17 08:32:15,597 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 45 transitions. [2024-11-17 08:32:15,598 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2024-11-17 08:32:15,598 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:32:15,598 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:32:15,598 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:32:15,600 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:32:15,601 INFO L745 eck$LassoCheckResult]: Stem: 1011#ULTIMATE.startENTRY 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); 1012#ULTIMATE.init_returnLabel#1 assume true;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; 1018#L33 assume true; 1016#L33-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; 1017#L33 assume true; 1047#L33-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; 1045#L33 assume true; 1043#L33-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; 1041#L33 assume true; 1039#L33-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; 1037#L33 assume true; 1035#L33-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; 1031#L33 assume true; 1030#L33-1 assume !(main_~i~0#1 < 5); 1029#L35-2 call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1); 1026#L35-1 assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0; 1021#L37 assume true; 1022#L37-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; 1023#L37 assume true; 1046#L37-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; 1044#L37 assume true; 1042#L37-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; 1040#L37 assume true; 1038#L37-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; 1036#L37 assume true; 1034#L37-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; 1033#L37 assume true; 1032#L37-1 assume !(main_~i~0#1 < 5); 1027#L39-2 call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1); 1019#L39-1 assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0; 1020#L42 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); 1007#L42-1 assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1; 1008#L45 main_~nc_B~0#1 := 0; 1015#L46 [2024-11-17 08:32:15,601 INFO L747 eck$LassoCheckResult]: Loop: 1015#L46 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); 1013#L46-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; 1015#L46 [2024-11-17 08:32:15,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:15,601 INFO L85 PathProgramCache]: Analyzing trace with hash -969133964, now seen corresponding path program 1 times [2024-11-17 08:32:15,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:32:15,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677842674] [2024-11-17 08:32:15,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:32:15,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:32:15,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:15,619 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:32:15,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:15,628 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:32:15,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:15,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1888, now seen corresponding path program 1 times [2024-11-17 08:32:15,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:32:15,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308423461] [2024-11-17 08:32:15,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:32:15,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:32:15,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:15,635 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:32:15,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:15,637 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:32:15,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:15,637 INFO L85 PathProgramCache]: Analyzing trace with hash 670164755, now seen corresponding path program 1 times [2024-11-17 08:32:15,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:32:15,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085578505] [2024-11-17 08:32:15,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:32:15,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:32:15,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:15,650 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:32:15,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:15,659 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:32:16,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2024-11-17 08:32:18,926 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:32:18,926 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:32:18,926 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:32:18,927 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:32:18,927 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:32:18,927 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:18,927 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:32:18,927 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:32:18,927 INFO L132 ssoRankerPreferences]: Filename of dumped script: string-1.i_Iteration7_Lasso [2024-11-17 08:32:18,927 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:32:18,927 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:32:18,929 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:18,934 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:18,936 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:18,937 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:18,939 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:18,940 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:18,941 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:18,943 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:18,944 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:18,945 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:18,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:18,948 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:18,958 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:19,185 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:19,186 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:19,191 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:19,193 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:19,194 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:19,195 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:19,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:19,406 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:32:19,406 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:32:19,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:19,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:19,412 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) [2024-11-17 08:32:19,416 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 [2024-11-17 08:32:19,417 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:19,427 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:19,428 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:19,428 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:19,428 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:19,428 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:19,428 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:19,428 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:19,429 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:19,439 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 [2024-11-17 08:32:19,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:19,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:19,441 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) [2024-11-17 08:32:19,442 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 [2024-11-17 08:32:19,443 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:19,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:19,454 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:19,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:19,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:19,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:19,454 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:19,455 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:19,456 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:19,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2024-11-17 08:32:19,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:19,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:19,468 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) [2024-11-17 08:32:19,468 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 [2024-11-17 08:32:19,469 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:19,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:19,479 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:19,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:19,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:19,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:19,479 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:19,480 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:19,481 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:19,491 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 [2024-11-17 08:32:19,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:19,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:19,493 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) [2024-11-17 08:32:19,494 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 [2024-11-17 08:32:19,494 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:19,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:19,504 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:19,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:19,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:19,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:19,505 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:19,505 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:19,506 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:19,515 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 [2024-11-17 08:32:19,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:19,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:19,518 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) [2024-11-17 08:32:19,519 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 [2024-11-17 08:32:19,520 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:19,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:19,530 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:19,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:19,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:19,530 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:19,530 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:19,530 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:19,531 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:19,541 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 [2024-11-17 08:32:19,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:19,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:19,543 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) [2024-11-17 08:32:19,546 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 [2024-11-17 08:32:19,547 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:19,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:19,568 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:19,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:19,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:19,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:19,568 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:19,568 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:19,570 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:19,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2024-11-17 08:32:19,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:19,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:19,581 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) [2024-11-17 08:32:19,582 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 [2024-11-17 08:32:19,583 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:19,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:19,593 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:19,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:19,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:19,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:19,594 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:19,594 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:19,595 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:19,605 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 [2024-11-17 08:32:19,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:19,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:19,606 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) [2024-11-17 08:32:19,607 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 [2024-11-17 08:32:19,608 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:19,617 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:19,618 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:19,618 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:19,619 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:19,620 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:19,621 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:19,621 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:19,622 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:19,633 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 [2024-11-17 08:32:19,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:19,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:19,635 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) [2024-11-17 08:32:19,636 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 [2024-11-17 08:32:19,636 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:19,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:19,646 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:19,647 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:19,647 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:19,647 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:19,647 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:19,647 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:19,648 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:19,658 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 [2024-11-17 08:32:19,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:19,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:19,660 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) [2024-11-17 08:32:19,661 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 [2024-11-17 08:32:19,662 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:19,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:19,672 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:19,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:19,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:19,672 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:19,673 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:19,673 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:19,674 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:19,686 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 [2024-11-17 08:32:19,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:19,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:19,690 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) [2024-11-17 08:32:19,691 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 [2024-11-17 08:32:19,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 [2024-11-17 08:32:19,701 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:19,701 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:19,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:19,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:19,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:19,702 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:19,702 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:19,704 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:19,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2024-11-17 08:32:19,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:19,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:19,716 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) [2024-11-17 08:32:19,717 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 [2024-11-17 08:32:19,718 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:19,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:19,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:19,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:19,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:19,729 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:32:19,729 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:19,732 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:19,742 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 [2024-11-17 08:32:19,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:19,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:19,743 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) [2024-11-17 08:32:19,747 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 [2024-11-17 08:32:19,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 [2024-11-17 08:32:19,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:19,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:19,758 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:19,758 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:19,759 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:32:19,760 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:19,764 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:19,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2024-11-17 08:32:19,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:19,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:19,779 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) [2024-11-17 08:32:19,781 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 [2024-11-17 08:32:19,782 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:19,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:19,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:19,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:19,792 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:19,794 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:32:19,794 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:19,800 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:19,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2024-11-17 08:32:19,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:19,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:19,811 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) [2024-11-17 08:32:19,812 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 [2024-11-17 08:32:19,813 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:19,823 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:19,823 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:19,823 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:19,823 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:19,825 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:32:19,825 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:19,827 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:19,837 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 [2024-11-17 08:32:19,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:19,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:19,838 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) [2024-11-17 08:32:19,839 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 [2024-11-17 08:32:19,840 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:19,850 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:19,850 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:19,850 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:19,850 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:19,851 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:32:19,851 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:19,854 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:19,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2024-11-17 08:32:19,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:19,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:19,866 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) [2024-11-17 08:32:19,867 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 [2024-11-17 08:32:19,868 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:19,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:19,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:19,878 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:19,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:19,879 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:32:19,879 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:19,882 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:19,891 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 [2024-11-17 08:32:19,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:19,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:19,893 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) [2024-11-17 08:32:19,894 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 [2024-11-17 08:32:19,895 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:19,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:19,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:19,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:19,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:19,905 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:32:19,905 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:19,908 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:19,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2024-11-17 08:32:19,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:19,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:19,919 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) [2024-11-17 08:32:19,920 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 [2024-11-17 08:32:19,921 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:19,930 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:19,931 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:19,931 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:19,931 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-17 08:32:19,931 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:19,931 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2024-11-17 08:32:19,931 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:19,933 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:19,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2024-11-17 08:32:19,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:19,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:19,944 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) [2024-11-17 08:32:19,944 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 [2024-11-17 08:32:19,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 [2024-11-17 08:32:19,955 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:19,955 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:19,955 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:19,955 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:19,956 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:32:19,956 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:19,958 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:19,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2024-11-17 08:32:19,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:19,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:19,969 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) [2024-11-17 08:32:19,970 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 [2024-11-17 08:32:19,971 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:19,981 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:19,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:19,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:19,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:19,981 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:32:19,981 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:19,983 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:19,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2024-11-17 08:32:19,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:19,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:19,996 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) [2024-11-17 08:32:19,996 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 [2024-11-17 08:32:19,997 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:20,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:20,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:20,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:20,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:20,008 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:32:20,008 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:20,010 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:20,022 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 [2024-11-17 08:32:20,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:20,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:20,027 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) [2024-11-17 08:32:20,028 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 [2024-11-17 08:32:20,028 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:20,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:20,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:20,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:20,039 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:20,040 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:32:20,040 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:20,043 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:20,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2024-11-17 08:32:20,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:20,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:20,054 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) [2024-11-17 08:32:20,055 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 [2024-11-17 08:32:20,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 [2024-11-17 08:32:20,065 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:20,066 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:20,066 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:20,066 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:20,067 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:32:20,068 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:20,070 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:20,081 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 [2024-11-17 08:32:20,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:20,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:20,082 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) [2024-11-17 08:32:20,083 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 [2024-11-17 08:32:20,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 [2024-11-17 08:32:20,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:20,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:20,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:20,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:20,095 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:32:20,095 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:20,098 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:20,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2024-11-17 08:32:20,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:20,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:20,109 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) [2024-11-17 08:32:20,110 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 [2024-11-17 08:32:20,110 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:20,121 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:20,121 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:20,121 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:20,121 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:20,122 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:32:20,122 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:20,124 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:20,134 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 [2024-11-17 08:32:20,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:20,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:20,136 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:32:20,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2024-11-17 08:32:20,137 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:20,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:20,147 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:20,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:20,147 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:20,148 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:32:20,148 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:20,151 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:20,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2024-11-17 08:32:20,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:20,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:20,168 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) [2024-11-17 08:32:20,169 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 [2024-11-17 08:32:20,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 [2024-11-17 08:32:20,182 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:20,182 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:20,182 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:20,182 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:20,183 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:32:20,183 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:20,187 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:20,197 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 [2024-11-17 08:32:20,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:20,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:20,199 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) [2024-11-17 08:32:20,200 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 [2024-11-17 08:32:20,200 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:20,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:20,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:20,212 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:20,212 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:20,213 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:32:20,213 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:20,215 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:20,225 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 [2024-11-17 08:32:20,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:20,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:20,227 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) [2024-11-17 08:32:20,228 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 [2024-11-17 08:32:20,229 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:20,239 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:20,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:20,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:20,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:20,242 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:32:20,242 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:20,246 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:32:20,262 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-11-17 08:32:20,263 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2024-11-17 08:32:20,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:20,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:20,264 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) [2024-11-17 08:32:20,265 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 [2024-11-17 08:32:20,266 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:32:20,276 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-11-17 08:32:20,277 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:32:20,277 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) = 1*v_rep(select #length ULTIMATE.start_main_~#string_B~0#1.base)_3 - 1*ULTIMATE.start_main_~nc_B~0#1 Supporting invariants [1*ULTIMATE.start_main_~#string_B~0#1.offset >= 0] [2024-11-17 08:32:20,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2024-11-17 08:32:20,308 INFO L156 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2024-11-17 08:32:20,310 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-17 08:32:20,310 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-17 08:32:20,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:20,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:32:20,351 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 08:32:20,352 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:32:20,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:32:20,534 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 08:32:20,535 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:32:20,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:32:20,549 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 [2024-11-17 08:32:20,549 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 45 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:32:20,577 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 45 transitions. cyclomatic complexity: 7. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 47 states and 54 transitions. Complement of second has 5 states. [2024-11-17 08:32:20,577 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 [2024-11-17 08:32:20,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:32:20,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2024-11-17 08:32:20,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 33 letters. Loop has 2 letters. [2024-11-17 08:32:20,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:32:20,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 35 letters. Loop has 2 letters. [2024-11-17 08:32:20,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:32:20,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 33 letters. Loop has 4 letters. [2024-11-17 08:32:20,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:32:20,579 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 54 transitions. [2024-11-17 08:32:20,579 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-17 08:32:20,579 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 43 states and 48 transitions. [2024-11-17 08:32:20,580 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2024-11-17 08:32:20,580 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2024-11-17 08:32:20,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 48 transitions. [2024-11-17 08:32:20,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:32:20,580 INFO L218 hiAutomatonCegarLoop]: Abstraction has 43 states and 48 transitions. [2024-11-17 08:32:20,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 48 transitions. [2024-11-17 08:32:20,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-17 08:32:20,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 42 states have internal predecessors, (48), 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) [2024-11-17 08:32:20,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2024-11-17 08:32:20,582 INFO L240 hiAutomatonCegarLoop]: Abstraction has 43 states and 48 transitions. [2024-11-17 08:32:20,582 INFO L425 stractBuchiCegarLoop]: Abstraction has 43 states and 48 transitions. [2024-11-17 08:32:20,582 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-17 08:32:20,582 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 48 transitions. [2024-11-17 08:32:20,582 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-17 08:32:20,582 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:32:20,582 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:32:20,583 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:32:20,583 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-17 08:32:20,583 INFO L745 eck$LassoCheckResult]: Stem: 1266#ULTIMATE.startENTRY 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); 1267#ULTIMATE.init_returnLabel#1 assume true;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; 1274#L33 assume true; 1272#L33-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; 1273#L33 assume true; 1299#L33-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; 1297#L33 assume true; 1295#L33-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; 1293#L33 assume true; 1291#L33-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; 1290#L33 assume true; 1289#L33-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; 1288#L33 assume true; 1287#L33-1 assume !(main_~i~0#1 < 5); 1286#L35-2 call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1); 1282#L35-1 assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0; 1277#L37 assume true; 1278#L37-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; 1279#L37 assume true; 1304#L37-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; 1303#L37 assume true; 1302#L37-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; 1301#L37 assume true; 1300#L37-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; 1298#L37 assume true; 1296#L37-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; 1294#L37 assume true; 1292#L37-1 assume !(main_~i~0#1 < 5); 1283#L39-2 call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1); 1275#L39-1 assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0; 1276#L42 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); 1262#L42-1 assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1; 1263#L45 main_~nc_B~0#1 := 0; 1285#L46 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); 1268#L46-1 assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1; 1269#L49-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; 1281#L53 [2024-11-17 08:32:20,583 INFO L747 eck$LassoCheckResult]: Loop: 1281#L53 assume true; 1284#L53-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); 1280#L55 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; 1281#L53 [2024-11-17 08:32:20,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:20,584 INFO L85 PathProgramCache]: Analyzing trace with hash -699729113, now seen corresponding path program 1 times [2024-11-17 08:32:20,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:32:20,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614044521] [2024-11-17 08:32:20,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:32:20,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:32:20,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:20,596 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:32:20,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:20,610 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:32:20,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:20,610 INFO L85 PathProgramCache]: Analyzing trace with hash 47628, now seen corresponding path program 1 times [2024-11-17 08:32:20,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:32:20,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640089432] [2024-11-17 08:32:20,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:32:20,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:32:20,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:20,613 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:32:20,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:20,615 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:32:20,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:20,615 INFO L85 PathProgramCache]: Analyzing trace with hash 2141267238, now seen corresponding path program 1 times [2024-11-17 08:32:20,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:32:20,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69339673] [2024-11-17 08:32:20,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:32:20,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:32:20,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:32:20,673 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-17 08:32:20,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:32:20,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69339673] [2024-11-17 08:32:20,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69339673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:32:20,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:32:20,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 08:32:20,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667435795] [2024-11-17 08:32:20,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:32:20,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:32:20,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 08:32:20,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 08:32:20,733 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 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) [2024-11-17 08:32:20,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:32:20,742 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2024-11-17 08:32:20,742 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 59 transitions. [2024-11-17 08:32:20,742 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-17 08:32:20,743 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 44 states and 48 transitions. [2024-11-17 08:32:20,743 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2024-11-17 08:32:20,743 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2024-11-17 08:32:20,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 48 transitions. [2024-11-17 08:32:20,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:32:20,743 INFO L218 hiAutomatonCegarLoop]: Abstraction has 44 states and 48 transitions. [2024-11-17 08:32:20,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 48 transitions. [2024-11-17 08:32:20,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2024-11-17 08:32:20,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 42 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) [2024-11-17 08:32:20,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2024-11-17 08:32:20,745 INFO L240 hiAutomatonCegarLoop]: Abstraction has 43 states and 47 transitions. [2024-11-17 08:32:20,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 08:32:20,745 INFO L425 stractBuchiCegarLoop]: Abstraction has 43 states and 47 transitions. [2024-11-17 08:32:20,746 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-17 08:32:20,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 47 transitions. [2024-11-17 08:32:20,746 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-17 08:32:20,746 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:32:20,746 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:32:20,746 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:32:20,746 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-17 08:32:20,746 INFO L745 eck$LassoCheckResult]: Stem: 1371#ULTIMATE.startENTRY 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); 1372#ULTIMATE.init_returnLabel#1 assume true;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; 1379#L33 assume true; 1377#L33-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; 1378#L33 assume true; 1403#L33-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; 1401#L33 assume true; 1399#L33-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; 1398#L33 assume true; 1397#L33-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; 1395#L33 assume true; 1394#L33-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; 1393#L33 assume true; 1392#L33-1 assume !(main_~i~0#1 < 5); 1391#L35-2 call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1); 1387#L35-1 assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0; 1382#L37 assume true; 1383#L37-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; 1384#L37 assume true; 1409#L37-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; 1408#L37 assume true; 1407#L37-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; 1406#L37 assume true; 1405#L37-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; 1404#L37 assume true; 1402#L37-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; 1400#L37 assume true; 1396#L37-1 assume !(main_~i~0#1 < 5); 1388#L39-2 call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1); 1380#L39-1 assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0; 1381#L42 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); 1369#L42-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; 1370#L42 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); 1367#L42-1 assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1; 1368#L45 main_~nc_B~0#1 := 0; 1390#L46 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); 1373#L46-1 assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1; 1374#L49-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; 1386#L53 [2024-11-17 08:32:20,747 INFO L747 eck$LassoCheckResult]: Loop: 1386#L53 assume true; 1389#L53-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); 1385#L55 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; 1386#L53 [2024-11-17 08:32:20,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:20,747 INFO L85 PathProgramCache]: Analyzing trace with hash -502777626, now seen corresponding path program 1 times [2024-11-17 08:32:20,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:32:20,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81635168] [2024-11-17 08:32:20,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:32:20,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:32:20,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:32:20,829 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 [2024-11-17 08:32:20,851 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-17 08:32:20,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:32:20,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81635168] [2024-11-17 08:32:20,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81635168] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:32:20,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258713830] [2024-11-17 08:32:20,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:32:20,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:32:20,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:20,853 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:32:20,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2024-11-17 08:32:20,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:32:20,927 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 08:32:20,929 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:32:20,956 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-17 08:32:20,957 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 08:32:20,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258713830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:32:20,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 08:32:20,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-11-17 08:32:20,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712189542] [2024-11-17 08:32:20,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:32:20,957 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:32:20,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:20,958 INFO L85 PathProgramCache]: Analyzing trace with hash 47628, now seen corresponding path program 2 times [2024-11-17 08:32:20,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:32:20,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24967798] [2024-11-17 08:32:20,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:32:20,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:32:20,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:20,968 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:32:20,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:20,982 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:32:21,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:32:21,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 08:32:21,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-17 08:32:21,047 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. cyclomatic complexity: 7 Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 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) [2024-11-17 08:32:21,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:32:21,068 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2024-11-17 08:32:21,068 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 50 transitions. [2024-11-17 08:32:21,068 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-17 08:32:21,069 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 45 states and 48 transitions. [2024-11-17 08:32:21,069 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2024-11-17 08:32:21,069 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2024-11-17 08:32:21,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 48 transitions. [2024-11-17 08:32:21,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:32:21,069 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 48 transitions. [2024-11-17 08:32:21,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 48 transitions. [2024-11-17 08:32:21,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2024-11-17 08:32:21,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.069767441860465) internal successors, (46), 42 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) [2024-11-17 08:32:21,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2024-11-17 08:32:21,071 INFO L240 hiAutomatonCegarLoop]: Abstraction has 43 states and 46 transitions. [2024-11-17 08:32:21,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 08:32:21,074 INFO L425 stractBuchiCegarLoop]: Abstraction has 43 states and 46 transitions. [2024-11-17 08:32:21,074 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-17 08:32:21,075 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 46 transitions. [2024-11-17 08:32:21,076 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-17 08:32:21,077 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:32:21,077 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:32:21,078 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:32:21,078 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-17 08:32:21,078 INFO L745 eck$LassoCheckResult]: Stem: 1582#ULTIMATE.startENTRY 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); 1583#ULTIMATE.init_returnLabel#1 assume true;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; 1590#L33 assume true; 1588#L33-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; 1589#L33 assume true; 1615#L33-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; 1613#L33 assume true; 1611#L33-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; 1609#L33 assume true; 1608#L33-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; 1606#L33 assume true; 1605#L33-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; 1604#L33 assume true; 1603#L33-1 assume !(main_~i~0#1 < 5); 1602#L35-2 call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1); 1598#L35-1 assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0; 1593#L37 assume true; 1594#L37-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; 1595#L37 assume true; 1620#L37-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; 1619#L37 assume true; 1618#L37-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; 1617#L37 assume true; 1616#L37-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; 1614#L37 assume true; 1612#L37-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; 1610#L37 assume true; 1607#L37-1 assume !(main_~i~0#1 < 5); 1599#L39-2 call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1); 1591#L39-1 assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0; 1592#L42 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); 1580#L42-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; 1581#L42 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); 1578#L42-1 assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1; 1579#L45 main_~nc_B~0#1 := 0; 1601#L46 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); 1586#L46-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; 1587#L46 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); 1584#L46-1 assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1; 1585#L49-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; 1597#L53 [2024-11-17 08:32:21,078 INFO L747 eck$LassoCheckResult]: Loop: 1597#L53 assume true; 1600#L53-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); 1596#L55 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; 1597#L53 [2024-11-17 08:32:21,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:21,079 INFO L85 PathProgramCache]: Analyzing trace with hash -2132896217, now seen corresponding path program 1 times [2024-11-17 08:32:21,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:32:21,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547765756] [2024-11-17 08:32:21,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:32:21,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:32:21,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:21,126 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:32:21,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:21,161 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:32:21,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:21,161 INFO L85 PathProgramCache]: Analyzing trace with hash 47628, now seen corresponding path program 3 times [2024-11-17 08:32:21,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:32:21,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418402788] [2024-11-17 08:32:21,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:32:21,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:32:21,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:21,168 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:32:21,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:21,170 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:32:21,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:21,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1365005786, now seen corresponding path program 1 times [2024-11-17 08:32:21,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:32:21,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130174141] [2024-11-17 08:32:21,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:32:21,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:32:21,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:21,186 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:32:21,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:21,197 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:32:23,533 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:32:23,533 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:32:23,533 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:32:23,533 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:32:23,533 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:32:23,533 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:23,533 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:32:23,533 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:32:23,533 INFO L132 ssoRankerPreferences]: Filename of dumped script: string-1.i_Iteration10_Lasso [2024-11-17 08:32:23,533 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:32:23,533 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:32:23,535 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:23,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:23,539 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:23,540 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:23,542 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:23,543 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:23,545 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:23,546 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:23,547 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:23,555 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:23,556 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:23,558 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:23,560 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:23,561 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:23,563 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:23,564 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:23,840 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:24,066 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:32:24,067 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:32:24,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:24,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:24,070 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) [2024-11-17 08:32:24,071 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 [2024-11-17 08:32:24,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 [2024-11-17 08:32:24,083 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:24,083 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:24,083 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:24,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:24,083 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:24,087 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:24,088 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:24,092 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:24,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2024-11-17 08:32:24,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:24,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:24,112 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) [2024-11-17 08:32:24,115 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 [2024-11-17 08:32:24,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 [2024-11-17 08:32:24,138 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:24,139 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:24,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:24,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:24,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:24,139 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:24,139 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:24,140 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:24,153 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 [2024-11-17 08:32:24,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:24,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:24,155 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) [2024-11-17 08:32:24,156 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 [2024-11-17 08:32:24,157 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:24,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:24,167 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:24,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:24,167 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:24,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:24,167 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:24,167 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:24,168 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:24,178 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 [2024-11-17 08:32:24,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:24,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:24,180 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) [2024-11-17 08:32:24,180 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 [2024-11-17 08:32:24,181 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:24,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:24,191 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:24,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:24,191 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:24,191 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:24,191 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:24,191 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:24,192 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:24,202 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 [2024-11-17 08:32:24,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:24,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:24,203 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) [2024-11-17 08:32:24,204 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 [2024-11-17 08:32:24,205 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:24,214 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:24,214 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:24,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:24,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:24,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:24,215 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:24,215 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:24,216 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:24,226 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 [2024-11-17 08:32:24,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:24,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:24,227 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) [2024-11-17 08:32:24,228 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 [2024-11-17 08:32:24,229 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:24,238 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:24,238 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:24,238 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:24,239 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:24,239 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:24,239 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:24,239 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:24,240 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:24,254 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 [2024-11-17 08:32:24,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:24,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:24,257 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) [2024-11-17 08:32:24,258 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 [2024-11-17 08:32:24,262 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:24,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:24,271 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:24,271 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:24,271 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:24,271 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:24,272 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:24,272 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:24,273 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:24,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Forceful destruction successful, exit code 0 [2024-11-17 08:32:24,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:24,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:24,284 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) [2024-11-17 08:32:24,285 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 [2024-11-17 08:32:24,285 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:24,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:24,295 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:24,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:24,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:24,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:24,295 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:24,295 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:24,296 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:24,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Forceful destruction successful, exit code 0 [2024-11-17 08:32:24,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:24,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:24,307 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) [2024-11-17 08:32:24,307 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 [2024-11-17 08:32:24,308 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:24,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:24,318 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:24,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:24,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:24,319 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:32:24,319 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:24,321 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:24,331 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 [2024-11-17 08:32:24,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:24,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:24,332 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) [2024-11-17 08:32:24,333 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 [2024-11-17 08:32:24,334 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:24,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:24,344 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:24,344 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:24,344 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:24,345 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:32:24,345 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:24,347 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:24,357 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 [2024-11-17 08:32:24,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:24,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:24,358 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) [2024-11-17 08:32:24,359 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 [2024-11-17 08:32:24,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 [2024-11-17 08:32:24,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:24,369 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:24,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:24,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:24,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:24,370 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:24,370 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:24,371 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:24,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Forceful destruction successful, exit code 0 [2024-11-17 08:32:24,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:24,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:24,382 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) [2024-11-17 08:32:24,383 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 [2024-11-17 08:32:24,384 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:24,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:24,394 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:24,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:24,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:24,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:24,394 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:24,394 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:24,395 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:24,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Forceful destruction successful, exit code 0 [2024-11-17 08:32:24,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:24,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:24,407 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) [2024-11-17 08:32:24,408 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 [2024-11-17 08:32:24,408 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:24,418 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:24,418 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:24,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:24,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:24,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:24,419 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:24,419 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:24,420 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:24,429 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 [2024-11-17 08:32:24,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:24,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:24,431 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) [2024-11-17 08:32:24,443 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 [2024-11-17 08:32:24,443 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:24,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:24,453 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:24,453 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:24,453 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:24,453 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:24,454 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:24,454 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:24,455 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:24,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Forceful destruction successful, exit code 0 [2024-11-17 08:32:24,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:24,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:24,467 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) [2024-11-17 08:32:24,468 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 [2024-11-17 08:32:24,468 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:24,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:24,478 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:24,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:24,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:24,478 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:24,479 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:24,479 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:24,480 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:24,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Forceful destruction successful, exit code 0 [2024-11-17 08:32:24,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:24,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:24,492 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) [2024-11-17 08:32:24,493 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 [2024-11-17 08:32:24,493 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:24,503 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:24,503 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:24,503 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:24,503 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:24,503 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:24,504 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:24,504 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:24,505 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:24,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 [2024-11-17 08:32:24,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:24,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:24,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) [2024-11-17 08:32:24,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 [2024-11-17 08:32:24,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 [2024-11-17 08:32:24,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:24,528 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2024-11-17 08:32:24,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:24,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:24,531 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2024-11-17 08:32:24,531 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:24,538 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:24,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Forceful destruction successful, exit code 0 [2024-11-17 08:32:24,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:24,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:24,549 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) [2024-11-17 08:32:24,550 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 [2024-11-17 08:32:24,550 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:24,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:24,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:24,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:24,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:24,561 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:32:24,561 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:24,564 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:24,575 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 [2024-11-17 08:32:24,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:24,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:24,576 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) [2024-11-17 08:32:24,577 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 [2024-11-17 08:32:24,578 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:24,587 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:24,587 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:24,587 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:24,587 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:24,588 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:32:24,588 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:24,590 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:24,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Forceful destruction successful, exit code 0 [2024-11-17 08:32:24,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:24,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:24,602 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) [2024-11-17 08:32:24,603 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 [2024-11-17 08:32:24,603 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:24,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:24,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:24,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:24,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:24,615 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:32:24,615 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:24,619 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:24,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2024-11-17 08:32:24,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:24,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:24,633 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) [2024-11-17 08:32:24,634 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 [2024-11-17 08:32:24,635 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:24,645 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:24,645 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:24,645 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:24,645 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:24,646 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:32:24,647 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:24,649 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:24,658 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 [2024-11-17 08:32:24,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:24,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:24,660 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) [2024-11-17 08:32:24,661 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 [2024-11-17 08:32:24,661 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:24,671 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:24,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:24,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:24,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:24,673 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:32:24,673 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:24,679 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:24,692 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 [2024-11-17 08:32:24,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:24,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:24,694 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) [2024-11-17 08:32:24,694 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 [2024-11-17 08:32:24,695 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:24,705 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:24,705 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:24,705 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:24,705 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:24,711 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:32:24,711 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:24,717 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:32:24,726 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-11-17 08:32:24,726 INFO L444 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 8 variables to zero. [2024-11-17 08:32:24,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:24,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:24,728 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:32:24,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2024-11-17 08:32:24,730 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:32:24,740 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-17 08:32:24,740 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:32:24,740 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~#string_B~0#1.offset, ULTIMATE.start_main_~j~0#1, v_rep(select #length ULTIMATE.start_main_~#string_B~0#1.base)_4) = -1*ULTIMATE.start_main_~#string_B~0#1.offset - 1*ULTIMATE.start_main_~j~0#1 + 1*v_rep(select #length ULTIMATE.start_main_~#string_B~0#1.base)_4 Supporting invariants [] [2024-11-17 08:32:24,751 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 [2024-11-17 08:32:24,785 INFO L156 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2024-11-17 08:32:24,787 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-17 08:32:24,787 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-17 08:32:24,787 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#string_B~0!offset [2024-11-17 08:32:24,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:24,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:32:24,837 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:32:24,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:32:24,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:32:24,905 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 08:32:24,906 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:32:24,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:32:24,952 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 [2024-11-17 08:32:24,952 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 46 transitions. cyclomatic complexity: 6 Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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) [2024-11-17 08:32:24,989 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 46 transitions. cyclomatic complexity: 6. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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 49 states and 54 transitions. Complement of second has 7 states. [2024-11-17 08:32:24,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-17 08:32:24,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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) [2024-11-17 08:32:24,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2024-11-17 08:32:24,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 40 letters. Loop has 3 letters. [2024-11-17 08:32:24,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:32:24,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 43 letters. Loop has 3 letters. [2024-11-17 08:32:24,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:32:24,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 40 letters. Loop has 6 letters. [2024-11-17 08:32:24,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:32:24,991 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 54 transitions. [2024-11-17 08:32:24,991 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-17 08:32:24,991 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 54 transitions. [2024-11-17 08:32:24,991 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2024-11-17 08:32:24,992 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-11-17 08:32:24,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 54 transitions. [2024-11-17 08:32:24,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:32:24,992 INFO L218 hiAutomatonCegarLoop]: Abstraction has 49 states and 54 transitions. [2024-11-17 08:32:24,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 54 transitions. [2024-11-17 08:32:24,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-17 08:32:24,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 48 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) [2024-11-17 08:32:24,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2024-11-17 08:32:25,000 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 54 transitions. [2024-11-17 08:32:25,000 INFO L425 stractBuchiCegarLoop]: Abstraction has 49 states and 54 transitions. [2024-11-17 08:32:25,000 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-17 08:32:25,000 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 54 transitions. [2024-11-17 08:32:25,000 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-17 08:32:25,000 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:32:25,000 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:32:25,000 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:32:25,000 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-17 08:32:25,001 INFO L745 eck$LassoCheckResult]: Stem: 1858#ULTIMATE.startENTRY 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); 1859#ULTIMATE.init_returnLabel#1 assume true;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; 1866#L33 assume true; 1864#L33-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; 1865#L33 assume true; 1896#L33-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; 1894#L33 assume true; 1892#L33-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; 1890#L33 assume true; 1888#L33-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; 1887#L33 assume true; 1886#L33-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; 1885#L33 assume true; 1884#L33-1 assume !(main_~i~0#1 < 5); 1882#L35-2 call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1); 1876#L35-1 assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0; 1869#L37 assume true; 1870#L37-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; 1871#L37 assume true; 1902#L37-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; 1901#L37 assume true; 1899#L37-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; 1898#L37 assume true; 1897#L37-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; 1895#L37 assume true; 1893#L37-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; 1891#L37 assume true; 1889#L37-1 assume !(main_~i~0#1 < 5); 1878#L39-2 call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1); 1867#L39-1 assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0; 1868#L42 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); 1856#L42-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; 1857#L42 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); 1854#L42-1 assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1; 1855#L45 main_~nc_B~0#1 := 0; 1881#L46 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); 1862#L46-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; 1863#L46 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); 1860#L46-1 assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1; 1861#L49-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; 1877#L53 assume true; 1879#L53-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); 1872#L55 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; 1873#L53 [2024-11-17 08:32:25,001 INFO L747 eck$LassoCheckResult]: Loop: 1873#L53 assume true; 1883#L53-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); 1900#L55 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; 1873#L53 [2024-11-17 08:32:25,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:25,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1365005785, now seen corresponding path program 1 times [2024-11-17 08:32:25,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:32:25,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720991798] [2024-11-17 08:32:25,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:32:25,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:32:25,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:25,045 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:32:25,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:25,070 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:32:25,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:25,071 INFO L85 PathProgramCache]: Analyzing trace with hash 47628, now seen corresponding path program 4 times [2024-11-17 08:32:25,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:32:25,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359866346] [2024-11-17 08:32:25,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:32:25,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:32:25,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:25,080 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:32:25,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:25,086 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:32:25,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:25,086 INFO L85 PathProgramCache]: Analyzing trace with hash -136964570, now seen corresponding path program 1 times [2024-11-17 08:32:25,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:32:25,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503583697] [2024-11-17 08:32:25,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:32:25,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:32:25,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:32:25,359 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-17 08:32:25,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:32:25,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503583697] [2024-11-17 08:32:25,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503583697] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:32:25,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777598690] [2024-11-17 08:32:25,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:32:25,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:32:25,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:25,361 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) [2024-11-17 08:32:25,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Waiting until timeout for monitored process [2024-11-17 08:32:25,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:32:25,450 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 08:32:25,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:32:25,525 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-17 08:32:25,525 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:32:25,556 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-17 08:32:25,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777598690] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:32:25,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:32:25,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-11-17 08:32:25,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985568472] [2024-11-17 08:32:25,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:32:25,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:32:25,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-17 08:32:25,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-17 08:32:25,616 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. cyclomatic complexity: 9 Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 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) [2024-11-17 08:32:25,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:32:25,656 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2024-11-17 08:32:25,656 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 75 transitions. [2024-11-17 08:32:25,656 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-17 08:32:25,657 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 52 states and 57 transitions. [2024-11-17 08:32:25,657 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-11-17 08:32:25,657 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-11-17 08:32:25,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 57 transitions. [2024-11-17 08:32:25,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:32:25,657 INFO L218 hiAutomatonCegarLoop]: Abstraction has 52 states and 57 transitions. [2024-11-17 08:32:25,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 57 transitions. [2024-11-17 08:32:25,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2024-11-17 08:32:25,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 50 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) [2024-11-17 08:32:25,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2024-11-17 08:32:25,659 INFO L240 hiAutomatonCegarLoop]: Abstraction has 51 states and 56 transitions. [2024-11-17 08:32:25,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 08:32:25,664 INFO L425 stractBuchiCegarLoop]: Abstraction has 51 states and 56 transitions. [2024-11-17 08:32:25,664 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-17 08:32:25,664 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 56 transitions. [2024-11-17 08:32:25,664 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-17 08:32:25,664 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:32:25,664 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:32:25,664 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:32:25,664 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-17 08:32:25,665 INFO L745 eck$LassoCheckResult]: Stem: 2263#ULTIMATE.startENTRY 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); 2264#ULTIMATE.init_returnLabel#1 assume true;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; 2271#L33 assume true; 2269#L33-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; 2270#L33 assume true; 2308#L33-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; 2306#L33 assume true; 2304#L33-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; 2302#L33 assume true; 2300#L33-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; 2298#L33 assume true; 2296#L33-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; 2294#L33 assume true; 2292#L33-1 assume !(main_~i~0#1 < 5); 2288#L35-2 call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1); 2282#L35-1 assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0; 2275#L37 assume true; 2276#L37-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; 2277#L37 assume true; 2307#L37-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; 2305#L37 assume true; 2303#L37-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; 2301#L37 assume true; 2299#L37-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; 2297#L37 assume true; 2295#L37-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; 2293#L37 assume true; 2291#L37-1 assume !(main_~i~0#1 < 5); 2284#L39-2 call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1); 2272#L39-1 assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0; 2273#L42 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); 2261#L42-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; 2262#L42 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); 2274#L42-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; 2290#L42 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); 2259#L42-1 assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1; 2260#L45 main_~nc_B~0#1 := 0; 2287#L46 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); 2267#L46-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; 2268#L46 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); 2265#L46-1 assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1; 2266#L49-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; 2283#L53 assume true; 2285#L53-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); 2278#L55 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; 2279#L53 [2024-11-17 08:32:25,665 INFO L747 eck$LassoCheckResult]: Loop: 2279#L53 assume true; 2289#L53-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); 2309#L55 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; 2279#L53 [2024-11-17 08:32:25,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:25,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1929885816, now seen corresponding path program 2 times [2024-11-17 08:32:25,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:32:25,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809758451] [2024-11-17 08:32:25,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:32:25,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:32:25,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:32:25,800 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-17 08:32:25,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:32:25,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809758451] [2024-11-17 08:32:25,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809758451] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:32:25,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438111882] [2024-11-17 08:32:25,801 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 08:32:25,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:32:25,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:25,808 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:32:25,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2024-11-17 08:32:25,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Waiting until timeout for monitored process [2024-11-17 08:32:25,965 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 08:32:25,965 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:32:25,966 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 08:32:25,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:32:26,019 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-17 08:32:26,019 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:32:26,063 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-17 08:32:26,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438111882] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:32:26,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:32:26,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-11-17 08:32:26,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390513885] [2024-11-17 08:32:26,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:32:26,065 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:32:26,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:26,065 INFO L85 PathProgramCache]: Analyzing trace with hash 47628, now seen corresponding path program 5 times [2024-11-17 08:32:26,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:32:26,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064661211] [2024-11-17 08:32:26,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:32:26,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:32:26,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:26,070 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:32:26,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:26,072 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:32:26,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:32:26,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-17 08:32:26,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-17 08:32:26,133 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. cyclomatic complexity: 9 Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 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) [2024-11-17 08:32:26,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:32:26,178 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2024-11-17 08:32:26,178 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 62 transitions. [2024-11-17 08:32:26,178 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-17 08:32:26,179 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 55 states and 60 transitions. [2024-11-17 08:32:26,179 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-11-17 08:32:26,179 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-11-17 08:32:26,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 60 transitions. [2024-11-17 08:32:26,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:32:26,179 INFO L218 hiAutomatonCegarLoop]: Abstraction has 55 states and 60 transitions. [2024-11-17 08:32:26,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 60 transitions. [2024-11-17 08:32:26,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2024-11-17 08:32:26,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 52 states have internal predecessors, (58), 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) [2024-11-17 08:32:26,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2024-11-17 08:32:26,181 INFO L240 hiAutomatonCegarLoop]: Abstraction has 53 states and 58 transitions. [2024-11-17 08:32:26,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 08:32:26,182 INFO L425 stractBuchiCegarLoop]: Abstraction has 53 states and 58 transitions. [2024-11-17 08:32:26,182 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-11-17 08:32:26,182 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 58 transitions. [2024-11-17 08:32:26,182 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-17 08:32:26,182 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:32:26,183 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:32:26,183 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:32:26,183 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-17 08:32:26,184 INFO L745 eck$LassoCheckResult]: Stem: 2649#ULTIMATE.startENTRY 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); 2650#ULTIMATE.init_returnLabel#1 assume true;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; 2657#L33 assume true; 2655#L33-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; 2656#L33 assume true; 2696#L33-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; 2694#L33 assume true; 2692#L33-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; 2690#L33 assume true; 2688#L33-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; 2686#L33 assume true; 2685#L33-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; 2684#L33 assume true; 2680#L33-1 assume !(main_~i~0#1 < 5); 2675#L35-2 call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1); 2668#L35-1 assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0; 2661#L37 assume true; 2662#L37-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; 2663#L37 assume true; 2697#L37-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; 2695#L37 assume true; 2693#L37-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; 2691#L37 assume true; 2689#L37-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; 2687#L37 assume true; 2682#L37-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; 2681#L37 assume true; 2679#L37-1 assume !(main_~i~0#1 < 5); 2670#L39-2 call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1); 2658#L39-1 assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0; 2659#L42 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); 2647#L42-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; 2648#L42 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); 2660#L42-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; 2677#L42 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); 2645#L42-1 assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1; 2646#L45 main_~nc_B~0#1 := 0; 2673#L46 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); 2653#L46-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; 2654#L46 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); 2674#L46-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; 2678#L46 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); 2651#L46-1 assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1; 2652#L49-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; 2669#L53 assume true; 2671#L53-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); 2664#L55 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; 2665#L53 [2024-11-17 08:32:26,184 INFO L747 eck$LassoCheckResult]: Loop: 2665#L53 assume true; 2676#L53-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); 2683#L55 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; 2665#L53 [2024-11-17 08:32:26,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:26,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1563609433, now seen corresponding path program 3 times [2024-11-17 08:32:26,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:32:26,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718502859] [2024-11-17 08:32:26,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:32:26,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:32:26,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:26,202 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:32:26,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:26,214 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:32:26,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:26,215 INFO L85 PathProgramCache]: Analyzing trace with hash 47628, now seen corresponding path program 6 times [2024-11-17 08:32:26,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:32:26,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086628788] [2024-11-17 08:32:26,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:32:26,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:32:26,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:26,217 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:32:26,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:26,219 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:32:26,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:26,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1726691750, now seen corresponding path program 2 times [2024-11-17 08:32:26,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:32:26,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363864141] [2024-11-17 08:32:26,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:32:26,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:32:26,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:26,234 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:32:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:26,247 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:32:29,186 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:32:29,186 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:32:29,186 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:32:29,186 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:32:29,186 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:32:29,186 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:29,186 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:32:29,186 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:32:29,186 INFO L132 ssoRankerPreferences]: Filename of dumped script: string-1.i_Iteration13_Lasso [2024-11-17 08:32:29,186 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:32:29,186 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:32:29,188 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:29,194 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:29,196 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:29,197 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:29,198 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:29,535 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:29,537 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:29,539 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:29,540 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:29,542 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:29,543 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:29,545 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:29,546 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:29,547 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:29,549 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:29,551 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:29,552 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:30,061 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:32:30,061 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:32:30,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:30,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:30,064 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) [2024-11-17 08:32:30,068 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 [2024-11-17 08:32:30,069 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:30,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:30,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:30,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:30,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:30,081 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:32:30,081 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:30,083 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:30,093 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 [2024-11-17 08:32:30,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:30,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:30,094 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) [2024-11-17 08:32:30,095 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 [2024-11-17 08:32:30,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 [2024-11-17 08:32:30,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:30,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:30,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:30,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:30,107 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:32:30,107 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:30,109 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:30,120 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 [2024-11-17 08:32:30,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:30,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:30,121 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) [2024-11-17 08:32:30,122 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 [2024-11-17 08:32:30,122 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:30,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:30,132 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:30,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:30,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:30,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:30,133 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:30,133 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:30,134 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:30,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Ended with exit code 0 [2024-11-17 08:32:30,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:30,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:30,146 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) [2024-11-17 08:32:30,147 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 [2024-11-17 08:32:30,147 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:30,159 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:30,159 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:30,160 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:30,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:30,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:30,160 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:30,160 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:30,161 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:30,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Forceful destruction successful, exit code 0 [2024-11-17 08:32:30,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:30,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:30,173 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) [2024-11-17 08:32:30,174 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 [2024-11-17 08:32:30,175 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:30,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:30,185 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:30,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:30,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:30,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:30,185 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:30,185 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:30,186 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:30,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Forceful destruction successful, exit code 0 [2024-11-17 08:32:30,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:30,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:30,198 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) [2024-11-17 08:32:30,200 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 [2024-11-17 08:32:30,200 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:30,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:30,213 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:30,213 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:30,213 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:30,215 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:32:30,215 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:30,217 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:30,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Forceful destruction successful, exit code 0 [2024-11-17 08:32:30,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:30,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:30,228 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) [2024-11-17 08:32:30,229 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 [2024-11-17 08:32:30,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 [2024-11-17 08:32:30,239 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:30,239 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:30,239 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:30,239 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:30,241 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:32:30,241 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:30,244 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:30,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Forceful destruction successful, exit code 0 [2024-11-17 08:32:30,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:30,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:30,256 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) [2024-11-17 08:32:30,257 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 [2024-11-17 08:32:30,257 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:30,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:30,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:30,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:30,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:30,268 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:32:30,268 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:30,271 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:30,281 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 [2024-11-17 08:32:30,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:30,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:30,283 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) [2024-11-17 08:32:30,283 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 [2024-11-17 08:32:30,284 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:30,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:30,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:30,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:30,294 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:30,295 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:32:30,295 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:30,297 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:30,307 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 [2024-11-17 08:32:30,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:30,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:30,309 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) [2024-11-17 08:32:30,310 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 [2024-11-17 08:32:30,311 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:30,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:30,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:30,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:30,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:30,323 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:32:30,323 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:30,325 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:30,336 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 [2024-11-17 08:32:30,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:30,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:30,337 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) [2024-11-17 08:32:30,339 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 [2024-11-17 08:32:30,339 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:30,349 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:30,349 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:30,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:30,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:30,350 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:32:30,350 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:30,353 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:30,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Forceful destruction successful, exit code 0 [2024-11-17 08:32:30,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:30,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:30,365 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) [2024-11-17 08:32:30,369 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 [2024-11-17 08:32:30,369 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:30,379 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:30,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:30,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:30,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:30,380 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:32:30,380 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:30,383 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:30,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Forceful destruction successful, exit code 0 [2024-11-17 08:32:30,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:30,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:30,395 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) [2024-11-17 08:32:30,395 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 [2024-11-17 08:32:30,396 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:30,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:30,406 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:30,406 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:30,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:30,407 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:32:30,407 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:30,409 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:30,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Forceful destruction successful, exit code 0 [2024-11-17 08:32:30,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:30,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:30,421 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) [2024-11-17 08:32:30,422 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 [2024-11-17 08:32:30,423 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:30,433 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:30,433 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:30,433 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:30,433 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:30,435 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:32:30,435 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:30,441 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:32:30,456 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2024-11-17 08:32:30,456 INFO L444 ModelExtractionUtils]: 1 out of 16 variables were initially zero. Simplification set additionally 12 variables to zero. [2024-11-17 08:32:30,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:30,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:30,458 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) [2024-11-17 08:32:30,458 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 [2024-11-17 08:32:30,459 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:32:30,470 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-17 08:32:30,470 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:32:30,470 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) = 3*v_rep(select #length ULTIMATE.start_main_~#string_A~0#1.base)_5 - 2*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-11-17 08:32:30,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Forceful destruction successful, exit code 0 [2024-11-17 08:32:30,505 INFO L156 tatePredicateManager]: 13 out of 14 supporting invariants were superfluous and have been removed [2024-11-17 08:32:30,507 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-17 08:32:30,507 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-17 08:32:30,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:30,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:32:30,551 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-17 08:32:30,552 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:32:30,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:32:30,644 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-17 08:32:30,644 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:32:30,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:32:30,698 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2024-11-17 08:32:30,698 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 58 transitions. cyclomatic complexity: 9 Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 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) [2024-11-17 08:32:30,782 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 58 transitions. cyclomatic complexity: 9. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 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) Result 79 states and 90 transitions. Complement of second has 11 states. [2024-11-17 08:32:30,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 2 accepting loop states [2024-11-17 08:32:30,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 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) [2024-11-17 08:32:30,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2024-11-17 08:32:30,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 47 letters. Loop has 3 letters. [2024-11-17 08:32:30,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:32:30,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 50 letters. Loop has 3 letters. [2024-11-17 08:32:30,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:32:30,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 47 letters. Loop has 6 letters. [2024-11-17 08:32:30,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:32:30,785 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 90 transitions. [2024-11-17 08:32:30,785 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-17 08:32:30,786 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 79 states and 90 transitions. [2024-11-17 08:32:30,786 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2024-11-17 08:32:30,786 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2024-11-17 08:32:30,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 90 transitions. [2024-11-17 08:32:30,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:32:30,786 INFO L218 hiAutomatonCegarLoop]: Abstraction has 79 states and 90 transitions. [2024-11-17 08:32:30,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states and 90 transitions. [2024-11-17 08:32:30,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 70. [2024-11-17 08:32:30,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 70 states have (on average 1.1285714285714286) internal successors, (79), 69 states have internal predecessors, (79), 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) [2024-11-17 08:32:30,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2024-11-17 08:32:30,792 INFO L240 hiAutomatonCegarLoop]: Abstraction has 70 states and 79 transitions. [2024-11-17 08:32:30,792 INFO L425 stractBuchiCegarLoop]: Abstraction has 70 states and 79 transitions. [2024-11-17 08:32:30,792 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-11-17 08:32:30,792 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 79 transitions. [2024-11-17 08:32:30,793 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-17 08:32:30,793 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:32:30,793 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:32:30,793 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:32:30,793 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-17 08:32:30,793 INFO L745 eck$LassoCheckResult]: Stem: 3027#ULTIMATE.startENTRY 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); 3028#ULTIMATE.init_returnLabel#1 assume true;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; 3035#L33 assume true; 3033#L33-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; 3034#L33 assume true; 3075#L33-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; 3073#L33 assume true; 3071#L33-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; 3069#L33 assume true; 3067#L33-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; 3065#L33 assume true; 3063#L33-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; 3061#L33 assume true; 3059#L33-1 assume !(main_~i~0#1 < 5); 3055#L35-2 call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1); 3047#L35-1 assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0; 3041#L37 assume true; 3039#L37-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; 3040#L37 assume true; 3074#L37-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; 3072#L37 assume true; 3070#L37-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; 3068#L37 assume true; 3066#L37-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; 3064#L37 assume true; 3062#L37-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; 3060#L37 assume true; 3058#L37-1 assume !(main_~i~0#1 < 5); 3048#L39-2 call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1); 3036#L39-1 assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0; 3037#L42 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); 3025#L42-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; 3026#L42 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); 3038#L42-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; 3076#L42 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); 3077#L42-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; 3092#L42 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); 3091#L42-1 assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1; 3090#L45 main_~nc_B~0#1 := 0; 3089#L46 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); 3088#L46-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; 3087#L46 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); 3086#L46-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; 3085#L46 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); 3084#L46-1 assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1; 3046#L49-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; 3043#L53 assume true; 3049#L53-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); 3050#L55 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; 3056#L53 [2024-11-17 08:32:30,795 INFO L747 eck$LassoCheckResult]: Loop: 3056#L53 assume true; 3057#L53-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); 3078#L55 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; 3056#L53 [2024-11-17 08:32:30,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:30,795 INFO L85 PathProgramCache]: Analyzing trace with hash -522044536, now seen corresponding path program 4 times [2024-11-17 08:32:30,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:32:30,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263760884] [2024-11-17 08:32:30,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:32:30,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:32:30,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:32:30,939 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-17 08:32:30,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:32:30,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263760884] [2024-11-17 08:32:30,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263760884] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:32:30,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278100138] [2024-11-17 08:32:30,939 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-17 08:32:30,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:32:30,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:30,943 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:32:30,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Waiting until timeout for monitored process [2024-11-17 08:32:31,053 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-17 08:32:31,053 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:32:31,054 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-17 08:32:31,055 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:32:31,140 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-17 08:32:31,140 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:32:31,200 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 [2024-11-17 08:32:31,223 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-17 08:32:31,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [278100138] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:32:31,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:32:31,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2024-11-17 08:32:31,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995088387] [2024-11-17 08:32:31,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:32:31,224 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:32:31,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:31,224 INFO L85 PathProgramCache]: Analyzing trace with hash 47628, now seen corresponding path program 7 times [2024-11-17 08:32:31,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:32:31,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297365342] [2024-11-17 08:32:31,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:32:31,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:32:31,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:31,227 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:32:31,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:31,229 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:32:31,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:32:31,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-17 08:32:31,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2024-11-17 08:32:31,285 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. cyclomatic complexity: 15 Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 14 states have internal predecessors, (45), 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) [2024-11-17 08:32:31,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:32:31,355 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2024-11-17 08:32:31,355 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 98 transitions. [2024-11-17 08:32:31,356 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2024-11-17 08:32:31,356 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 84 states and 96 transitions. [2024-11-17 08:32:31,356 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2024-11-17 08:32:31,356 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2024-11-17 08:32:31,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 96 transitions. [2024-11-17 08:32:31,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:32:31,357 INFO L218 hiAutomatonCegarLoop]: Abstraction has 84 states and 96 transitions. [2024-11-17 08:32:31,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 96 transitions. [2024-11-17 08:32:31,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 72. [2024-11-17 08:32:31,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 72 states have (on average 1.125) internal successors, (81), 71 states have internal predecessors, (81), 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) [2024-11-17 08:32:31,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2024-11-17 08:32:31,359 INFO L240 hiAutomatonCegarLoop]: Abstraction has 72 states and 81 transitions. [2024-11-17 08:32:31,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 08:32:31,364 INFO L425 stractBuchiCegarLoop]: Abstraction has 72 states and 81 transitions. [2024-11-17 08:32:31,364 INFO L332 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2024-11-17 08:32:31,364 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 81 transitions. [2024-11-17 08:32:31,365 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-17 08:32:31,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:32:31,365 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:32:31,365 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:32:31,365 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-17 08:32:31,365 INFO L745 eck$LassoCheckResult]: Stem: 3492#ULTIMATE.startENTRY 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); 3493#ULTIMATE.init_returnLabel#1 assume true;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; 3500#L33 assume true; 3498#L33-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; 3499#L33 assume true; 3543#L33-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; 3541#L33 assume true; 3539#L33-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; 3537#L33 assume true; 3535#L33-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; 3533#L33 assume true; 3531#L33-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; 3529#L33 assume true; 3527#L33-1 assume !(main_~i~0#1 < 5); 3519#L35-2 call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1); 3511#L35-1 assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0; 3504#L37 assume true; 3505#L37-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; 3506#L37 assume true; 3542#L37-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; 3540#L37 assume true; 3538#L37-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; 3536#L37 assume true; 3534#L37-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; 3532#L37 assume true; 3530#L37-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; 3528#L37 assume true; 3526#L37-1 assume !(main_~i~0#1 < 5); 3512#L39-2 call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1); 3501#L39-1 assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0; 3502#L42 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); 3490#L42-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; 3491#L42 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); 3503#L42-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; 3551#L42 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); 3488#L42-1 assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1; 3489#L45 main_~nc_B~0#1 := 0; 3515#L46 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); 3516#L46-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; 3517#L46 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); 3518#L46-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; 3544#L46 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); 3545#L46-1 assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1; 3559#L49-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; 3552#L53 assume true; 3513#L53-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); 3507#L55 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; 3508#L53 assume true; 3557#L53-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); 3556#L55 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; 3522#L53 [2024-11-17 08:32:31,366 INFO L747 eck$LassoCheckResult]: Loop: 3522#L53 assume true; 3523#L53-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); 3555#L55 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; 3522#L53 [2024-11-17 08:32:31,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:31,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1726691751, now seen corresponding path program 5 times [2024-11-17 08:32:31,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:32:31,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732953343] [2024-11-17 08:32:31,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:32:31,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:32:31,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:31,381 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:32:31,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:31,393 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:32:31,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:31,394 INFO L85 PathProgramCache]: Analyzing trace with hash 47628, now seen corresponding path program 8 times [2024-11-17 08:32:31,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:32:31,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979976833] [2024-11-17 08:32:31,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:32:31,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:32:31,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:31,397 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:32:31,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:31,399 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:32:31,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:31,399 INFO L85 PathProgramCache]: Analyzing trace with hash -949332314, now seen corresponding path program 3 times [2024-11-17 08:32:31,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:32:31,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42255426] [2024-11-17 08:32:31,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:32:31,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:32:31,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:32:31,531 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-17 08:32:31,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:32:31,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42255426] [2024-11-17 08:32:31,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42255426] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:32:31,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280645511] [2024-11-17 08:32:31,532 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 08:32:31,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:32:31,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:31,535 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:32:31,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (116)] Waiting until timeout for monitored process [2024-11-17 08:32:31,633 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-17 08:32:31,633 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:32:31,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-17 08:32:31,635 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:32:31,714 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-17 08:32:31,715 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:32:31,771 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-17 08:32:31,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280645511] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:32:31,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:32:31,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2024-11-17 08:32:31,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867489102] [2024-11-17 08:32:31,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:32:31,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:32:31,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-17 08:32:31,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-17 08:32:31,817 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. cyclomatic complexity: 15 Second operand has 16 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 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) [2024-11-17 08:32:32,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:32:32,010 INFO L93 Difference]: Finished difference Result 113 states and 123 transitions. [2024-11-17 08:32:32,010 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 113 states and 123 transitions. [2024-11-17 08:32:32,011 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-17 08:32:32,011 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 113 states to 59 states and 64 transitions. [2024-11-17 08:32:32,011 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-11-17 08:32:32,011 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-11-17 08:32:32,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 64 transitions. [2024-11-17 08:32:32,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:32:32,011 INFO L218 hiAutomatonCegarLoop]: Abstraction has 59 states and 64 transitions. [2024-11-17 08:32:32,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 64 transitions. [2024-11-17 08:32:32,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2024-11-17 08:32:32,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 57 states have (on average 1.087719298245614) internal successors, (62), 56 states have internal predecessors, (62), 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) [2024-11-17 08:32:32,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2024-11-17 08:32:32,013 INFO L240 hiAutomatonCegarLoop]: Abstraction has 57 states and 62 transitions. [2024-11-17 08:32:32,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-17 08:32:32,013 INFO L425 stractBuchiCegarLoop]: Abstraction has 57 states and 62 transitions. [2024-11-17 08:32:32,013 INFO L332 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2024-11-17 08:32:32,013 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 62 transitions. [2024-11-17 08:32:32,015 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-17 08:32:32,015 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:32:32,015 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:32:32,016 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:32:32,016 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-17 08:32:32,016 INFO L745 eck$LassoCheckResult]: Stem: 4032#ULTIMATE.startENTRY 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); 4033#ULTIMATE.init_returnLabel#1 assume true;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; 4040#L33 assume true; 4038#L33-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; 4039#L33 assume true; 4079#L33-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; 4077#L33 assume true; 4075#L33-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; 4073#L33 assume true; 4071#L33-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; 4069#L33 assume true; 4068#L33-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; 4067#L33 assume true; 4066#L33-1 assume !(main_~i~0#1 < 5); 4059#L35-2 call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1); 4053#L35-1 assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0; 4045#L37 assume true; 4046#L37-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; 4047#L37 assume true; 4082#L37-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; 4081#L37 assume true; 4080#L37-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; 4078#L37 assume true; 4076#L37-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; 4074#L37 assume true; 4072#L37-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; 4070#L37 assume true; 4065#L37-1 assume !(main_~i~0#1 < 5); 4054#L39-2 call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1); 4041#L39-1 assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0; 4042#L42 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); 4043#L42-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; 4044#L42 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); 4030#L42-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; 4031#L42 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); 4062#L42-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; 4061#L42 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); 4028#L42-1 assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1; 4029#L45 main_~nc_B~0#1 := 0; 4057#L46 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); 4036#L46-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; 4037#L46 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); 4058#L46-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; 4084#L46 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); 4064#L46-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; 4063#L46 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); 4034#L46-1 assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1; 4035#L49-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; 4052#L53 assume true; 4055#L53-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); 4048#L55 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; 4049#L53 [2024-11-17 08:32:32,016 INFO L747 eck$LassoCheckResult]: Loop: 4049#L53 assume true; 4060#L53-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); 4083#L55 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; 4049#L53 [2024-11-17 08:32:32,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:32,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1542837593, now seen corresponding path program 6 times [2024-11-17 08:32:32,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:32:32,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057678306] [2024-11-17 08:32:32,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:32:32,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:32:32,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:32,035 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:32:32,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:32,053 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:32:32,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:32,053 INFO L85 PathProgramCache]: Analyzing trace with hash 47628, now seen corresponding path program 9 times [2024-11-17 08:32:32,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:32:32,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425144592] [2024-11-17 08:32:32,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:32:32,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:32:32,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:32,056 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:32:32,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:32,058 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:32:32,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:32,058 INFO L85 PathProgramCache]: Analyzing trace with hash 2065286566, now seen corresponding path program 4 times [2024-11-17 08:32:32,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:32:32,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795087678] [2024-11-17 08:32:32,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:32:32,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:32:32,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:32,080 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:32:32,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:32,095 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:32:35,797 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:32:35,797 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:32:35,797 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:32:35,797 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:32:35,797 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:32:35,798 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:35,798 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:32:35,798 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:32:35,798 INFO L132 ssoRankerPreferences]: Filename of dumped script: string-1.i_Iteration16_Lasso [2024-11-17 08:32:35,798 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:32:35,798 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:32:35,799 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:36,257 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:36,259 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:36,267 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:36,269 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:36,271 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:36,272 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:36,274 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:36,275 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:36,276 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:36,277 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:36,280 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:36,282 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:36,283 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:36,284 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:36,286 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:36,287 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:36,781 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:32:36,781 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:32:36,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:36,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:36,786 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) [2024-11-17 08:32:36,787 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 [2024-11-17 08:32:36,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 [2024-11-17 08:32:36,798 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:36,798 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:36,798 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:36,798 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:36,800 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:32:36,800 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:36,802 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:36,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Forceful destruction successful, exit code 0 [2024-11-17 08:32:36,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:36,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:36,814 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) [2024-11-17 08:32:36,814 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 [2024-11-17 08:32:36,815 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:36,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:36,825 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-11-17 08:32:36,825 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:36,825 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:36,827 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2024-11-17 08:32:36,827 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:36,829 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:36,839 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 [2024-11-17 08:32:36,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:36,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:36,841 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) [2024-11-17 08:32:36,842 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 [2024-11-17 08:32:36,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 [2024-11-17 08:32:36,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:36,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:36,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:36,852 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:36,854 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:32:36,854 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:36,857 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:36,867 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 [2024-11-17 08:32:36,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:36,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:36,868 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) [2024-11-17 08:32:36,869 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 [2024-11-17 08:32:36,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 [2024-11-17 08:32:36,879 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:36,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:36,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:36,880 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:36,881 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:32:36,881 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:36,884 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:36,894 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 [2024-11-17 08:32:36,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:36,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:36,896 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) [2024-11-17 08:32:36,898 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 [2024-11-17 08:32:36,898 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:36,908 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:36,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:36,908 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:36,908 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:36,911 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:32:36,911 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:36,917 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:32:36,933 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2024-11-17 08:32:36,934 INFO L444 ModelExtractionUtils]: 0 out of 16 variables were initially zero. Simplification set additionally 12 variables to zero. [2024-11-17 08:32:36,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:36,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:36,935 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) [2024-11-17 08:32:36,939 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 [2024-11-17 08:32:36,939 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:32:36,950 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2024-11-17 08:32:36,951 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:32:36,951 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#string_B~0#1.base)_6, ULTIMATE.start_main_~j~0#1) = 1*v_rep(select #length ULTIMATE.start_main_~#string_B~0#1.base)_6 - 1*ULTIMATE.start_main_~j~0#1 Supporting invariants [1*ULTIMATE.start_main_~#string_B~0#1.offset >= 0] [2024-11-17 08:32:36,961 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 [2024-11-17 08:32:36,992 INFO L156 tatePredicateManager]: 13 out of 14 supporting invariants were superfluous and have been removed [2024-11-17 08:32:36,994 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-17 08:32:36,994 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-17 08:32:37,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:37,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:32:37,049 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 08:32:37,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:32:37,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:32:37,330 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 08:32:37,331 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:32:37,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:32:37,355 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 [2024-11-17 08:32:37,355 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 57 states and 62 transitions. cyclomatic complexity: 9 Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 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) [2024-11-17 08:32:37,387 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 57 states and 62 transitions. cyclomatic complexity: 9. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 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 63 states and 70 transitions. Complement of second has 8 states. [2024-11-17 08:32:37,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-17 08:32:37,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 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) [2024-11-17 08:32:37,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2024-11-17 08:32:37,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 51 letters. Loop has 3 letters. [2024-11-17 08:32:37,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:32:37,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 54 letters. Loop has 3 letters. [2024-11-17 08:32:37,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:32:37,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 51 letters. Loop has 6 letters. [2024-11-17 08:32:37,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:32:37,389 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 70 transitions. [2024-11-17 08:32:37,389 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-17 08:32:37,390 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 63 states and 70 transitions. [2024-11-17 08:32:37,390 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2024-11-17 08:32:37,390 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2024-11-17 08:32:37,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 70 transitions. [2024-11-17 08:32:37,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:32:37,390 INFO L218 hiAutomatonCegarLoop]: Abstraction has 63 states and 70 transitions. [2024-11-17 08:32:37,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 70 transitions. [2024-11-17 08:32:37,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-17 08:32:37,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 62 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) [2024-11-17 08:32:37,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2024-11-17 08:32:37,392 INFO L240 hiAutomatonCegarLoop]: Abstraction has 63 states and 70 transitions. [2024-11-17 08:32:37,392 INFO L425 stractBuchiCegarLoop]: Abstraction has 63 states and 70 transitions. [2024-11-17 08:32:37,392 INFO L332 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2024-11-17 08:32:37,392 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 70 transitions. [2024-11-17 08:32:37,392 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-17 08:32:37,392 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:32:37,392 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:32:37,393 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:32:37,393 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-17 08:32:37,393 INFO L745 eck$LassoCheckResult]: Stem: 4400#ULTIMATE.startENTRY 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); 4401#ULTIMATE.init_returnLabel#1 assume true;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; 4408#L33 assume true; 4406#L33-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; 4407#L33 assume true; 4451#L33-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; 4450#L33 assume true; 4448#L33-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; 4446#L33 assume true; 4444#L33-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; 4442#L33 assume true; 4440#L33-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; 4438#L33 assume true; 4436#L33-1 assume !(main_~i~0#1 < 5); 4427#L35-2 call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1); 4421#L35-1 assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0; 4413#L37 assume true; 4414#L37-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; 4415#L37 assume true; 4449#L37-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; 4447#L37 assume true; 4445#L37-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; 4443#L37 assume true; 4441#L37-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; 4439#L37 assume true; 4437#L37-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; 4435#L37 assume true; 4434#L37-1 assume !(main_~i~0#1 < 5); 4422#L39-2 call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1); 4409#L39-1 assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0; 4410#L42 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); 4411#L42-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; 4412#L42 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); 4398#L42-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; 4399#L42 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); 4431#L42-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; 4430#L42 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); 4396#L42-1 assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1; 4397#L45 main_~nc_B~0#1 := 0; 4425#L46 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); 4404#L46-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; 4405#L46 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); 4426#L46-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; 4452#L46 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); 4433#L46-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; 4432#L46 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); 4402#L46-1 assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1; 4403#L49-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; 4420#L53 assume true; 4423#L53-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); 4416#L55 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; 4417#L53 assume true; 4455#L53-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); 4454#L55 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; 4428#L53 [2024-11-17 08:32:37,393 INFO L747 eck$LassoCheckResult]: Loop: 4428#L53 assume true; 4429#L53-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); 4453#L55 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; 4428#L53 [2024-11-17 08:32:37,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:37,393 INFO L85 PathProgramCache]: Analyzing trace with hash 2065286567, now seen corresponding path program 7 times [2024-11-17 08:32:37,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:32:37,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421256959] [2024-11-17 08:32:37,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:32:37,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:32:37,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:37,420 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:32:37,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:37,455 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:32:37,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:37,458 INFO L85 PathProgramCache]: Analyzing trace with hash 47628, now seen corresponding path program 10 times [2024-11-17 08:32:37,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:32:37,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941956881] [2024-11-17 08:32:37,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:32:37,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:32:37,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:37,465 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:32:37,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:37,471 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:32:37,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:37,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1545620134, now seen corresponding path program 5 times [2024-11-17 08:32:37,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:32:37,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692328393] [2024-11-17 08:32:37,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:32:37,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:32:37,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:37,519 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:32:37,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:37,552 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:32:39,313 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 [2024-11-17 08:32:42,757 WARN L286 SmtUtils]: Spent 5.10s on a formula simplification. DAG size of input: 383 DAG size of output: 289 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-11-17 08:32:43,604 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:32:43,604 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:32:43,604 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:32:43,604 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:32:43,604 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:32:43,604 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:43,604 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:32:43,604 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:32:43,604 INFO L132 ssoRankerPreferences]: Filename of dumped script: string-1.i_Iteration17_Lasso [2024-11-17 08:32:43,604 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:32:43,604 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:32:43,606 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:43,608 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:43,609 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:43,611 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:43,613 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:43,615 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:43,616 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:43,618 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:43,619 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:43,621 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:43,622 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:43,624 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:43,626 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:43,627 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:43,636 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:44,113 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:44,115 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:44,253 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2024-11-17 08:32:45,498 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:32:45,498 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:32:45,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:45,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:45,500 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) [2024-11-17 08:32:45,504 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 [2024-11-17 08:32:45,504 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:45,514 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:45,515 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:45,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:45,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:45,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:45,515 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:45,515 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:45,516 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:45,526 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 [2024-11-17 08:32:45,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:45,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:45,528 INFO L229 MonitoredProcess]: Starting monitored process 124 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:32:45,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2024-11-17 08:32:45,530 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:45,540 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:45,540 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:45,540 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:45,540 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:45,540 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:45,541 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:45,541 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:45,541 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:45,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Forceful destruction successful, exit code 0 [2024-11-17 08:32:45,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:45,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:45,553 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:32:45,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2024-11-17 08:32:45,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 [2024-11-17 08:32:45,565 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:45,565 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:45,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:45,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:45,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:45,565 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:45,565 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:45,566 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:45,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Forceful destruction successful, exit code 0 [2024-11-17 08:32:45,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:45,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:45,578 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) [2024-11-17 08:32:45,579 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 [2024-11-17 08:32:45,579 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:45,589 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:45,589 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:45,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:45,590 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:45,590 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:45,590 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:45,590 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:45,591 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:45,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Forceful destruction successful, exit code 0 [2024-11-17 08:32:45,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:45,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:45,603 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) [2024-11-17 08:32:45,604 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 [2024-11-17 08:32:45,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 [2024-11-17 08:32:45,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:45,615 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:45,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:45,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:45,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:45,615 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:45,615 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:45,616 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:45,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Forceful destruction successful, exit code 0 [2024-11-17 08:32:45,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:45,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:45,628 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) [2024-11-17 08:32:45,629 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 [2024-11-17 08:32:45,630 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:45,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:45,640 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:45,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:45,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:45,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:45,641 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:45,641 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:45,643 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:45,654 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 [2024-11-17 08:32:45,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:45,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:45,657 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) [2024-11-17 08:32:45,658 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 [2024-11-17 08:32:45,658 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:45,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:45,669 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:45,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:45,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:45,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:45,669 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:45,669 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:45,670 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:45,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Forceful destruction successful, exit code 0 [2024-11-17 08:32:45,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:45,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:45,682 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) [2024-11-17 08:32:45,682 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 [2024-11-17 08:32:45,683 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:45,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:45,693 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:45,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:45,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:45,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:45,694 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:45,694 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:45,695 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:45,705 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 [2024-11-17 08:32:45,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:45,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:45,707 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) [2024-11-17 08:32:45,707 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 [2024-11-17 08:32:45,708 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:45,718 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:45,718 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:45,718 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:45,718 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:45,718 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:45,718 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:45,719 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:45,720 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:45,730 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 [2024-11-17 08:32:45,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:45,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:45,732 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) [2024-11-17 08:32:45,733 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 [2024-11-17 08:32:45,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 [2024-11-17 08:32:45,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:45,744 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:45,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:45,744 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:45,744 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:45,744 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:45,744 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:45,745 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:45,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Forceful destruction successful, exit code 0 [2024-11-17 08:32:45,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:45,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:45,757 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) [2024-11-17 08:32:45,762 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 [2024-11-17 08:32:45,763 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:45,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:45,774 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:45,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:45,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:45,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:45,774 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:45,774 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:45,775 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:45,786 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 [2024-11-17 08:32:45,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:45,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:45,788 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) [2024-11-17 08:32:45,788 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 [2024-11-17 08:32:45,789 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:45,798 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:45,799 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:45,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:45,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:45,799 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:45,799 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:45,799 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:45,800 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:45,810 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 [2024-11-17 08:32:45,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:45,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:45,813 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) [2024-11-17 08:32:45,814 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 [2024-11-17 08:32:45,814 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:45,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:45,825 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:45,825 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:45,825 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:45,825 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:45,826 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:45,826 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:45,827 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:45,837 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 [2024-11-17 08:32:45,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:45,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:45,838 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) [2024-11-17 08:32:45,839 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 [2024-11-17 08:32:45,840 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:45,850 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:45,850 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:45,850 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:45,850 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:45,851 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:32:45,851 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:45,854 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:45,864 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 [2024-11-17 08:32:45,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:45,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:45,865 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) [2024-11-17 08:32:45,866 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 [2024-11-17 08:32:45,866 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:45,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:45,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:45,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:45,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:45,877 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:32:45,877 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:45,879 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:45,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Ended with exit code 0 [2024-11-17 08:32:45,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:45,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:45,893 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) [2024-11-17 08:32:45,894 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 [2024-11-17 08:32:45,894 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:45,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:45,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:45,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:45,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:45,907 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:32:45,907 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:45,913 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:32:45,927 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2024-11-17 08:32:45,927 INFO L444 ModelExtractionUtils]: 1 out of 16 variables were initially zero. Simplification set additionally 12 variables to zero. [2024-11-17 08:32:45,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:45,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:45,929 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) [2024-11-17 08:32:45,930 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 [2024-11-17 08:32:45,930 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:32:45,941 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-17 08:32:45,941 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:32:45,941 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 [] [2024-11-17 08:32:45,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Ended with exit code 0 [2024-11-17 08:32:45,978 INFO L156 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2024-11-17 08:32:45,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:46,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:32:46,034 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-17 08:32:46,038 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:32:46,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:32:46,152 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 08:32:46,152 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:32:46,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:32:46,173 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 [2024-11-17 08:32:46,173 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 63 states and 70 transitions. cyclomatic complexity: 12 Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 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) [2024-11-17 08:32:46,240 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 63 states and 70 transitions. cyclomatic complexity: 12. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 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) Result 95 states and 110 transitions. Complement of second has 12 states. [2024-11-17 08:32:46,241 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 [2024-11-17 08:32:46,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 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) [2024-11-17 08:32:46,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 45 transitions. [2024-11-17 08:32:46,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 45 transitions. Stem has 54 letters. Loop has 3 letters. [2024-11-17 08:32:46,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:32:46,241 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-17 08:32:46,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:46,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:32:46,296 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-17 08:32:46,297 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:32:46,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:32:46,397 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 08:32:46,397 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:32:46,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:32:46,418 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 [2024-11-17 08:32:46,418 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 63 states and 70 transitions. cyclomatic complexity: 12 Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 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) [2024-11-17 08:32:46,483 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 63 states and 70 transitions. cyclomatic complexity: 12. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 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) Result 95 states and 110 transitions. Complement of second has 12 states. [2024-11-17 08:32:46,484 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 [2024-11-17 08:32:46,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 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) [2024-11-17 08:32:46,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 45 transitions. [2024-11-17 08:32:46,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 45 transitions. Stem has 54 letters. Loop has 3 letters. [2024-11-17 08:32:46,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:32:46,484 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-17 08:32:46,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:46,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:32:46,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-17 08:32:46,541 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:32:46,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:32:46,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 08:32:46,647 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:32:46,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:32:46,666 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 [2024-11-17 08:32:46,666 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 63 states and 70 transitions. cyclomatic complexity: 12 Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 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) [2024-11-17 08:32:46,732 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 63 states and 70 transitions. cyclomatic complexity: 12. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 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) Result 103 states and 120 transitions. Complement of second has 11 states. [2024-11-17 08:32:46,732 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 [2024-11-17 08:32:46,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 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) [2024-11-17 08:32:46,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 47 transitions. [2024-11-17 08:32:46,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 47 transitions. Stem has 54 letters. Loop has 3 letters. [2024-11-17 08:32:46,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:32:46,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 47 transitions. Stem has 57 letters. Loop has 3 letters. [2024-11-17 08:32:46,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:32:46,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 47 transitions. Stem has 54 letters. Loop has 6 letters. [2024-11-17 08:32:46,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:32:46,733 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 120 transitions. [2024-11-17 08:32:46,735 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2024-11-17 08:32:46,735 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 99 states and 114 transitions. [2024-11-17 08:32:46,735 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2024-11-17 08:32:46,735 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2024-11-17 08:32:46,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 114 transitions. [2024-11-17 08:32:46,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:32:46,735 INFO L218 hiAutomatonCegarLoop]: Abstraction has 99 states and 114 transitions. [2024-11-17 08:32:46,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 114 transitions. [2024-11-17 08:32:46,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 82. [2024-11-17 08:32:46,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 81 states have internal predecessors, (93), 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) [2024-11-17 08:32:46,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2024-11-17 08:32:46,737 INFO L240 hiAutomatonCegarLoop]: Abstraction has 82 states and 93 transitions. [2024-11-17 08:32:46,737 INFO L425 stractBuchiCegarLoop]: Abstraction has 82 states and 93 transitions. [2024-11-17 08:32:46,737 INFO L332 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2024-11-17 08:32:46,737 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 93 transitions. [2024-11-17 08:32:46,738 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2024-11-17 08:32:46,738 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:32:46,738 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:32:46,738 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:32:46,739 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-17 08:32:46,739 INFO L745 eck$LassoCheckResult]: Stem: 5413#ULTIMATE.startENTRY 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); 5414#ULTIMATE.init_returnLabel#1 assume true;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; 5421#L33 assume true; 5419#L33-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; 5420#L33 assume true; 5462#L33-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; 5460#L33 assume true; 5458#L33-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; 5456#L33 assume true; 5454#L33-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; 5452#L33 assume true; 5450#L33-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; 5448#L33 assume true; 5446#L33-1 assume !(main_~i~0#1 < 5); 5442#L35-2 call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1); 5434#L35-1 assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0; 5427#L37 assume true; 5428#L37-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; 5429#L37 assume true; 5461#L37-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; 5459#L37 assume true; 5457#L37-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; 5455#L37 assume true; 5453#L37-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; 5451#L37 assume true; 5449#L37-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; 5447#L37 assume true; 5445#L37-1 assume !(main_~i~0#1 < 5); 5436#L39-2 call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1); 5422#L39-1 assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0; 5423#L42 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); 5424#L42-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; 5465#L42 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); 5466#L42-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; 5425#L42 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); 5426#L42-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; 5490#L42 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); 5489#L42-1 assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1; 5488#L45 main_~nc_B~0#1 := 0; 5487#L46 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); 5486#L46-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; 5485#L46 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); 5484#L46-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; 5483#L46 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); 5482#L46-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; 5481#L46 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); 5480#L46-1 assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1; 5435#L49-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; 5431#L53 [2024-11-17 08:32:46,739 INFO L747 eck$LassoCheckResult]: Loop: 5431#L53 assume true; 5437#L53-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); 5430#L55 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; 5431#L53 [2024-11-17 08:32:46,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:46,739 INFO L85 PathProgramCache]: Analyzing trace with hash -293870169, now seen corresponding path program 2 times [2024-11-17 08:32:46,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:32:46,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550428027] [2024-11-17 08:32:46,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:32:46,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:32:46,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:46,757 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:32:46,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:46,772 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:32:46,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:46,772 INFO L85 PathProgramCache]: Analyzing trace with hash 47629, now seen corresponding path program 1 times [2024-11-17 08:32:46,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:32:46,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973882549] [2024-11-17 08:32:46,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:32:46,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:32:46,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:46,776 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:32:46,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:46,778 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:32:46,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:46,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1542837593, now seen corresponding path program 8 times [2024-11-17 08:32:46,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:32:46,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994204817] [2024-11-17 08:32:46,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:32:46,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:32:46,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:46,798 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:32:46,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:46,812 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:32:47,720 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 [2024-11-17 08:32:52,079 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:32:52,079 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:32:52,079 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:32:52,079 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:32:52,079 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:32:52,079 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:52,079 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:32:52,079 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:32:52,079 INFO L132 ssoRankerPreferences]: Filename of dumped script: string-1.i_Iteration18_Lasso [2024-11-17 08:32:52,079 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:32:52,079 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:32:52,081 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:52,083 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:52,085 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:52,086 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:52,467 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:52,468 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:52,470 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:52,471 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:52,478 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:52,479 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:52,481 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:52,482 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:52,483 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:52,485 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:52,486 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:52,487 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:52,489 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:52,761 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:32:52,761 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:32:52,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:52,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:52,763 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) [2024-11-17 08:32:52,764 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 [2024-11-17 08:32:52,765 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:52,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:52,774 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:52,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:52,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:52,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:52,775 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:52,775 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:52,776 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:52,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Ended with exit code 0 [2024-11-17 08:32:52,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:52,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:52,787 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) [2024-11-17 08:32:52,789 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:52,789 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 [2024-11-17 08:32:52,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:52,799 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:52,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:52,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:52,799 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:52,800 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:52,800 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:52,801 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:52,811 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 [2024-11-17 08:32:52,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:52,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:52,813 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) [2024-11-17 08:32:52,814 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 [2024-11-17 08:32:52,814 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:52,824 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:52,824 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:52,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:52,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:52,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:52,825 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:52,825 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:52,826 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:52,836 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 [2024-11-17 08:32:52,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:52,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:52,837 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) [2024-11-17 08:32:52,838 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 [2024-11-17 08:32:52,839 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:52,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:52,849 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-11-17 08:32:52,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:52,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:52,851 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2024-11-17 08:32:52,851 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:52,853 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:52,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Forceful destruction successful, exit code 0 [2024-11-17 08:32:52,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:52,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:52,865 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) [2024-11-17 08:32:52,866 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 [2024-11-17 08:32:52,867 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:52,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:52,877 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2024-11-17 08:32:52,877 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2024-11-17 08:32:52,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:52,883 INFO L401 nArgumentSynthesizer]: We have 28 Motzkin's Theorem applications. [2024-11-17 08:32:52,883 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2024-11-17 08:32:52,897 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:52,909 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 [2024-11-17 08:32:52,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:52,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:52,914 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) [2024-11-17 08:32:52,914 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 [2024-11-17 08:32:52,915 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:52,925 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:52,925 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:52,925 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:52,925 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:52,926 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:32:52,927 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:52,929 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:52,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Forceful destruction successful, exit code 0 [2024-11-17 08:32:52,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:52,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:52,941 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) [2024-11-17 08:32:52,942 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 [2024-11-17 08:32:52,942 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:52,952 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:52,952 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-11-17 08:32:52,952 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:52,952 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:52,953 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2024-11-17 08:32:52,953 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:52,957 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:52,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Forceful destruction successful, exit code 0 [2024-11-17 08:32:52,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:52,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:52,972 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) [2024-11-17 08:32:52,973 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 [2024-11-17 08:32:52,973 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:52,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:52,983 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2024-11-17 08:32:52,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:52,983 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:52,984 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2024-11-17 08:32:52,984 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:52,988 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:53,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Forceful destruction successful, exit code 0 [2024-11-17 08:32:53,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:53,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:53,002 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) [2024-11-17 08:32:53,003 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 [2024-11-17 08:32:53,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 [2024-11-17 08:32:53,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:53,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:53,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:53,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:53,018 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:32:53,018 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:32:53,027 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:32:53,039 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-11-17 08:32:53,039 INFO L444 ModelExtractionUtils]: 0 out of 28 variables were initially zero. Simplification set additionally 23 variables to zero. [2024-11-17 08:32:53,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:53,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:53,041 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) [2024-11-17 08:32:53,045 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 [2024-11-17 08:32:53,046 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:32:53,057 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-17 08:32:53,057 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:32:53,057 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~#string_B~0#1.offset, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~j~0#1, ULTIMATE.start_main_~nc_A~0#1) = 1*ULTIMATE.start_main_~#string_B~0#1.offset - 1*ULTIMATE.start_main_~i~0#1 + 1*ULTIMATE.start_main_~j~0#1 + 1*ULTIMATE.start_main_~nc_A~0#1 Supporting invariants [] [2024-11-17 08:32:53,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Forceful destruction successful, exit code 0 [2024-11-17 08:32:53,091 INFO L156 tatePredicateManager]: 12 out of 12 supporting invariants were superfluous and have been removed [2024-11-17 08:32:53,092 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~#string_B~0!offset [2024-11-17 08:32:53,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:53,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:32:53,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:32:53,134 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:32:53,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:32:53,175 INFO L255 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 08:32:53,176 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:32:53,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:32:53,189 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 [2024-11-17 08:32:53,189 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 82 states and 93 transitions. cyclomatic complexity: 18 Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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) [2024-11-17 08:32:53,203 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 82 states and 93 transitions. cyclomatic complexity: 18. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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 109 states and 130 transitions. Complement of second has 6 states. [2024-11-17 08:32:53,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-17 08:32:53,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 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) [2024-11-17 08:32:53,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2024-11-17 08:32:53,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 48 letters. Loop has 3 letters. [2024-11-17 08:32:53,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:32:53,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 51 letters. Loop has 3 letters. [2024-11-17 08:32:53,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:32:53,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 48 letters. Loop has 6 letters. [2024-11-17 08:32:53,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:32:53,205 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 130 transitions. [2024-11-17 08:32:53,207 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-17 08:32:53,207 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 70 states and 78 transitions. [2024-11-17 08:32:53,207 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2024-11-17 08:32:53,207 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2024-11-17 08:32:53,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 78 transitions. [2024-11-17 08:32:53,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:32:53,207 INFO L218 hiAutomatonCegarLoop]: Abstraction has 70 states and 78 transitions. [2024-11-17 08:32:53,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 78 transitions. [2024-11-17 08:32:53,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2024-11-17 08:32:53,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 1.1029411764705883) internal successors, (75), 67 states have internal predecessors, (75), 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) [2024-11-17 08:32:53,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2024-11-17 08:32:53,209 INFO L240 hiAutomatonCegarLoop]: Abstraction has 68 states and 75 transitions. [2024-11-17 08:32:53,209 INFO L425 stractBuchiCegarLoop]: Abstraction has 68 states and 75 transitions. [2024-11-17 08:32:53,209 INFO L332 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2024-11-17 08:32:53,209 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 75 transitions. [2024-11-17 08:32:53,209 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-17 08:32:53,209 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:32:53,209 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:32:53,212 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:32:53,212 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-17 08:32:53,212 INFO L745 eck$LassoCheckResult]: Stem: 5827#ULTIMATE.startENTRY 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); 5828#ULTIMATE.init_returnLabel#1 assume true;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; 5835#L33 assume true; 5833#L33-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; 5834#L33 assume true; 5881#L33-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; 5880#L33 assume true; 5879#L33-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; 5878#L33 assume true; 5877#L33-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; 5876#L33 assume true; 5875#L33-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; 5873#L33 assume true; 5871#L33-1 assume !(main_~i~0#1 < 5); 5856#L35-2 call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1); 5848#L35-1 assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0; 5849#L37 assume true; 5842#L37-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; 5840#L37 assume true; 5841#L37-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; 5874#L37 assume true; 5872#L37-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; 5870#L37 assume true; 5869#L37-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; 5868#L37 assume true; 5867#L37-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; 5866#L37 assume true; 5865#L37-1 assume !(main_~i~0#1 < 5); 5850#L39-2 call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1); 5836#L39-1 assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0; 5837#L42 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); 5838#L42-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; 5839#L42 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); 5825#L42-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; 5826#L42 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); 5883#L42-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; 5882#L42 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); 5861#L42-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; 5860#L42 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); 5823#L42-1 assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1; 5824#L45 main_~nc_B~0#1 := 0; 5854#L46 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); 5831#L46-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; 5832#L46 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); 5855#L46-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; 5864#L46 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); 5863#L46-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; 5862#L46 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); 5829#L46-1 assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1; 5830#L49-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; 5847#L53 assume true; 5857#L53-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); 5845#L55 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; 5846#L53 assume true; 5890#L53-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); 5886#L55 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; 5884#L53 assume true; 5851#L53-1 [2024-11-17 08:32:53,212 INFO L747 eck$LassoCheckResult]: Loop: 5851#L53-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); 5843#L55 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; 5844#L53 assume true; 5851#L53-1 [2024-11-17 08:32:53,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:53,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1558871252, now seen corresponding path program 9 times [2024-11-17 08:32:53,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:32:53,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256711082] [2024-11-17 08:32:53,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:32:53,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:32:53,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:32:53,382 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 12 proven. 20 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-17 08:32:53,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:32:53,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256711082] [2024-11-17 08:32:53,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256711082] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:32:53,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603318746] [2024-11-17 08:32:53,383 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 08:32:53,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:32:53,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:53,385 INFO L229 MonitoredProcess]: Starting monitored process 150 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:32:53,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (150)] Waiting until timeout for monitored process [2024-11-17 08:32:53,513 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-17 08:32:53,513 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:32:53,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-17 08:32:53,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:32:53,592 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-17 08:32:53,593 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:32:53,701 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-17 08:32:53,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603318746] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:32:53,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:32:53,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2024-11-17 08:32:53,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007461234] [2024-11-17 08:32:53,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:32:53,702 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:32:53,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:53,703 INFO L85 PathProgramCache]: Analyzing trace with hash 46518, now seen corresponding path program 11 times [2024-11-17 08:32:53,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:32:53,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117205098] [2024-11-17 08:32:53,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:32:53,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:32:53,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Forceful destruction successful, exit code 0 [2024-11-17 08:32:53,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:53,708 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:32:53,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:53,711 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:32:53,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:32:53,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-17 08:32:53,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2024-11-17 08:32:53,767 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. cyclomatic complexity: 13 Second operand has 17 states, 17 states have (on average 3.0) internal successors, (51), 17 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) [2024-11-17 08:32:53,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:32:53,825 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2024-11-17 08:32:53,825 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 81 transitions. [2024-11-17 08:32:53,825 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-17 08:32:53,826 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 72 states and 79 transitions. [2024-11-17 08:32:53,826 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2024-11-17 08:32:53,826 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2024-11-17 08:32:53,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 79 transitions. [2024-11-17 08:32:53,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:32:53,826 INFO L218 hiAutomatonCegarLoop]: Abstraction has 72 states and 79 transitions. [2024-11-17 08:32:53,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 79 transitions. [2024-11-17 08:32:53,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2024-11-17 08:32:53,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 70 states have (on average 1.1) internal successors, (77), 69 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) [2024-11-17 08:32:53,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 77 transitions. [2024-11-17 08:32:53,827 INFO L240 hiAutomatonCegarLoop]: Abstraction has 70 states and 77 transitions. [2024-11-17 08:32:53,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 08:32:53,828 INFO L425 stractBuchiCegarLoop]: Abstraction has 70 states and 77 transitions. [2024-11-17 08:32:53,828 INFO L332 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2024-11-17 08:32:53,828 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states and 77 transitions. [2024-11-17 08:32:53,828 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-17 08:32:53,829 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:32:53,829 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:32:53,829 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 5, 5, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:32:53,829 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-17 08:32:53,829 INFO L745 eck$LassoCheckResult]: Stem: 6325#ULTIMATE.startENTRY 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); 6326#ULTIMATE.init_returnLabel#1 assume true;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; 6333#L33 assume true; 6331#L33-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; 6332#L33 assume true; 6380#L33-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; 6379#L33 assume true; 6378#L33-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; 6376#L33 assume true; 6374#L33-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; 6372#L33 assume true; 6370#L33-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; 6368#L33 assume true; 6365#L33-1 assume !(main_~i~0#1 < 5); 6353#L35-2 call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1); 6346#L35-1 assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0; 6340#L37 assume true; 6338#L37-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; 6339#L37 assume true; 6377#L37-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; 6375#L37 assume true; 6373#L37-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; 6371#L37 assume true; 6369#L37-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; 6366#L37 assume true; 6362#L37-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; 6361#L37 assume true; 6360#L37-1 assume !(main_~i~0#1 < 5); 6347#L39-2 call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1); 6334#L39-1 assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0; 6335#L42 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); 6336#L42-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; 6337#L42 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); 6323#L42-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; 6324#L42 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); 6382#L42-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; 6381#L42 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); 6357#L42-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; 6356#L42 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); 6321#L42-1 assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1; 6322#L45 main_~nc_B~0#1 := 0; 6350#L46 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); 6351#L46-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; 6352#L46 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); 6329#L46-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; 6330#L46 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); 6385#L46-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; 6384#L46 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); 6359#L46-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; 6358#L46 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); 6327#L46-1 assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1; 6328#L49-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; 6345#L53 assume true; 6349#L53-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); 6343#L55 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; 6344#L53 assume true; 6383#L53-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); 6367#L55 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; 6363#L53 assume true; 6348#L53-1 [2024-11-17 08:32:53,829 INFO L747 eck$LassoCheckResult]: Loop: 6348#L53-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); 6341#L55 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; 6342#L53 assume true; 6348#L53-1 [2024-11-17 08:32:53,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:53,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1562776885, now seen corresponding path program 10 times [2024-11-17 08:32:53,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:32:53,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515614585] [2024-11-17 08:32:53,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:32:53,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:32:53,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:53,848 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:32:53,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:53,869 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:32:53,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:53,870 INFO L85 PathProgramCache]: Analyzing trace with hash 46518, now seen corresponding path program 12 times [2024-11-17 08:32:53,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:32:53,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974144534] [2024-11-17 08:32:53,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:32:53,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:32:53,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:53,874 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:32:53,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:53,876 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:32:53,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:32:53,877 INFO L85 PathProgramCache]: Analyzing trace with hash 759324332, now seen corresponding path program 6 times [2024-11-17 08:32:53,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:32:53,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375224155] [2024-11-17 08:32:53,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:32:53,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:32:53,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:53,898 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:32:53,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:32:53,929 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:32:58,106 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:32:58,106 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:32:58,106 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:32:58,106 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:32:58,107 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:32:58,107 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:58,107 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:32:58,107 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:32:58,107 INFO L132 ssoRankerPreferences]: Filename of dumped script: string-1.i_Iteration20_Lasso [2024-11-17 08:32:58,107 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:32:58,107 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:32:58,108 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:58,110 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:58,112 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:58,113 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:58,115 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:58,116 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:58,118 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:58,119 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:58,120 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:58,121 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:58,123 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:58,124 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:58,125 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:58,127 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:58,566 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:58,573 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:58,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:32:58,713 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2024-11-17 08:32:59,894 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:32:59,894 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:32:59,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:59,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:59,895 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) [2024-11-17 08:32:59,896 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 [2024-11-17 08:32:59,897 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:59,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:59,908 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:59,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:59,908 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:59,908 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:59,908 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:59,908 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:59,909 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:59,919 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 [2024-11-17 08:32:59,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:59,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:59,921 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) [2024-11-17 08:32:59,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 [2024-11-17 08:32:59,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 [2024-11-17 08:32:59,933 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:59,933 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:59,933 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:59,933 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:59,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:59,934 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:59,934 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:59,935 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:59,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Ended with exit code 0 [2024-11-17 08:32:59,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:59,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:59,947 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) [2024-11-17 08:32:59,947 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 [2024-11-17 08:32:59,948 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:59,957 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:59,958 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:59,958 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:59,958 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:59,958 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:59,958 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:59,958 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:59,959 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:59,970 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 [2024-11-17 08:32:59,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:59,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:59,971 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) [2024-11-17 08:32:59,972 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 [2024-11-17 08:32:59,972 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:32:59,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:32:59,982 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:32:59,982 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:32:59,982 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:32:59,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:32:59,983 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:32:59,983 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:32:59,984 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:32:59,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Forceful destruction successful, exit code 0 [2024-11-17 08:32:59,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:32:59,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:32:59,996 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) [2024-11-17 08:32:59,997 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 [2024-11-17 08:32:59,997 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:33:00,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:33:00,007 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:33:00,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:33:00,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:33:00,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:33:00,008 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:33:00,008 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:33:00,009 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:33:00,019 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 [2024-11-17 08:33:00,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:33:00,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:33:00,021 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) [2024-11-17 08:33:00,021 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 [2024-11-17 08:33:00,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 [2024-11-17 08:33:00,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:33:00,032 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:33:00,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:33:00,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:33:00,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:33:00,032 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:33:00,032 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:33:00,033 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:33:00,043 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 [2024-11-17 08:33:00,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:33:00,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:33:00,045 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) [2024-11-17 08:33:00,046 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 [2024-11-17 08:33:00,046 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:33:00,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:33:00,056 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:33:00,056 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:33:00,056 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:33:00,056 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:33:00,057 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:33:00,057 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:33:00,058 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:33:00,068 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 [2024-11-17 08:33:00,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:33:00,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:33:00,069 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) [2024-11-17 08:33:00,070 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 [2024-11-17 08:33:00,071 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:33:00,080 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:33:00,081 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:33:00,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:33:00,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:33:00,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:33:00,081 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:33:00,081 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:33:00,082 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:33:00,092 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 [2024-11-17 08:33:00,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:33:00,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:33:00,096 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) [2024-11-17 08:33:00,096 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 [2024-11-17 08:33:00,097 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:33:00,106 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:33:00,107 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:33:00,107 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:33:00,107 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:33:00,107 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:33:00,107 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:33:00,107 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:33:00,108 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:33:00,118 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 [2024-11-17 08:33:00,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:33:00,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:33:00,120 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) [2024-11-17 08:33:00,121 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 [2024-11-17 08:33:00,121 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:33:00,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:33:00,132 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:33:00,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:33:00,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:33:00,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:33:00,132 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:33:00,132 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:33:00,133 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:33:00,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Forceful destruction successful, exit code 0 [2024-11-17 08:33:00,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:33:00,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:33:00,145 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) [2024-11-17 08:33:00,146 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 [2024-11-17 08:33:00,147 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:33:00,156 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:33:00,156 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:33:00,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:33:00,157 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:33:00,157 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:33:00,157 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:33:00,157 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:33:00,158 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:33:00,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Forceful destruction successful, exit code 0 [2024-11-17 08:33:00,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:33:00,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:33:00,170 INFO L229 MonitoredProcess]: Starting monitored process 162 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:33:00,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Waiting until timeout for monitored process [2024-11-17 08:33:00,171 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:33:00,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:33:00,181 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:33:00,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:33:00,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:33:00,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:33:00,181 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:33:00,182 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:33:00,183 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:33:00,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Forceful destruction successful, exit code 0 [2024-11-17 08:33:00,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:33:00,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:33:00,195 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) [2024-11-17 08:33:00,195 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 [2024-11-17 08:33:00,196 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:33:00,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:33:00,206 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:33:00,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:33:00,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:33:00,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:33:00,207 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:33:00,207 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:33:00,208 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:33:00,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Ended with exit code 0 [2024-11-17 08:33:00,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:33:00,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:33:00,220 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) [2024-11-17 08:33:00,221 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 [2024-11-17 08:33:00,221 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-17 08:33:00,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:33:00,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:33:00,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:33:00,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:33:00,234 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:33:00,234 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:33:00,240 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:33:00,256 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2024-11-17 08:33:00,257 INFO L444 ModelExtractionUtils]: 0 out of 16 variables were initially zero. Simplification set additionally 13 variables to zero. [2024-11-17 08:33:00,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:33:00,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:33:00,258 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) [2024-11-17 08:33:00,259 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 [2024-11-17 08:33:00,259 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:33:00,270 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-17 08:33:00,270 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:33:00,270 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 [] [2024-11-17 08:33:00,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Ended with exit code 0 [2024-11-17 08:33:00,307 INFO L156 tatePredicateManager]: 13 out of 14 supporting invariants were superfluous and have been removed [2024-11-17 08:33:00,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:33:00,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:33:00,369 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-17 08:33:00,374 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:33:00,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:33:00,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 08:33:00,499 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:33:00,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:33:00,540 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 3 loop predicates [2024-11-17 08:33:00,540 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 77 transitions. cyclomatic complexity: 13 Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 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) [2024-11-17 08:33:00,608 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states and 77 transitions. cyclomatic complexity: 13. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 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) Result 89 states and 101 transitions. Complement of second has 13 states. [2024-11-17 08:33:00,608 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 [2024-11-17 08:33:00,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 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) [2024-11-17 08:33:00,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 38 transitions. [2024-11-17 08:33:00,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 38 transitions. Stem has 59 letters. Loop has 3 letters. [2024-11-17 08:33:00,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:33:00,609 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-17 08:33:00,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:33:00,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:33:00,666 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-17 08:33:00,667 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:33:00,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:33:00,771 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 08:33:00,771 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:33:00,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:33:00,800 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.6 stem predicates 3 loop predicates [2024-11-17 08:33:00,800 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 77 transitions. cyclomatic complexity: 13 Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 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) [2024-11-17 08:33:00,873 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states and 77 transitions. cyclomatic complexity: 13. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 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) Result 86 states and 96 transitions. Complement of second has 13 states. [2024-11-17 08:33:00,873 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 [2024-11-17 08:33:00,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 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) [2024-11-17 08:33:00,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 37 transitions. [2024-11-17 08:33:00,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 37 transitions. Stem has 59 letters. Loop has 3 letters. [2024-11-17 08:33:00,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:33:00,874 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-17 08:33:00,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:33:00,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:33:00,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-17 08:33:00,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:33:01,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Forceful destruction successful, exit code 0 [2024-11-17 08:33:01,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:33:01,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 08:33:01,070 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:33:01,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:33:01,099 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 3 loop predicates [2024-11-17 08:33:01,099 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states and 77 transitions. cyclomatic complexity: 13 Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 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) [2024-11-17 08:33:01,171 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states and 77 transitions. cyclomatic complexity: 13. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 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) Result 113 states and 132 transitions. Complement of second has 12 states. [2024-11-17 08:33:01,172 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 [2024-11-17 08:33:01,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 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) [2024-11-17 08:33:01,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 46 transitions. [2024-11-17 08:33:01,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 46 transitions. Stem has 59 letters. Loop has 3 letters. [2024-11-17 08:33:01,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:33:01,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 46 transitions. Stem has 62 letters. Loop has 3 letters. [2024-11-17 08:33:01,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:33:01,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 46 transitions. Stem has 59 letters. Loop has 6 letters. [2024-11-17 08:33:01,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:33:01,173 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 113 states and 132 transitions. [2024-11-17 08:33:01,173 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-17 08:33:01,173 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 113 states to 73 states and 80 transitions. [2024-11-17 08:33:01,173 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2024-11-17 08:33:01,174 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2024-11-17 08:33:01,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 80 transitions. [2024-11-17 08:33:01,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:33:01,174 INFO L218 hiAutomatonCegarLoop]: Abstraction has 73 states and 80 transitions. [2024-11-17 08:33:01,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 80 transitions. [2024-11-17 08:33:01,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2024-11-17 08:33:01,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 72 states have (on average 1.0972222222222223) internal successors, (79), 71 states have internal predecessors, (79), 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) [2024-11-17 08:33:01,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2024-11-17 08:33:01,175 INFO L240 hiAutomatonCegarLoop]: Abstraction has 72 states and 79 transitions. [2024-11-17 08:33:01,175 INFO L425 stractBuchiCegarLoop]: Abstraction has 72 states and 79 transitions. [2024-11-17 08:33:01,175 INFO L332 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2024-11-17 08:33:01,175 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 79 transitions. [2024-11-17 08:33:01,176 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2024-11-17 08:33:01,176 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:33:01,176 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:33:01,176 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 6, 5, 5, 5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:33:01,176 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-17 08:33:01,176 INFO L745 eck$LassoCheckResult]: Stem: 7401#ULTIMATE.startENTRY 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); 7402#ULTIMATE.init_returnLabel#1 assume true;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; 7409#L33 assume true; 7407#L33-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; 7408#L33 assume true; 7455#L33-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; 7454#L33 assume true; 7453#L33-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; 7451#L33 assume true; 7449#L33-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; 7447#L33 assume true; 7445#L33-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; 7443#L33 assume true; 7441#L33-1 assume !(main_~i~0#1 < 5); 7428#L35-2 call main_#t~mem3#1 := read~int#2(main_~#string_A~0#1.base, 4 + main_~#string_A~0#1.offset, 1); 7422#L35-1 assume !!(0 == main_#t~mem3#1);havoc main_#t~mem3#1;main_~i~0#1 := 0; 7414#L37 assume true; 7415#L37-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; 7416#L37 assume true; 7452#L37-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; 7450#L37 assume true; 7448#L37-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; 7446#L37 assume true; 7444#L37-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; 7442#L37 assume true; 7437#L37-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; 7436#L37 assume true; 7435#L37-1 assume !(main_~i~0#1 < 5); 7423#L39-2 call main_#t~mem6#1 := read~int#1(main_~#string_B~0#1.base, 4 + main_~#string_B~0#1.offset, 1); 7410#L39-1 assume !!(0 == main_#t~mem6#1);havoc main_#t~mem6#1;main_~nc_A~0#1 := 0; 7411#L42 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); 7412#L42-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; 7413#L42 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); 7399#L42-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; 7400#L42 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); 7457#L42-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; 7456#L42 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); 7432#L42-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; 7431#L42 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); 7397#L42-1 assume !(0 != main_#t~mem7#1);havoc main_#t~mem7#1; 7398#L45 main_~nc_B~0#1 := 0; 7426#L46 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); 7405#L46-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; 7406#L46 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); 7427#L46-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; 7463#L46 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); 7462#L46-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; 7461#L46 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); 7460#L46-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; 7459#L46 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); 7434#L46-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; 7433#L46 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); 7403#L46-1 assume !(0 != main_#t~mem9#1);havoc main_#t~mem9#1; 7404#L49-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; 7421#L53 assume true; 7425#L53-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); 7419#L55 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; 7420#L53 assume true; 7458#L53-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); 7440#L55 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; 7438#L53 assume true; 7424#L53-1 [2024-11-17 08:33:01,176 INFO L747 eck$LassoCheckResult]: Loop: 7424#L53-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); 7417#L55 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; 7418#L53 assume true; 7424#L53-1 [2024-11-17 08:33:01,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:33:01,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1021122902, now seen corresponding path program 11 times [2024-11-17 08:33:01,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:33:01,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037659685] [2024-11-17 08:33:01,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:33:01,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:33:01,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:33:01,393 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-17 08:33:01,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:33:01,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037659685] [2024-11-17 08:33:01,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037659685] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:33:01,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32102572] [2024-11-17 08:33:01,394 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-17 08:33:01,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:33:01,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:33:01,399 INFO L229 MonitoredProcess]: Starting monitored process 166 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:33:01,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (166)] Waiting until timeout for monitored process [2024-11-17 08:33:01,610 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2024-11-17 08:33:01,610 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:33:01,612 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-17 08:33:01,614 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:33:01,635 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 [2024-11-17 08:33:01,823 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-17 08:33:01,824 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 08:33:01,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32102572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:33:01,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-17 08:33:01,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 16 [2024-11-17 08:33:01,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850692239] [2024-11-17 08:33:01,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:33:01,824 INFO L750 eck$LassoCheckResult]: stem already infeasible [2024-11-17 08:33:01,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:33:01,824 INFO L85 PathProgramCache]: Analyzing trace with hash 46518, now seen corresponding path program 13 times [2024-11-17 08:33:01,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:33:01,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332704968] [2024-11-17 08:33:01,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:33:01,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:33:01,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:33:01,828 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:33:01,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:33:01,830 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:33:01,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:33:01,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 08:33:01,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2024-11-17 08:33:01,889 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. cyclomatic complexity: 13 Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 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) [2024-11-17 08:33:01,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:33:01,917 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2024-11-17 08:33:01,917 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 52 transitions. [2024-11-17 08:33:01,917 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-17 08:33:01,917 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 0 states and 0 transitions. [2024-11-17 08:33:01,918 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-17 08:33:01,918 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-17 08:33:01,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-17 08:33:01,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:33:01,918 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 08:33:01,918 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 08:33:01,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 08:33:01,918 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 08:33:01,918 INFO L332 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2024-11-17 08:33:01,919 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-17 08:33:01,919 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-17 08:33:01,919 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-17 08:33:01,924 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.11 08:33:01 BoogieIcfgContainer [2024-11-17 08:33:01,924 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-17 08:33:01,924 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 08:33:01,924 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 08:33:01,925 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 08:33:01,925 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:32:08" (3/4) ... [2024-11-17 08:33:01,926 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-17 08:33:01,927 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 08:33:01,928 INFO L158 Benchmark]: Toolchain (without parser) took 54618.94ms. Allocated memory was 159.4MB in the beginning and 559.9MB in the end (delta: 400.6MB). Free memory was 88.5MB in the beginning and 322.6MB in the end (delta: -234.2MB). Peak memory consumption was 167.7MB. Max. memory is 16.1GB. [2024-11-17 08:33:01,928 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 159.4MB. Free memory is still 114.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 08:33:01,928 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.39ms. Allocated memory is still 159.4MB. Free memory was 88.3MB in the beginning and 128.3MB in the end (delta: -40.0MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. [2024-11-17 08:33:01,928 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.39ms. Allocated memory is still 159.4MB. Free memory was 128.3MB in the beginning and 127.0MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 08:33:01,928 INFO L158 Benchmark]: Boogie Preprocessor took 75.08ms. Allocated memory is still 159.4MB. Free memory was 127.0MB in the beginning and 124.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 08:33:01,928 INFO L158 Benchmark]: IcfgBuilder took 344.07ms. Allocated memory is still 159.4MB. Free memory was 124.9MB in the beginning and 109.4MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-17 08:33:01,928 INFO L158 Benchmark]: BuchiAutomizer took 53900.31ms. Allocated memory was 159.4MB in the beginning and 559.9MB in the end (delta: 400.6MB). Free memory was 109.4MB in the beginning and 322.6MB in the end (delta: -213.2MB). Peak memory consumption was 188.9MB. Max. memory is 16.1GB. [2024-11-17 08:33:01,928 INFO L158 Benchmark]: Witness Printer took 2.96ms. Allocated memory is still 559.9MB. Free memory is still 322.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 08:33:01,929 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.15ms. Allocated memory is still 159.4MB. Free memory is still 114.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 251.39ms. Allocated memory is still 159.4MB. Free memory was 88.3MB in the beginning and 128.3MB in the end (delta: -40.0MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.39ms. Allocated memory is still 159.4MB. Free memory was 128.3MB in the beginning and 127.0MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.08ms. Allocated memory is still 159.4MB. Free memory was 127.0MB in the beginning and 124.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 344.07ms. Allocated memory is still 159.4MB. Free memory was 124.9MB in the beginning and 109.4MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 53900.31ms. Allocated memory was 159.4MB in the beginning and 559.9MB in the end (delta: 400.6MB). Free memory was 109.4MB in the beginning and 322.6MB in the end (delta: -213.2MB). Peak memory consumption was 188.9MB. Max. memory is 16.1GB. * Witness Printer took 2.96ms. Allocated memory is still 559.9MB. Free memory is still 322.6MB. 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: #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: #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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 21 terminating modules (12 trivial, 7 deterministic, 2 nondeterministic). One deterministic module has affine ranking function null and consists of 4 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 4 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 8 locations. One deterministic module has affine ranking function null and consists of 5 locations. One deterministic module has affine ranking function null and consists of 4 locations. One nondeterministic module has affine ranking function (((long long) -2 * i) + 5) and consists of 9 locations. One nondeterministic module has affine ranking function (((long long) -2 * j) + 7) and consists of 10 locations. 12 modules have a trivial ranking function, the largest among these consists of 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 53.8s and 22 iterations. TraceHistogramMax:6. Analysis of lassos took 49.5s. Construction of modules took 0.6s. Büchi inclusion checks took 3.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 19. Automata minimization 0.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 102 StatesRemovedByMinimization, 15 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 [7, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 759 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 756 mSDsluCounter, 1668 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1188 mSDsCounter, 158 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1218 IncrementalHoareTripleChecker+Invalid, 1376 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 158 mSolverCounterUnsat, 480 mSDtfsCounter, 1218 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc4 concLT0 SILN0 SILU8 SILI0 SILT0 lasso9 LassoPreprocessingBenchmarks: Lassos: inital321 mio100 ax100 hnf100 lsp94 ukn50 mio100 lsp25 div100 bol100 ite100 ukn100 eq168 hnf92 smp100 dnf878 smp80 tf100 neg100 sie115 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 32ms VariablesStem: 4 VariablesLoop: 2 DisjunctsStem: 4 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 28 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! [2024-11-17 08:33:01,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (166)] Forceful destruction successful, exit code 0 [2024-11-17 08:33:02,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (150)] Forceful destruction successful, exit code 0 [2024-11-17 08:33:02,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (116)] Forceful destruction successful, exit code 0 [2024-11-17 08:33:02,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Forceful destruction successful, exit code 0 [2024-11-17 08:33:02,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Forceful destruction successful, exit code 0 [2024-11-17 08:33:02,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Forceful destruction successful, exit code 0 [2024-11-17 08:33:03,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Forceful destruction successful, exit code 0 [2024-11-17 08:33:03,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2024-11-17 08:33:03,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2024-11-17 08:33:03,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2024-11-17 08:33:03,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE