./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3061b6dc 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/recursified_loop-simple/recursified_nested_3.c -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 9a8e2b8a66923dd7d46d9db92fbd8b38c75eb8108da5237ec87b15cd1ae67985 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 15:02:01,023 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 15:02:01,099 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-19 15:02:01,105 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 15:02:01,108 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 15:02:01,135 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 15:02:01,137 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 15:02:01,137 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 15:02:01,138 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 15:02:01,139 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 15:02:01,140 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 15:02:01,140 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 15:02:01,140 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 15:02:01,141 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-19 15:02:01,144 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-19 15:02:01,144 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-19 15:02:01,145 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-19 15:02:01,145 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-19 15:02:01,145 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-19 15:02:01,145 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 15:02:01,146 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-19 15:02:01,146 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 15:02:01,147 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 15:02:01,147 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 15:02:01,148 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 15:02:01,148 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-19 15:02:01,149 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-19 15:02:01,149 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-19 15:02:01,149 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 15:02:01,149 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 15:02:01,150 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 15:02:01,150 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 15:02:01,150 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-19 15:02:01,150 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 15:02:01,151 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 15:02:01,152 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 15:02:01,152 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 15:02:01,153 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 15:02:01,153 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-19 15:02:01,153 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 -> 9a8e2b8a66923dd7d46d9db92fbd8b38c75eb8108da5237ec87b15cd1ae67985 [2024-11-19 15:02:01,453 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 15:02:01,477 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 15:02:01,482 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 15:02:01,483 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 15:02:01,484 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 15:02:01,485 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c [2024-11-19 15:02:03,040 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 15:02:03,225 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 15:02:03,226 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c [2024-11-19 15:02:03,237 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b2fe9223/3ad311fc9d2d49c7b9a46a4815c8b84d/FLAG9fd6cfa92 [2024-11-19 15:02:03,249 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b2fe9223/3ad311fc9d2d49c7b9a46a4815c8b84d [2024-11-19 15:02:03,252 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 15:02:03,253 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 15:02:03,254 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 15:02:03,254 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 15:02:03,259 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 15:02:03,260 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 03:02:03" (1/1) ... [2024-11-19 15:02:03,261 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d203aa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:02:03, skipping insertion in model container [2024-11-19 15:02:03,261 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 03:02:03" (1/1) ... [2024-11-19 15:02:03,282 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 15:02:03,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 15:02:03,488 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 15:02:03,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 15:02:03,533 INFO L204 MainTranslator]: Completed translation [2024-11-19 15:02:03,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:02:03 WrapperNode [2024-11-19 15:02:03,534 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 15:02:03,535 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 15:02:03,535 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 15:02:03,535 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 15:02:03,543 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:02:03" (1/1) ... [2024-11-19 15:02:03,549 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:02:03" (1/1) ... [2024-11-19 15:02:03,566 INFO L138 Inliner]: procedures = 14, calls = 41, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 53 [2024-11-19 15:02:03,567 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 15:02:03,568 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 15:02:03,568 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 15:02:03,568 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 15:02:03,582 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:02:03" (1/1) ... [2024-11-19 15:02:03,583 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:02:03" (1/1) ... [2024-11-19 15:02:03,589 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:02:03" (1/1) ... [2024-11-19 15:02:03,619 INFO L175 MemorySlicer]: Split 20 memory accesses to 4 slices as follows [2, 6, 6, 6]. 30 percent of accesses are in the largest equivalence class. The 5 initializations are split as follows [2, 1, 1, 1]. The 6 writes are split as follows [0, 2, 2, 2]. [2024-11-19 15:02:03,619 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:02:03" (1/1) ... [2024-11-19 15:02:03,619 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:02:03" (1/1) ... [2024-11-19 15:02:03,627 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:02:03" (1/1) ... [2024-11-19 15:02:03,629 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:02:03" (1/1) ... [2024-11-19 15:02:03,634 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:02:03" (1/1) ... [2024-11-19 15:02:03,636 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:02:03" (1/1) ... [2024-11-19 15:02:03,641 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 15:02:03,642 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 15:02:03,642 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 15:02:03,645 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 15:02:03,647 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:02:03" (1/1) ... [2024-11-19 15:02:03,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:03,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:03,685 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-19 15:02:03,691 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-19 15:02:03,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 15:02:03,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 15:02:03,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 15:02:03,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 15:02:03,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 15:02:03,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 15:02:03,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 15:02:03,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 15:02:03,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 15:02:03,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-19 15:02:03,737 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_23_0 [2024-11-19 15:02:03,737 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_23_0 [2024-11-19 15:02:03,737 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_22_to_23_0 [2024-11-19 15:02:03,737 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_22_to_23_0 [2024-11-19 15:02:03,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 15:02:03,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 15:02:03,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 15:02:03,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 15:02:03,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 15:02:03,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-19 15:02:03,738 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_21_to_22_0 [2024-11-19 15:02:03,738 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_21_to_22_0 [2024-11-19 15:02:03,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 15:02:03,814 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 15:02:03,816 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 15:02:04,014 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-11-19 15:02:04,014 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 15:02:04,030 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 15:02:04,030 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 15:02:04,030 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 03:02:04 BoogieIcfgContainer [2024-11-19 15:02:04,031 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 15:02:04,031 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-19 15:02:04,031 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-19 15:02:04,038 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-19 15:02:04,040 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 15:02:04,040 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 03:02:03" (1/3) ... [2024-11-19 15:02:04,041 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@10644138 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 03:02:04, skipping insertion in model container [2024-11-19 15:02:04,045 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 15:02:04,045 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 03:02:03" (2/3) ... [2024-11-19 15:02:04,046 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@10644138 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 03:02:04, skipping insertion in model container [2024-11-19 15:02:04,046 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-19 15:02:04,046 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 03:02:04" (3/3) ... [2024-11-19 15:02:04,048 INFO L332 chiAutomizerObserver]: Analyzing ICFG recursified_nested_3.c [2024-11-19 15:02:04,115 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-19 15:02:04,115 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-19 15:02:04,115 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-19 15:02:04,115 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-19 15:02:04,115 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-19 15:02:04,115 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-19 15:02:04,116 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-19 15:02:04,116 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-19 15:02:04,119 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 32 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 25 states have internal predecessors, (28), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 15:02:04,134 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-11-19 15:02:04,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:02:04,135 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:02:04,140 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-19 15:02:04,141 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 15:02:04,141 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-19 15:02:04,141 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 32 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 25 states have internal predecessors, (28), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 15:02:04,144 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-11-19 15:02:04,144 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:02:04,144 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:02:04,144 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-19 15:02:04,145 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 15:02:04,150 INFO L745 eck$LassoCheckResult]: Stem: 30#$Ultimate##0true 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);call #Ultimate.allocInit(12, 3); 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int#3(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 5#L86true call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);< 28#$Ultimate##0true [2024-11-19 15:02:04,151 INFO L747 eck$LassoCheckResult]: Loop: 28#$Ultimate##0true ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#3(~a.base, ~a.offset, 4); 16#L61true assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~b.base, ~b.offset, 4); 31#L67true call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 25#$Ultimate##0true ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 19#L41true assume !(#t~mem7 < 6);havoc #t~mem7; 18#L41-1true assume true; 27#func_to_recursive_line_22_to_23_0EXITtrue >#70#return; 32#L67-1true call #t~mem11 := read~int#3(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12; 3#L72true call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);< 28#$Ultimate##0true [2024-11-19 15:02:04,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:02:04,157 INFO L85 PathProgramCache]: Analyzing trace with hash 49760, now seen corresponding path program 1 times [2024-11-19 15:02:04,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:02:04,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132299404] [2024-11-19 15:02:04,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:02:04,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:02:04,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:02:04,293 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 15:02:04,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:02:04,350 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 15:02:04,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:02:04,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1113047060, now seen corresponding path program 1 times [2024-11-19 15:02:04,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:02:04,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528030261] [2024-11-19 15:02:04,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:02:04,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:02:04,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:02:04,729 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-19 15:02:04,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:02:04,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528030261] [2024-11-19 15:02:04,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528030261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 15:02:04,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 15:02:04,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 15:02:04,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701117831] [2024-11-19 15:02:04,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 15:02:04,736 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 15:02:04,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 15:02:04,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 15:02:04,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 15:02:04,777 INFO L87 Difference]: Start difference. First operand has 32 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 25 states have internal predecessors, (28), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 15:02:04,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 15:02:04,912 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2024-11-19 15:02:04,914 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 43 transitions. [2024-11-19 15:02:04,919 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-11-19 15:02:04,925 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 22 states and 26 transitions. [2024-11-19 15:02:04,925 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2024-11-19 15:02:04,926 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2024-11-19 15:02:04,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 26 transitions. [2024-11-19 15:02:04,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 15:02:04,927 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-11-19 15:02:04,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 26 transitions. [2024-11-19 15:02:04,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-19 15:02:04,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 15 states have internal predecessors, (15), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-19 15:02:04,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-11-19 15:02:04,952 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-11-19 15:02:04,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 15:02:04,958 INFO L425 stractBuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-11-19 15:02:04,958 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-19 15:02:04,958 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 26 transitions. [2024-11-19 15:02:04,959 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-11-19 15:02:04,959 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:02:04,959 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:02:04,960 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-19 15:02:04,960 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 15:02:04,960 INFO L745 eck$LassoCheckResult]: Stem: 98#$Ultimate##0 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);call #Ultimate.allocInit(12, 3); 95#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int#3(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 80#L86 call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);< 81#$Ultimate##0 [2024-11-19 15:02:04,960 INFO L747 eck$LassoCheckResult]: Loop: 81#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#3(~a.base, ~a.offset, 4); 97#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~b.base, ~b.offset, 4); 83#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 92#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 91#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 87#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 86#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 89#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 94#L25-1 assume true; 93#func_to_recursive_line_23_to_23_0EXIT >#64#return; 90#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 84#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 92#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 91#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 82#L41-1 assume true; 85#func_to_recursive_line_22_to_23_0EXIT >#66#return; 96#L41-1 assume true; 100#func_to_recursive_line_22_to_23_0EXIT >#70#return; 99#L67-1 call #t~mem11 := read~int#3(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12; 79#L72 call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);< 81#$Ultimate##0 [2024-11-19 15:02:04,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:02:04,961 INFO L85 PathProgramCache]: Analyzing trace with hash 49760, now seen corresponding path program 2 times [2024-11-19 15:02:04,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:02:04,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412334872] [2024-11-19 15:02:04,962 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 15:02:04,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:02:04,977 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 15:02:04,977 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 15:02:04,978 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 15:02:04,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:02:04,989 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 15:02:04,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:02:04,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1122494970, now seen corresponding path program 1 times [2024-11-19 15:02:04,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:02:04,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071005690] [2024-11-19 15:02:04,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:02:04,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:02:05,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:02:05,263 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 15:02:05,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:02:05,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071005690] [2024-11-19 15:02:05,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071005690] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 15:02:05,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 15:02:05,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 15:02:05,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532668779] [2024-11-19 15:02:05,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 15:02:05,266 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 15:02:05,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 15:02:05,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 15:02:05,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 15:02:05,268 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. cyclomatic complexity: 7 Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 15:02:05,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 15:02:05,359 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2024-11-19 15:02:05,359 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions. [2024-11-19 15:02:05,361 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-11-19 15:02:05,364 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 28 transitions. [2024-11-19 15:02:05,364 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2024-11-19 15:02:05,365 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-11-19 15:02:05,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2024-11-19 15:02:05,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 15:02:05,365 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-11-19 15:02:05,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2024-11-19 15:02:05,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-19 15:02:05,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 16 states have internal predecessors, (16), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-19 15:02:05,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2024-11-19 15:02:05,373 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-11-19 15:02:05,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 15:02:05,374 INFO L425 stractBuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-11-19 15:02:05,375 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-19 15:02:05,375 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 28 transitions. [2024-11-19 15:02:05,376 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-11-19 15:02:05,376 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:02:05,376 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:02:05,377 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-19 15:02:05,377 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 15:02:05,377 INFO L745 eck$LassoCheckResult]: Stem: 156#$Ultimate##0 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);call #Ultimate.allocInit(12, 3); 152#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int#3(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 137#L86 call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);< 138#$Ultimate##0 [2024-11-19 15:02:05,379 INFO L747 eck$LassoCheckResult]: Loop: 138#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#3(~a.base, ~a.offset, 4); 155#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~b.base, ~b.offset, 4); 140#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 149#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 148#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 144#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 143#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 146#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 145#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 143#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 146#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 153#L25-1 assume true; 150#func_to_recursive_line_23_to_23_0EXIT >#62#return; 151#L25-1 assume true; 159#func_to_recursive_line_23_to_23_0EXIT >#64#return; 147#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 141#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 149#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 148#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 139#L41-1 assume true; 142#func_to_recursive_line_22_to_23_0EXIT >#66#return; 154#L41-1 assume true; 158#func_to_recursive_line_22_to_23_0EXIT >#70#return; 157#L67-1 call #t~mem11 := read~int#3(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12; 136#L72 call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);< 138#$Ultimate##0 [2024-11-19 15:02:05,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:02:05,382 INFO L85 PathProgramCache]: Analyzing trace with hash 49760, now seen corresponding path program 3 times [2024-11-19 15:02:05,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:02:05,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577740331] [2024-11-19 15:02:05,382 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 15:02:05,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:02:05,401 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-19 15:02:05,403 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 15:02:05,404 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 15:02:05,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:02:05,417 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 15:02:05,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:02:05,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1944809856, now seen corresponding path program 1 times [2024-11-19 15:02:05,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:02:05,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711937905] [2024-11-19 15:02:05,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:02:05,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:02:05,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:02:05,810 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 15:02:05,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:02:05,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711937905] [2024-11-19 15:02:05,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711937905] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 15:02:05,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221377779] [2024-11-19 15:02:05,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:02:05,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 15:02:05,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:05,815 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 15:02:05,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 15:02:05,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:02:05,908 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-19 15:02:05,913 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 15:02:05,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 15:02:06,221 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-19 15:02:06,221 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 15:02:06,620 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 15:02:06,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221377779] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 15:02:06,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 15:02:06,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 24 [2024-11-19 15:02:06,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324754525] [2024-11-19 15:02:06,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 15:02:06,622 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 15:02:06,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 15:02:06,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-19 15:02:06,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2024-11-19 15:02:06,626 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. cyclomatic complexity: 7 Second operand has 24 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 20 states have internal predecessors, (35), 10 states have call successors, (12), 6 states have call predecessors, (12), 8 states have return successors, (11), 7 states have call predecessors, (11), 10 states have call successors, (11) [2024-11-19 15:02:07,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 15:02:07,072 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2024-11-19 15:02:07,072 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 32 transitions. [2024-11-19 15:02:07,073 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-11-19 15:02:07,074 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 32 transitions. [2024-11-19 15:02:07,074 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2024-11-19 15:02:07,077 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2024-11-19 15:02:07,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 32 transitions. [2024-11-19 15:02:07,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 15:02:07,078 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-11-19 15:02:07,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 32 transitions. [2024-11-19 15:02:07,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-19 15:02:07,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-19 15:02:07,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-11-19 15:02:07,082 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-11-19 15:02:07,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 15:02:07,087 INFO L425 stractBuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-11-19 15:02:07,087 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-19 15:02:07,087 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 32 transitions. [2024-11-19 15:02:07,090 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-11-19 15:02:07,090 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:02:07,090 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:02:07,091 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-19 15:02:07,091 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 15:02:07,092 INFO L745 eck$LassoCheckResult]: Stem: 401#$Ultimate##0 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);call #Ultimate.allocInit(12, 3); 395#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int#3(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 382#L86 call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);< 383#$Ultimate##0 [2024-11-19 15:02:07,092 INFO L747 eck$LassoCheckResult]: Loop: 383#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#3(~a.base, ~a.offset, 4); 400#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~b.base, ~b.offset, 4); 385#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 394#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 392#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 390#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 388#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 389#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 388#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 389#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 388#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 391#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 398#L25-1 assume true; 396#func_to_recursive_line_23_to_23_0EXIT >#62#return; 397#L25-1 assume true; 408#func_to_recursive_line_23_to_23_0EXIT >#62#return; 407#L25-1 assume true; 406#func_to_recursive_line_23_to_23_0EXIT >#64#return; 393#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 386#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 394#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 392#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 390#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 388#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 389#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 388#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 391#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 389#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 388#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 391#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 398#L25-1 assume true; 396#func_to_recursive_line_23_to_23_0EXIT >#62#return; 397#L25-1 assume true; 408#func_to_recursive_line_23_to_23_0EXIT >#62#return; 407#L25-1 assume true; 406#func_to_recursive_line_23_to_23_0EXIT >#64#return; 393#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 386#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 394#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 392#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 384#L41-1 assume true; 387#func_to_recursive_line_22_to_23_0EXIT >#66#return; 399#L41-1 assume true; 405#func_to_recursive_line_22_to_23_0EXIT >#66#return; 404#L41-1 assume true; 403#func_to_recursive_line_22_to_23_0EXIT >#70#return; 402#L67-1 call #t~mem11 := read~int#3(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12; 381#L72 call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);< 383#$Ultimate##0 [2024-11-19 15:02:07,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:02:07,093 INFO L85 PathProgramCache]: Analyzing trace with hash 49760, now seen corresponding path program 4 times [2024-11-19 15:02:07,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:02:07,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399235325] [2024-11-19 15:02:07,094 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 15:02:07,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:02:07,113 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 15:02:07,113 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 15:02:07,113 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 15:02:07,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:02:07,121 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 15:02:07,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:02:07,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1306331242, now seen corresponding path program 2 times [2024-11-19 15:02:07,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:02:07,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474007988] [2024-11-19 15:02:07,124 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 15:02:07,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:02:07,159 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 15:02:07,159 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 15:02:07,778 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 6 proven. 51 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 15:02:07,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:02:07,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474007988] [2024-11-19 15:02:07,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474007988] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 15:02:07,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911282485] [2024-11-19 15:02:07,779 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 15:02:07,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 15:02:07,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:07,802 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 15:02:07,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 15:02:07,901 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 15:02:07,902 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 15:02:07,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-19 15:02:07,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 15:02:07,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 15:02:08,155 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 45 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-19 15:02:08,158 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 15:02:09,029 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 4 proven. 56 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-19 15:02:09,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911282485] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 15:02:09,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 15:02:09,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 14] total 29 [2024-11-19 15:02:09,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499730316] [2024-11-19 15:02:09,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 15:02:09,033 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 15:02:09,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 15:02:09,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-19 15:02:09,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=663, Unknown=0, NotChecked=0, Total=812 [2024-11-19 15:02:09,034 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. cyclomatic complexity: 7 Second operand has 29 states, 21 states have (on average 2.238095238095238) internal successors, (47), 25 states have internal predecessors, (47), 10 states have call successors, (17), 6 states have call predecessors, (17), 9 states have return successors, (17), 7 states have call predecessors, (17), 10 states have call successors, (17) [2024-11-19 15:02:09,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 15:02:09,330 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2024-11-19 15:02:09,330 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 36 transitions. [2024-11-19 15:02:09,331 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-11-19 15:02:09,332 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 36 transitions. [2024-11-19 15:02:09,332 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2024-11-19 15:02:09,333 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2024-11-19 15:02:09,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 36 transitions. [2024-11-19 15:02:09,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 15:02:09,333 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-11-19 15:02:09,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 36 transitions. [2024-11-19 15:02:09,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-19 15:02:09,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 20 states have internal predecessors, (20), 6 states have call successors, (6), 3 states have call predecessors, (6), 8 states have return successors, (10), 8 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-19 15:02:09,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2024-11-19 15:02:09,337 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-11-19 15:02:09,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 15:02:09,338 INFO L425 stractBuchiCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-11-19 15:02:09,338 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-19 15:02:09,338 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 36 transitions. [2024-11-19 15:02:09,338 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-11-19 15:02:09,339 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:02:09,339 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:02:09,340 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-19 15:02:09,341 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 10, 8, 8, 8, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 15:02:09,341 INFO L745 eck$LassoCheckResult]: Stem: 807#$Ultimate##0 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);call #Ultimate.allocInit(12, 3); 803#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int#3(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 788#L86 call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);< 789#$Ultimate##0 [2024-11-19 15:02:09,341 INFO L747 eck$LassoCheckResult]: Loop: 789#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#3(~a.base, ~a.offset, 4); 806#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~b.base, ~b.offset, 4); 792#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 800#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 795#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 794#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 797#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 796#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 794#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 797#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 796#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 794#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 797#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 796#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 794#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 797#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 796#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 794#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 797#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 804#L25-1 assume true; 801#func_to_recursive_line_23_to_23_0EXIT >#62#return; 802#L25-1 assume true; 818#func_to_recursive_line_23_to_23_0EXIT >#62#return; 817#L25-1 assume true; 816#func_to_recursive_line_23_to_23_0EXIT >#62#return; 815#L25-1 assume true; 814#func_to_recursive_line_23_to_23_0EXIT >#62#return; 813#L25-1 assume true; 812#func_to_recursive_line_23_to_23_0EXIT >#64#return; 798#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 791#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 800#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 799#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 795#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 794#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 797#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 796#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 794#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 797#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 796#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 794#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 797#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 796#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 794#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 797#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 796#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 794#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 797#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 804#L25-1 assume true; 801#func_to_recursive_line_23_to_23_0EXIT >#62#return; 802#L25-1 assume true; 818#func_to_recursive_line_23_to_23_0EXIT >#62#return; 817#L25-1 assume true; 816#func_to_recursive_line_23_to_23_0EXIT >#62#return; 815#L25-1 assume true; 814#func_to_recursive_line_23_to_23_0EXIT >#62#return; 813#L25-1 assume true; 812#func_to_recursive_line_23_to_23_0EXIT >#64#return; 798#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 791#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 800#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 799#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 790#L41-1 assume true; 793#func_to_recursive_line_22_to_23_0EXIT >#66#return; 805#L41-1 assume true; 811#func_to_recursive_line_22_to_23_0EXIT >#66#return; 810#L41-1 assume true; 809#func_to_recursive_line_22_to_23_0EXIT >#70#return; 808#L67-1 call #t~mem11 := read~int#3(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12; 787#L72 call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);< 789#$Ultimate##0 [2024-11-19 15:02:09,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:02:09,342 INFO L85 PathProgramCache]: Analyzing trace with hash 49760, now seen corresponding path program 5 times [2024-11-19 15:02:09,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:02:09,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542654013] [2024-11-19 15:02:09,342 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 15:02:09,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:02:09,351 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 15:02:09,351 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 15:02:09,351 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 15:02:09,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:02:09,357 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 15:02:09,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:02:09,358 INFO L85 PathProgramCache]: Analyzing trace with hash -909942614, now seen corresponding path program 3 times [2024-11-19 15:02:09,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:02:09,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906438633] [2024-11-19 15:02:09,359 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 15:02:09,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:02:09,381 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-19 15:02:09,381 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 15:02:09,848 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2024-11-19 15:02:09,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:02:09,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906438633] [2024-11-19 15:02:09,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906438633] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 15:02:09,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434099553] [2024-11-19 15:02:09,850 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 15:02:09,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 15:02:09,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:09,852 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 15:02:09,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 15:02:09,950 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-19 15:02:09,951 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 15:02:09,953 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-19 15:02:09,957 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 15:02:09,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 15:02:10,223 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2024-11-19 15:02:10,223 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 15:02:10,942 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-11-19 15:02:10,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434099553] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 15:02:10,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 15:02:10,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 14] total 29 [2024-11-19 15:02:10,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998052994] [2024-11-19 15:02:10,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 15:02:10,943 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 15:02:10,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 15:02:10,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-19 15:02:10,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=653, Unknown=0, NotChecked=0, Total=812 [2024-11-19 15:02:10,944 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. cyclomatic complexity: 7 Second operand has 29 states, 21 states have (on average 1.6666666666666667) internal successors, (35), 25 states have internal predecessors, (35), 14 states have call successors, (14), 6 states have call predecessors, (14), 8 states have return successors, (14), 11 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-19 15:02:11,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 15:02:11,267 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2024-11-19 15:02:11,267 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 40 transitions. [2024-11-19 15:02:11,269 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-11-19 15:02:11,269 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 40 transitions. [2024-11-19 15:02:11,270 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2024-11-19 15:02:11,270 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2024-11-19 15:02:11,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 40 transitions. [2024-11-19 15:02:11,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 15:02:11,270 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 40 transitions. [2024-11-19 15:02:11,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 40 transitions. [2024-11-19 15:02:11,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-19 15:02:11,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 6 states have call successors, (6), 3 states have call predecessors, (6), 10 states have return successors, (12), 10 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-19 15:02:11,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2024-11-19 15:02:11,274 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 40 transitions. [2024-11-19 15:02:11,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 15:02:11,275 INFO L425 stractBuchiCegarLoop]: Abstraction has 36 states and 40 transitions. [2024-11-19 15:02:11,275 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-19 15:02:11,276 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 40 transitions. [2024-11-19 15:02:11,277 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-11-19 15:02:11,277 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:02:11,277 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:02:11,279 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-19 15:02:11,279 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [20, 20, 16, 16, 16, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 15:02:11,280 INFO L745 eck$LassoCheckResult]: Stem: 1340#$Ultimate##0 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);call #Ultimate.allocInit(12, 3); 1335#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int#3(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 1320#L86 call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);< 1321#$Ultimate##0 [2024-11-19 15:02:11,280 INFO L747 eck$LassoCheckResult]: Loop: 1321#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#3(~a.base, ~a.offset, 4); 1339#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~b.base, ~b.offset, 4); 1323#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 1332#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 1330#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 1327#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1326#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1329#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1328#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1326#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1329#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1328#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1326#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1329#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1328#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1326#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1329#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1328#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1326#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1329#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1337#L25-1 assume true; 1333#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1334#L25-1 assume true; 1336#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1354#L25-1 assume true; 1353#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1352#L25-1 assume true; 1351#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1349#L25-1 assume true; 1348#func_to_recursive_line_23_to_23_0EXIT >#64#return; 1331#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 1324#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 1332#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 1330#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 1327#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1326#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1329#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1328#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1326#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1329#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1328#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1326#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1329#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1328#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1326#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1329#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1328#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1326#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1329#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1337#L25-1 assume true; 1333#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1334#L25-1 assume true; 1336#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1354#L25-1 assume true; 1353#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1352#L25-1 assume true; 1351#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1349#L25-1 assume true; 1348#func_to_recursive_line_23_to_23_0EXIT >#64#return; 1331#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 1324#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 1332#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 1330#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 1327#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1326#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1329#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1328#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1326#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1329#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1328#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1326#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1329#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1328#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1326#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1329#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1328#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1326#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1329#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1337#L25-1 assume true; 1333#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1334#L25-1 assume true; 1336#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1354#L25-1 assume true; 1353#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1352#L25-1 assume true; 1351#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1349#L25-1 assume true; 1348#func_to_recursive_line_23_to_23_0EXIT >#64#return; 1331#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 1324#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 1332#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 1330#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 1327#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1326#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1329#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1328#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1326#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1329#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1328#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1326#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1329#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1328#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1326#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1329#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 1328#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1326#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1329#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1337#L25-1 assume true; 1333#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1334#L25-1 assume true; 1336#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1354#L25-1 assume true; 1353#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1352#L25-1 assume true; 1351#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1349#L25-1 assume true; 1348#func_to_recursive_line_23_to_23_0EXIT >#64#return; 1331#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 1324#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 1332#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 1330#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1322#L41-1 assume true; 1325#func_to_recursive_line_22_to_23_0EXIT >#66#return; 1338#L41-1 assume true; 1350#func_to_recursive_line_22_to_23_0EXIT >#66#return; 1347#L41-1 assume true; 1346#func_to_recursive_line_22_to_23_0EXIT >#66#return; 1345#L41-1 assume true; 1344#func_to_recursive_line_22_to_23_0EXIT >#66#return; 1343#L41-1 assume true; 1342#func_to_recursive_line_22_to_23_0EXIT >#70#return; 1341#L67-1 call #t~mem11 := read~int#3(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12; 1319#L72 call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);< 1321#$Ultimate##0 [2024-11-19 15:02:11,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:02:11,281 INFO L85 PathProgramCache]: Analyzing trace with hash 49760, now seen corresponding path program 6 times [2024-11-19 15:02:11,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:02:11,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759526203] [2024-11-19 15:02:11,282 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 15:02:11,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:02:11,290 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-11-19 15:02:11,290 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 15:02:11,290 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 15:02:11,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:02:11,296 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 15:02:11,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:02:11,297 INFO L85 PathProgramCache]: Analyzing trace with hash 387394152, now seen corresponding path program 4 times [2024-11-19 15:02:11,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:02:11,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936209651] [2024-11-19 15:02:11,297 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 15:02:11,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:02:11,347 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 15:02:11,347 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 15:02:12,753 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 14 proven. 381 refuted. 0 times theorem prover too weak. 543 trivial. 0 not checked. [2024-11-19 15:02:12,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:02:12,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936209651] [2024-11-19 15:02:12,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936209651] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 15:02:12,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567804740] [2024-11-19 15:02:12,754 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 15:02:12,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 15:02:12,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:12,758 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 15:02:12,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 15:02:12,968 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 15:02:12,968 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 15:02:12,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 96 conjuncts are in the unsatisfiable core [2024-11-19 15:02:12,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 15:02:13,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 15:02:13,258 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 359 proven. 24 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2024-11-19 15:02:13,258 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 15:02:15,266 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 8 proven. 403 refuted. 0 times theorem prover too weak. 527 trivial. 0 not checked. [2024-11-19 15:02:15,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567804740] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 15:02:15,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 15:02:15,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 22] total 39 [2024-11-19 15:02:15,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470226580] [2024-11-19 15:02:15,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 15:02:15,268 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 15:02:15,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 15:02:15,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-19 15:02:15,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=1215, Unknown=0, NotChecked=0, Total=1482 [2024-11-19 15:02:15,269 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. cyclomatic complexity: 7 Second operand has 39 states, 29 states have (on average 1.896551724137931) internal successors, (55), 33 states have internal predecessors, (55), 12 states have call successors, (19), 8 states have call predecessors, (19), 13 states have return successors, (23), 11 states have call predecessors, (23), 12 states have call successors, (23) [2024-11-19 15:02:15,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 15:02:15,639 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2024-11-19 15:02:15,639 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 44 transitions. [2024-11-19 15:02:15,640 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-11-19 15:02:15,641 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 44 transitions. [2024-11-19 15:02:15,641 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2024-11-19 15:02:15,641 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2024-11-19 15:02:15,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 44 transitions. [2024-11-19 15:02:15,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 15:02:15,642 INFO L218 hiAutomatonCegarLoop]: Abstraction has 40 states and 44 transitions. [2024-11-19 15:02:15,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 44 transitions. [2024-11-19 15:02:15,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-19 15:02:15,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 24 states have internal predecessors, (24), 6 states have call successors, (6), 3 states have call predecessors, (6), 12 states have return successors, (14), 12 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-19 15:02:15,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2024-11-19 15:02:15,651 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 44 transitions. [2024-11-19 15:02:15,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 15:02:15,653 INFO L425 stractBuchiCegarLoop]: Abstraction has 40 states and 44 transitions. [2024-11-19 15:02:15,653 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-19 15:02:15,653 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 44 transitions. [2024-11-19 15:02:15,653 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-11-19 15:02:15,654 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:02:15,654 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:02:15,658 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-19 15:02:15,658 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [28, 28, 24, 24, 24, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 15:02:15,658 INFO L745 eck$LassoCheckResult]: Stem: 2268#$Ultimate##0 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);call #Ultimate.allocInit(12, 3); 2261#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int#3(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 2248#L86 call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);< 2249#$Ultimate##0 [2024-11-19 15:02:15,660 INFO L747 eck$LassoCheckResult]: Loop: 2249#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#3(~a.base, ~a.offset, 4); 2267#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~b.base, ~b.offset, 4); 2252#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 2260#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 2258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 2256#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 2254#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 2257#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 2255#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 2254#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 2257#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 2255#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 2254#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 2257#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 2255#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 2254#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 2257#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 2255#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 2254#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 2257#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 2255#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 2254#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 2257#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 2255#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 2254#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 2257#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2265#L25-1 assume true; 2262#func_to_recursive_line_23_to_23_0EXIT >#62#return; 2263#L25-1 assume true; 2264#func_to_recursive_line_23_to_23_0EXIT >#62#return; 2286#L25-1 assume true; 2285#func_to_recursive_line_23_to_23_0EXIT >#62#return; 2284#L25-1 assume true; 2283#func_to_recursive_line_23_to_23_0EXIT >#62#return; 2282#L25-1 assume true; 2281#func_to_recursive_line_23_to_23_0EXIT >#62#return; 2280#L25-1 assume true; 2279#func_to_recursive_line_23_to_23_0EXIT >#62#return; 2277#L25-1 assume true; 2276#func_to_recursive_line_23_to_23_0EXIT >#64#return; 2259#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 2251#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 2260#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 2258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 2256#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 2254#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 2257#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 2255#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 2254#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 2257#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 2255#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 2254#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 2257#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 2255#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 2254#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 2257#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 2255#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 2254#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 2257#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 2255#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 2254#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 2257#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 2255#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 2254#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 2257#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2265#L25-1 assume true; 2262#func_to_recursive_line_23_to_23_0EXIT >#62#return; 2263#L25-1 assume true; 2264#func_to_recursive_line_23_to_23_0EXIT >#62#return; 2286#L25-1 assume true; 2285#func_to_recursive_line_23_to_23_0EXIT >#62#return; 2284#L25-1 assume true; 2283#func_to_recursive_line_23_to_23_0EXIT >#62#return; 2282#L25-1 assume true; 2281#func_to_recursive_line_23_to_23_0EXIT >#62#return; 2280#L25-1 assume true; 2279#func_to_recursive_line_23_to_23_0EXIT >#62#return; 2277#L25-1 assume true; 2276#func_to_recursive_line_23_to_23_0EXIT >#64#return; 2259#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 2251#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 2260#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 2258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 2256#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 2254#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 2257#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 2255#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 2254#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 2257#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 2255#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 2254#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 2257#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 2255#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 2254#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 2257#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 2255#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 2254#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 2257#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 2255#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 2254#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 2257#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 2255#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 2254#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 2257#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2265#L25-1 assume true; 2262#func_to_recursive_line_23_to_23_0EXIT >#62#return; 2263#L25-1 assume true; 2264#func_to_recursive_line_23_to_23_0EXIT >#62#return; 2286#L25-1 assume true; 2285#func_to_recursive_line_23_to_23_0EXIT >#62#return; 2284#L25-1 assume true; 2283#func_to_recursive_line_23_to_23_0EXIT >#62#return; 2282#L25-1 assume true; 2281#func_to_recursive_line_23_to_23_0EXIT >#62#return; 2280#L25-1 assume true; 2279#func_to_recursive_line_23_to_23_0EXIT >#62#return; 2277#L25-1 assume true; 2276#func_to_recursive_line_23_to_23_0EXIT >#64#return; 2259#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 2251#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 2260#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 2258#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 2256#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 2254#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 2257#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 2255#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 2254#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 2257#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 2255#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 2254#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 2257#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 2255#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 2254#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 2257#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 2255#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 2254#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 2257#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 2255#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 2254#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 2257#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 2255#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 2254#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 2257#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2265#L25-1 assume true; 2262#func_to_recursive_line_23_to_23_0EXIT >#62#return; 2263#L25-1 assume true; 2264#func_to_recursive_line_23_to_23_0EXIT >#62#return; 2286#L25-1 assume true; 2285#func_to_recursive_line_23_to_23_0EXIT >#62#return; 2284#L25-1 assume true; 2283#func_to_recursive_line_23_to_23_0EXIT >#62#return; 2282#L25-1 assume true; 2281#func_to_recursive_line_23_to_23_0EXIT >#62#return; 2280#L25-1 assume true; 2279#func_to_recursive_line_23_to_23_0EXIT >#62#return; 2277#L25-1 assume true; 2276#func_to_recursive_line_23_to_23_0EXIT >#64#return; 2259#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 2251#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 2260#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 2258#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 2250#L41-1 assume true; 2253#func_to_recursive_line_22_to_23_0EXIT >#66#return; 2266#L41-1 assume true; 2278#func_to_recursive_line_22_to_23_0EXIT >#66#return; 2275#L41-1 assume true; 2274#func_to_recursive_line_22_to_23_0EXIT >#66#return; 2273#L41-1 assume true; 2272#func_to_recursive_line_22_to_23_0EXIT >#66#return; 2271#L41-1 assume true; 2270#func_to_recursive_line_22_to_23_0EXIT >#70#return; 2269#L67-1 call #t~mem11 := read~int#3(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12; 2247#L72 call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);< 2249#$Ultimate##0 [2024-11-19 15:02:15,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:02:15,663 INFO L85 PathProgramCache]: Analyzing trace with hash 49760, now seen corresponding path program 7 times [2024-11-19 15:02:15,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:02:15,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007885613] [2024-11-19 15:02:15,663 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-19 15:02:15,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:02:15,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:02:15,670 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 15:02:15,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:02:15,677 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 15:02:15,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:02:15,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1383958808, now seen corresponding path program 5 times [2024-11-19 15:02:15,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:02:15,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756080903] [2024-11-19 15:02:15,678 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 15:02:15,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:02:15,897 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2024-11-19 15:02:15,898 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 15:02:17,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1846 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 1810 trivial. 0 not checked. [2024-11-19 15:02:17,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 15:02:17,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756080903] [2024-11-19 15:02:17,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756080903] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 15:02:17,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661523774] [2024-11-19 15:02:17,756 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 15:02:17,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 15:02:17,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:17,759 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 15:02:17,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 15:02:18,709 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2024-11-19 15:02:18,709 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 15:02:18,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 988 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-19 15:02:18,723 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 15:02:18,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 15:02:19,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1846 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 1822 trivial. 0 not checked. [2024-11-19 15:02:19,084 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 15:02:20,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1846 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 1788 trivial. 0 not checked. [2024-11-19 15:02:20,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661523774] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 15:02:20,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 15:02:20,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 22] total 39 [2024-11-19 15:02:20,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685625122] [2024-11-19 15:02:20,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 15:02:20,661 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-19 15:02:20,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 15:02:20,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-19 15:02:20,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=1183, Unknown=0, NotChecked=0, Total=1482 [2024-11-19 15:02:20,663 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. cyclomatic complexity: 7 Second operand has 39 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 33 states have internal predecessors, (47), 18 states have call successors, (18), 8 states have call predecessors, (18), 12 states have return successors, (22), 17 states have call predecessors, (22), 17 states have call successors, (22) [2024-11-19 15:02:21,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 15:02:21,066 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2024-11-19 15:02:21,066 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 48 transitions. [2024-11-19 15:02:21,067 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-11-19 15:02:21,067 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 44 states and 48 transitions. [2024-11-19 15:02:21,067 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2024-11-19 15:02:21,067 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2024-11-19 15:02:21,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 48 transitions. [2024-11-19 15:02:21,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-19 15:02:21,068 INFO L218 hiAutomatonCegarLoop]: Abstraction has 44 states and 48 transitions. [2024-11-19 15:02:21,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 48 transitions. [2024-11-19 15:02:21,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-19 15:02:21,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 26 states have internal predecessors, (26), 6 states have call successors, (6), 3 states have call predecessors, (6), 14 states have return successors, (16), 14 states have call predecessors, (16), 4 states have call successors, (16) [2024-11-19 15:02:21,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2024-11-19 15:02:21,073 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 48 transitions. [2024-11-19 15:02:21,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 15:02:21,074 INFO L425 stractBuchiCegarLoop]: Abstraction has 44 states and 48 transitions. [2024-11-19 15:02:21,074 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-19 15:02:21,075 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 48 transitions. [2024-11-19 15:02:21,075 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-11-19 15:02:21,075 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:02:21,075 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:02:21,081 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-19 15:02:21,082 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [42, 42, 36, 36, 36, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 15:02:21,082 INFO L745 eck$LassoCheckResult]: Stem: 3440#$Ultimate##0 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);call #Ultimate.allocInit(12, 3); 3436#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int#3(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 3420#L86 call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);< 3421#$Ultimate##0 [2024-11-19 15:02:21,082 INFO L747 eck$LassoCheckResult]: Loop: 3421#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#3(~a.base, ~a.offset, 4); 3439#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~b.base, ~b.offset, 4); 3423#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 3433#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 3431#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 3428#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3426#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3429#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3427#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3426#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3429#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3427#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3426#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3429#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3427#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3426#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3429#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3427#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3426#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3429#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3427#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3426#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3429#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3427#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3426#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3429#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3437#L25-1 assume true; 3434#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3435#L25-1 assume true; 3462#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3461#L25-1 assume true; 3460#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3459#L25-1 assume true; 3457#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3455#L25-1 assume true; 3453#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3452#L25-1 assume true; 3450#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3448#L25-1 assume true; 3447#func_to_recursive_line_23_to_23_0EXIT >#64#return; 3430#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 3424#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 3433#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 3431#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 3428#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3426#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3429#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3427#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3426#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3429#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3427#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3426#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3429#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3427#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3426#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3429#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3427#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3426#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3429#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3427#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3426#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3429#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3427#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3426#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3429#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3437#L25-1 assume true; 3434#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3435#L25-1 assume true; 3462#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3461#L25-1 assume true; 3460#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3459#L25-1 assume true; 3457#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3455#L25-1 assume true; 3453#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3452#L25-1 assume true; 3450#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3448#L25-1 assume true; 3447#func_to_recursive_line_23_to_23_0EXIT >#64#return; 3430#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 3424#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 3433#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 3431#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 3428#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3426#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3429#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3427#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3426#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3429#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3427#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3426#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3429#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3427#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3426#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3429#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3427#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3426#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3429#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3427#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3426#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3429#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3427#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3426#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3429#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3437#L25-1 assume true; 3434#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3435#L25-1 assume true; 3462#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3461#L25-1 assume true; 3460#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3459#L25-1 assume true; 3457#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3455#L25-1 assume true; 3453#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3452#L25-1 assume true; 3450#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3448#L25-1 assume true; 3447#func_to_recursive_line_23_to_23_0EXIT >#64#return; 3430#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 3424#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 3433#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 3431#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 3428#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3426#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3429#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3427#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3426#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3429#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3427#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3426#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3429#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3427#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3426#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3429#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3427#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3426#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3429#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3427#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3426#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3429#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3427#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3426#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3429#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3437#L25-1 assume true; 3434#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3435#L25-1 assume true; 3462#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3461#L25-1 assume true; 3460#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3459#L25-1 assume true; 3457#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3455#L25-1 assume true; 3453#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3452#L25-1 assume true; 3450#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3448#L25-1 assume true; 3447#func_to_recursive_line_23_to_23_0EXIT >#64#return; 3430#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 3424#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 3433#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 3431#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 3428#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3426#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3429#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3427#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3426#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3429#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3427#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3426#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3429#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3427#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3426#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3429#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3427#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3426#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3429#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3427#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3426#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3429#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3427#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3426#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3429#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3437#L25-1 assume true; 3434#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3435#L25-1 assume true; 3462#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3461#L25-1 assume true; 3460#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3459#L25-1 assume true; 3457#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3455#L25-1 assume true; 3453#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3452#L25-1 assume true; 3450#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3448#L25-1 assume true; 3447#func_to_recursive_line_23_to_23_0EXIT >#64#return; 3430#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 3424#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 3433#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 3431#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 3428#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3426#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3429#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3427#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3426#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3429#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3427#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3426#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3429#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3427#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3426#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3429#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3427#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3426#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3429#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3427#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3426#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3429#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 3427#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3426#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3429#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3437#L25-1 assume true; 3434#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3435#L25-1 assume true; 3462#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3461#L25-1 assume true; 3460#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3459#L25-1 assume true; 3457#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3455#L25-1 assume true; 3453#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3452#L25-1 assume true; 3450#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3448#L25-1 assume true; 3447#func_to_recursive_line_23_to_23_0EXIT >#64#return; 3430#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 3424#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 3433#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 3431#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 3432#L41-1 assume true; 3438#func_to_recursive_line_22_to_23_0EXIT >#66#return; 3422#L41-1 assume true; 3425#func_to_recursive_line_22_to_23_0EXIT >#66#return; 3458#L41-1 assume true; 3456#func_to_recursive_line_22_to_23_0EXIT >#66#return; 3454#L41-1 assume true; 3451#func_to_recursive_line_22_to_23_0EXIT >#66#return; 3449#L41-1 assume true; 3446#func_to_recursive_line_22_to_23_0EXIT >#66#return; 3445#L41-1 assume true; 3444#func_to_recursive_line_22_to_23_0EXIT >#66#return; 3443#L41-1 assume true; 3442#func_to_recursive_line_22_to_23_0EXIT >#70#return; 3441#L67-1 call #t~mem11 := read~int#3(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12; 3419#L72 call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);< 3421#$Ultimate##0 [2024-11-19 15:02:21,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:02:21,084 INFO L85 PathProgramCache]: Analyzing trace with hash 49760, now seen corresponding path program 8 times [2024-11-19 15:02:21,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:02:21,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426515012] [2024-11-19 15:02:21,084 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 15:02:21,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:02:21,091 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 15:02:21,092 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 15:02:21,092 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 15:02:21,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:02:21,097 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 15:02:21,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:02:21,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1363312666, now seen corresponding path program 6 times [2024-11-19 15:02:21,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:02:21,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168187502] [2024-11-19 15:02:21,098 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 15:02:21,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:02:21,721 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2024-11-19 15:02:21,721 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 15:02:21,721 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 15:02:21,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:02:21,849 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 15:02:21,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:02:21,849 INFO L85 PathProgramCache]: Analyzing trace with hash -993962585, now seen corresponding path program 1 times [2024-11-19 15:02:21,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:02:21,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063370264] [2024-11-19 15:02:21,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:02:21,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:02:21,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:02:21,945 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 15:02:22,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:02:22,054 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 15:02:31,978 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 15:02:31,980 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 15:02:31,980 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 15:02:31,980 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 15:02:31,980 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 15:02:31,981 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:31,981 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 15:02:31,981 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 15:02:31,981 INFO L132 ssoRankerPreferences]: Filename of dumped script: recursified_nested_3.c_Iteration8_Lasso [2024-11-19 15:02:31,981 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 15:02:31,981 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 15:02:31,998 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:32,005 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:32,007 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:32,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:32,012 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:32,702 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:32,704 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:32,706 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:32,708 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:32,711 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:32,713 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:32,714 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:32,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:32,723 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:32,724 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:32,726 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:32,727 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:32,729 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:32,730 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:32,732 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:32,733 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:33,095 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 15:02:33,099 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 15:02:33,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:33,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:33,104 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-19 15:02:33,106 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-19 15:02:33,108 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 15:02:33,122 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:33,122 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:02:33,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:33,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:33,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:33,125 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:02:33,125 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:02:33,130 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:33,147 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-19 15:02:33,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:33,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:33,151 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-19 15:02:33,153 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-19 15:02:33,154 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:02:33,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:33,167 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:02:33,167 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:33,167 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:33,167 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:33,168 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:02:33,168 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:02:33,170 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:33,186 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-19 15:02:33,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:33,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:33,188 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-19 15:02:33,191 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-19 15:02:33,192 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 15:02:33,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:33,202 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:02:33,203 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:33,203 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:33,203 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:33,203 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:02:33,203 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:02:33,204 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:33,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-19 15:02:33,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:33,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:33,217 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-19 15:02:33,218 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-19 15:02:33,219 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:02:33,230 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:33,230 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:02:33,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:33,230 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:33,230 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:33,231 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:02:33,231 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:02:33,235 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:33,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-11-19 15:02:33,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:33,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:33,248 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-19 15:02:33,249 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-19 15:02:33,250 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:02:33,260 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:33,260 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:33,260 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:33,260 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:33,263 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 15:02:33,263 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 15:02:33,266 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:33,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-11-19 15:02:33,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:33,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:33,279 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-19 15:02:33,280 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-19 15:02:33,280 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:02:33,290 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:33,290 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:33,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:33,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:33,297 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 15:02:33,298 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 15:02:33,306 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:33,316 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-19 15:02:33,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:33,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:33,318 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-19 15:02:33,319 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-19 15:02:33,320 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:02:33,330 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:33,330 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:33,330 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:33,330 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:33,333 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 15:02:33,333 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 15:02:33,337 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:33,349 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-19 15:02:33,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:33,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:33,351 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-19 15:02:33,353 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-19 15:02:33,354 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:02:33,365 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:33,365 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:33,366 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:33,366 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:33,368 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 15:02:33,368 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 15:02:33,371 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:33,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-11-19 15:02:33,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:33,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:33,385 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-19 15:02:33,387 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-19 15:02:33,387 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:02:33,398 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:33,398 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:33,398 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:33,398 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:33,400 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 15:02:33,400 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 15:02:33,407 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:33,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-11-19 15:02:33,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:33,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:33,423 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-19 15:02:33,425 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-19 15:02:33,425 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:02:33,435 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:33,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:33,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:33,436 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:33,439 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 15:02:33,439 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 15:02:33,446 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:33,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-11-19 15:02:33,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:33,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:33,466 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-19 15:02:33,468 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-19 15:02:33,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-19 15:02:33,480 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:33,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:33,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:33,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:33,481 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 15:02:33,481 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 15:02:33,484 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:33,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-19 15:02:33,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:33,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:33,496 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-19 15:02:33,497 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-19 15:02:33,499 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:02:33,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:33,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:33,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:33,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:33,511 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 15:02:33,511 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 15:02:33,514 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:33,524 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-19 15:02:33,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:33,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:33,526 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-19 15:02:33,527 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-19 15:02:33,528 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:02:33,537 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:33,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:33,538 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:33,538 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:33,540 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 15:02:33,540 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 15:02:33,542 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:33,554 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-19 15:02:33,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:33,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:33,555 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-19 15:02:33,557 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-19 15:02:33,557 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:02:33,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:33,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:33,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:33,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:33,571 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 15:02:33,571 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 15:02:33,577 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 15:02:33,595 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-11-19 15:02:33,596 INFO L444 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. [2024-11-19 15:02:33,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:33,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:33,603 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-19 15:02:33,615 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-19 15:02:33,616 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 15:02:33,628 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-19 15:02:33,628 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 15:02:33,629 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#3 func_to_recursive_line_21_to_22_0_#in~a.base) func_to_recursive_line_21_to_22_0_#in~a.offset)_1) = -2*v_rep(select (select #memory_int#3 func_to_recursive_line_21_to_22_0_#in~a.base) func_to_recursive_line_21_to_22_0_#in~a.offset)_1 + 11 Supporting invariants [] [2024-11-19 15:02:33,642 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-19 15:02:33,707 INFO L156 tatePredicateManager]: 18 out of 18 supporting invariants were superfluous and have been removed [2024-11-19 15:02:33,713 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-19 15:02:33,714 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-19 15:02:33,714 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[#in~a!base,]]] [2024-11-19 15:02:33,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:02:33,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:02:33,742 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 15:02:33,742 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 15:02:34,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:02:34,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 2940 conjuncts, 116 conjuncts are in the unsatisfiable core [2024-11-19 15:02:34,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 15:02:35,247 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-19 15:02:36,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2024-11-19 15:02:36,107 INFO L134 CoverageAnalysis]: Checked inductivity of 4203 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4203 trivial. 0 not checked. [2024-11-19 15:02:36,111 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2024-11-19 15:02:36,112 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states and 48 transitions. cyclomatic complexity: 7 Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 15:02:36,317 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 44 states and 48 transitions. cyclomatic complexity: 7. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 131 states and 145 transitions. Complement of second has 19 states. [2024-11-19 15:02:36,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2024-11-19 15:02:36,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 4 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 15:02:36,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2024-11-19 15:02:36,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 3 letters. Loop has 255 letters. [2024-11-19 15:02:36,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 15:02:36,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 258 letters. Loop has 255 letters. [2024-11-19 15:02:36,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 15:02:36,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 3 letters. Loop has 510 letters. [2024-11-19 15:02:36,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 15:02:36,338 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 131 states and 145 transitions. [2024-11-19 15:02:36,341 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-11-19 15:02:36,342 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 131 states to 87 states and 99 transitions. [2024-11-19 15:02:36,344 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2024-11-19 15:02:36,344 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2024-11-19 15:02:36,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 99 transitions. [2024-11-19 15:02:36,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 15:02:36,345 INFO L218 hiAutomatonCegarLoop]: Abstraction has 87 states and 99 transitions. [2024-11-19 15:02:36,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 99 transitions. [2024-11-19 15:02:36,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 74. [2024-11-19 15:02:36,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 44 states have internal predecessors, (46), 12 states have call successors, (12), 7 states have call predecessors, (12), 21 states have return successors, (25), 22 states have call predecessors, (25), 8 states have call successors, (25) [2024-11-19 15:02:36,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2024-11-19 15:02:36,350 INFO L240 hiAutomatonCegarLoop]: Abstraction has 74 states and 83 transitions. [2024-11-19 15:02:36,351 INFO L425 stractBuchiCegarLoop]: Abstraction has 74 states and 83 transitions. [2024-11-19 15:02:36,351 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-19 15:02:36,351 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 83 transitions. [2024-11-19 15:02:36,352 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-11-19 15:02:36,352 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:02:36,352 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:02:36,353 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-19 15:02:36,353 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 15:02:36,353 INFO L745 eck$LassoCheckResult]: Stem: 4520#$Ultimate##0 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);call #Ultimate.allocInit(12, 3); 4513#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int#3(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 4484#L86 call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);< 4486#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#3(~a.base, ~a.offset, 4); 4519#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~b.base, ~b.offset, 4); 4501#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 4507#$Ultimate##0 [2024-11-19 15:02:36,354 INFO L747 eck$LassoCheckResult]: Loop: 4507#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 4504#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 4488#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4487#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4490#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 4489#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4487#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4490#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 4489#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4487#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4490#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 4489#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4487#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4490#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 4489#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4487#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4490#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 4489#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4487#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4490#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 4489#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4487#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4490#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 4514#L25-1 assume true; 4509#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4510#L25-1 assume true; 4550#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4549#L25-1 assume true; 4548#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4547#L25-1 assume true; 4546#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4545#L25-1 assume true; 4544#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4543#L25-1 assume true; 4542#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4541#L25-1 assume true; 4540#func_to_recursive_line_23_to_23_0EXIT >#64#return; 4500#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 4502#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 4507#$Ultimate##0 [2024-11-19 15:02:36,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:02:36,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1482449922, now seen corresponding path program 1 times [2024-11-19 15:02:36,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:02:36,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98553698] [2024-11-19 15:02:36,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:02:36,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:02:36,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:02:36,372 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 15:02:36,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:02:36,384 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 15:02:36,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:02:36,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1388529776, now seen corresponding path program 1 times [2024-11-19 15:02:36,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:02:36,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071483239] [2024-11-19 15:02:36,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:02:36,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:02:36,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:02:36,403 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 15:02:36,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:02:36,422 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 15:02:36,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:02:36,423 INFO L85 PathProgramCache]: Analyzing trace with hash -292174737, now seen corresponding path program 1 times [2024-11-19 15:02:36,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:02:36,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513722520] [2024-11-19 15:02:36,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:02:36,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:02:36,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:02:36,450 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 15:02:36,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:02:36,474 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 15:02:39,619 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 15:02:39,619 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 15:02:39,619 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 15:02:39,619 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 15:02:39,619 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 15:02:39,619 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:39,619 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 15:02:39,619 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 15:02:39,619 INFO L132 ssoRankerPreferences]: Filename of dumped script: recursified_nested_3.c_Iteration9_Lasso [2024-11-19 15:02:39,619 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 15:02:39,619 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 15:02:39,621 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:39,623 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:39,625 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:39,626 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:39,628 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:39,629 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:39,630 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:39,632 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:39,634 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:39,636 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:39,637 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:39,639 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:40,140 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:40,142 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:40,144 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:40,146 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:40,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:40,158 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:40,160 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:40,162 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:40,163 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:40,165 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:40,168 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:40,169 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:40,171 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:40,173 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:40,174 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:40,176 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:40,177 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:40,178 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:40,180 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:40,560 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 15:02:40,561 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 15:02:40,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:40,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:40,563 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-19 15:02:40,564 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-19 15:02:40,565 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:02:40,574 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:40,575 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:02:40,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:40,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:40,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:40,575 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:02:40,575 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:02:40,576 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:40,587 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-19 15:02:40,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:40,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:40,588 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-19 15:02:40,589 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-19 15:02:40,591 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:02:40,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:40,601 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:02:40,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:40,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:40,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:40,601 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:02:40,601 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:02:40,602 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:40,613 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-19 15:02:40,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:40,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:40,615 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-19 15:02:40,616 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-19 15:02:40,617 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:02:40,626 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:40,627 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:02:40,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:40,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:40,627 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:40,627 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:02:40,627 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:02:40,628 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:40,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-11-19 15:02:40,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:40,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:40,640 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:02:40,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-11-19 15:02:40,641 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:02:40,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:40,651 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:02:40,651 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:40,651 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:40,651 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:40,651 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:02:40,651 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:02:40,655 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:40,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2024-11-19 15:02:40,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:40,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:40,674 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:02:40,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2024-11-19 15:02:40,677 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:02:40,689 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:40,689 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:02:40,689 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:40,689 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:40,689 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:40,690 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:02:40,690 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:02:40,693 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:40,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2024-11-19 15:02:40,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:40,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:40,711 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:02:40,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2024-11-19 15:02:40,714 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:02:40,725 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:40,725 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:02:40,725 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:40,726 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:40,726 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:40,726 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:02:40,726 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:02:40,730 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:40,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2024-11-19 15:02:40,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:40,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:40,744 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-19 15:02:40,745 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-19 15:02:40,746 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:02:40,756 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:40,756 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:02:40,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:40,757 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:40,757 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:40,757 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:02:40,757 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:02:40,758 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:40,769 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-19 15:02:40,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:40,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:40,770 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-19 15:02:40,771 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-19 15:02:40,772 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:02:40,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:40,782 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:02:40,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:40,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:40,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:40,782 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:02:40,782 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:02:40,783 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:40,793 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-19 15:02:40,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:40,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:40,795 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-19 15:02:40,796 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-19 15:02:40,797 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 15:02:40,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:40,807 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:02:40,807 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:40,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:40,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:40,808 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:02:40,808 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:02:40,809 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:40,819 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-19 15:02:40,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:40,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:40,821 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-19 15:02:40,822 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-19 15:02:40,822 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 15:02:40,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:40,832 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:02:40,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:40,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:40,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:40,833 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:02:40,833 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:02:40,834 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:40,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2024-11-19 15:02:40,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:40,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:40,846 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-19 15:02:40,847 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-19 15:02:40,847 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 15:02:40,857 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:40,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:40,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:40,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:40,859 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 15:02:40,859 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 15:02:40,863 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:40,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2024-11-19 15:02:40,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:40,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:40,881 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-19 15:02:40,883 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-19 15:02:40,884 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:02:40,894 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:40,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:40,894 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:40,894 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:40,895 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 15:02:40,895 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 15:02:40,898 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:40,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2024-11-19 15:02:40,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:40,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:40,911 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-19 15:02:40,912 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-19 15:02:40,912 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:02:40,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:40,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:40,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:40,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:40,923 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 15:02:40,924 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 15:02:40,927 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:40,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2024-11-19 15:02:40,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:40,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:40,940 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-19 15:02:40,941 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-19 15:02:40,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-19 15:02:40,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:40,952 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:40,952 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:40,952 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:40,953 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 15:02:40,953 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 15:02:40,955 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:40,966 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-19 15:02:40,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:40,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:40,968 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-19 15:02:40,970 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-19 15:02:40,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-19 15:02:40,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:40,982 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:40,982 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:40,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:40,984 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 15:02:40,984 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 15:02:40,987 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:40,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2024-11-19 15:02:40,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:40,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:41,000 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-19 15:02:41,000 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-19 15:02:41,001 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 15:02:41,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:41,011 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:41,011 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:41,011 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:41,013 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 15:02:41,013 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 15:02:41,017 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:41,027 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-19 15:02:41,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:41,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:41,029 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-19 15:02:41,030 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-19 15:02:41,030 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:02:41,040 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:41,040 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:41,040 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:41,040 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:41,042 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 15:02:41,042 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 15:02:41,046 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:41,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2024-11-19 15:02:41,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:41,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:41,063 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-19 15:02:41,064 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-19 15:02:41,066 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 15:02:41,078 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:41,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:41,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:41,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:41,082 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 15:02:41,082 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 15:02:41,089 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:41,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2024-11-19 15:02:41,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:41,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:41,101 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-19 15:02:41,103 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-19 15:02:41,103 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:02:41,113 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:41,113 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:41,113 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:41,113 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:41,115 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 15:02:41,115 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 15:02:41,118 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:41,129 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-19 15:02:41,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:41,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:41,131 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-19 15:02:41,131 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-19 15:02:41,132 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:02:41,142 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:41,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:41,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:41,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:41,147 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 15:02:41,147 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 15:02:41,156 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 15:02:41,176 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2024-11-19 15:02:41,176 INFO L444 ModelExtractionUtils]: 3 out of 16 variables were initially zero. Simplification set additionally 6 variables to zero. [2024-11-19 15:02:41,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:41,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:41,178 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-19 15:02:41,180 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-19 15:02:41,181 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 15:02:41,192 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2024-11-19 15:02:41,192 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 15:02:41,192 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select old(#memory_int#2) func_to_recursive_line_22_to_23_0_#in~b.base) func_to_recursive_line_22_to_23_0_#in~b.offset)_1) = -2*v_rep(select (select old(#memory_int#2) func_to_recursive_line_22_to_23_0_#in~b.base) func_to_recursive_line_22_to_23_0_#in~b.offset)_1 + 11 Supporting invariants [-1*v_rep(select (select old(#memory_int#2) func_to_recursive_line_22_to_23_0_#in~b.base) func_to_recursive_line_22_to_23_0_#in~b.offset)_1 + 1*v_rep(select (select #memory_int#2 func_to_recursive_line_22_to_23_0_#in~b.base) 0)_1 >= 0, 1*v_rep(select (select #memory_int#2 func_to_recursive_line_22_to_23_0_#in~b.base) func_to_recursive_line_22_to_23_0_#in~b.offset)_1 - 1*v_rep(select (select old(#memory_int#2) func_to_recursive_line_22_to_23_0_#in~b.base) 0)_1 >= 0] [2024-11-19 15:02:41,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2024-11-19 15:02:41,251 INFO L156 tatePredicateManager]: 12 out of 14 supporting invariants were superfluous and have been removed [2024-11-19 15:02:41,255 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-11-19 15:02:41,256 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]] [2024-11-19 15:02:41,256 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#2,GLOBAL]],[IdentifierExpression[#in~b!base,]]] [2024-11-19 15:02:41,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:02:41,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:02:41,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-19 15:02:41,314 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 15:02:41,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:02:41,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-19 15:02:41,442 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 15:02:41,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-11-19 15:02:41,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 20 [2024-11-19 15:02:41,762 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-11-19 15:02:41,763 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 5 loop predicates [2024-11-19 15:02:41,765 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 83 transitions. cyclomatic complexity: 14 Second operand has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 15:02:42,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2024-11-19 15:02:42,075 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 83 transitions. cyclomatic complexity: 14. Second operand has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 254 states and 287 transitions. Complement of second has 25 states. [2024-11-19 15:02:42,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 4 stem states 5 non-accepting loop states 1 accepting loop states [2024-11-19 15:02:42,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 5 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 15:02:42,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 20 transitions. [2024-11-19 15:02:42,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 20 transitions. Stem has 6 letters. Loop has 39 letters. [2024-11-19 15:02:42,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 15:02:42,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 20 transitions. Stem has 45 letters. Loop has 39 letters. [2024-11-19 15:02:42,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 15:02:42,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 20 transitions. Stem has 6 letters. Loop has 78 letters. [2024-11-19 15:02:42,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 15:02:42,080 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 254 states and 287 transitions. [2024-11-19 15:02:42,087 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2024-11-19 15:02:42,090 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 254 states to 155 states and 182 transitions. [2024-11-19 15:02:42,093 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2024-11-19 15:02:42,094 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2024-11-19 15:02:42,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 155 states and 182 transitions. [2024-11-19 15:02:42,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 15:02:42,094 INFO L218 hiAutomatonCegarLoop]: Abstraction has 155 states and 182 transitions. [2024-11-19 15:02:42,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states and 182 transitions. [2024-11-19 15:02:42,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 142. [2024-11-19 15:02:42,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 80 states have (on average 1.125) internal successors, (90), 88 states have internal predecessors, (90), 26 states have call successors, (26), 16 states have call predecessors, (26), 36 states have return successors, (50), 37 states have call predecessors, (50), 18 states have call successors, (50) [2024-11-19 15:02:42,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 166 transitions. [2024-11-19 15:02:42,115 INFO L240 hiAutomatonCegarLoop]: Abstraction has 142 states and 166 transitions. [2024-11-19 15:02:42,115 INFO L425 stractBuchiCegarLoop]: Abstraction has 142 states and 166 transitions. [2024-11-19 15:02:42,116 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-19 15:02:42,116 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 142 states and 166 transitions. [2024-11-19 15:02:42,117 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2024-11-19 15:02:42,117 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:02:42,117 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:02:42,117 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 15:02:42,117 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 15:02:42,118 INFO L745 eck$LassoCheckResult]: Stem: 5111#$Ultimate##0 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);call #Ultimate.allocInit(12, 3); 5098#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int#3(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 5065#L86 call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);< 5067#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#3(~a.base, ~a.offset, 4); 5108#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~b.base, ~b.offset, 4); 5086#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 5101#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 5084#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 5075#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 5072#$Ultimate##0 [2024-11-19 15:02:42,118 INFO L747 eck$LassoCheckResult]: Loop: 5072#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 5074#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 5073#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 5072#$Ultimate##0 [2024-11-19 15:02:42,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:02:42,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1483069382, now seen corresponding path program 1 times [2024-11-19 15:02:42,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:02:42,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937482274] [2024-11-19 15:02:42,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:02:42,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:02:42,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:02:42,133 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 15:02:42,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:02:42,143 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 15:02:42,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:02:42,144 INFO L85 PathProgramCache]: Analyzing trace with hash 29945, now seen corresponding path program 1 times [2024-11-19 15:02:42,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:02:42,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985479864] [2024-11-19 15:02:42,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:02:42,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:02:42,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:02:42,150 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 15:02:42,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:02:42,154 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 15:02:42,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:02:42,156 INFO L85 PathProgramCache]: Analyzing trace with hash 208614944, now seen corresponding path program 1 times [2024-11-19 15:02:42,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:02:42,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600287193] [2024-11-19 15:02:42,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 15:02:42,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:02:42,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:02:42,169 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 15:02:42,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:02:42,179 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 15:02:44,209 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 15:02:44,209 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 15:02:44,210 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 15:02:44,210 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 15:02:44,210 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 15:02:44,210 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:44,210 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 15:02:44,210 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 15:02:44,210 INFO L132 ssoRankerPreferences]: Filename of dumped script: recursified_nested_3.c_Iteration10_Lasso [2024-11-19 15:02:44,210 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 15:02:44,210 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 15:02:44,212 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:44,213 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:44,215 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:44,216 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:44,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:44,219 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:44,220 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:44,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:44,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:44,230 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:44,232 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:44,233 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:44,238 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:44,239 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:44,241 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:44,242 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:44,243 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:44,245 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:44,246 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:44,248 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:44,259 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:44,261 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:44,263 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:44,265 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:44,267 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:44,269 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:44,270 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:44,273 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:44,275 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:44,276 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:44,277 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:44,279 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:44,280 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:44,282 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:44,284 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:44,291 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:44,591 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:44,594 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:44,595 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:44,885 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 15:02:44,886 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 15:02:44,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:44,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:44,888 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-19 15:02:44,888 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-19 15:02:44,889 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 15:02:44,900 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:44,900 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:02:44,900 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:44,900 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:44,900 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:44,900 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:02:44,900 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:02:44,901 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:44,911 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-19 15:02:44,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:44,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:44,913 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-19 15:02:44,914 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-19 15:02:44,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-19 15:02:44,925 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:44,925 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:02:44,925 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:44,925 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:44,925 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:44,925 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:02:44,926 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:02:44,927 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:44,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2024-11-19 15:02:44,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:44,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:44,940 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-19 15:02:44,941 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-19 15:02:44,941 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 15:02:44,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:44,951 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:02:44,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:44,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:44,951 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:44,951 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:02:44,952 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:02:44,953 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:44,963 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-19 15:02:44,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:44,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:44,964 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-19 15:02:44,966 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-19 15:02:44,966 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:02:44,976 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:44,976 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:02:44,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:44,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:44,976 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:44,977 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:02:44,977 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:02:44,980 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:44,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2024-11-19 15:02:44,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:44,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:44,999 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-19 15:02:45,001 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-19 15:02:45,002 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 15:02:45,013 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:45,013 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:02:45,013 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:45,013 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:45,013 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:45,013 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:02:45,013 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:02:45,014 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:45,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2024-11-19 15:02:45,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:45,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:45,026 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-19 15:02:45,027 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-19 15:02:45,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-19 15:02:45,037 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:45,038 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:02:45,038 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:45,038 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:45,038 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:45,038 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:02:45,038 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:02:45,039 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:45,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2024-11-19 15:02:45,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:45,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:45,051 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-19 15:02:45,052 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-19 15:02:45,052 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:02:45,062 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:45,062 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:02:45,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:45,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:45,062 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:45,062 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:02:45,062 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:02:45,063 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:45,074 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-19 15:02:45,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:45,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:45,076 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-19 15:02:45,076 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-19 15:02:45,077 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:02:45,087 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:45,087 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:02:45,087 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:45,087 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:45,087 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:45,088 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:02:45,088 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:02:45,089 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:45,099 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-19 15:02:45,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:45,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:45,101 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-19 15:02:45,102 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-19 15:02:45,103 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:02:45,112 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:45,113 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:02:45,113 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:45,113 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:45,113 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:45,113 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:02:45,113 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:02:45,114 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:45,124 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-19 15:02:45,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:45,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:45,126 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-19 15:02:45,126 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-19 15:02:45,127 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 15:02:45,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:45,137 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:02:45,137 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:45,137 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:45,137 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:45,137 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:02:45,137 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:02:45,138 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:45,148 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-19 15:02:45,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:45,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:45,150 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-19 15:02:45,150 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-19 15:02:45,151 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 15:02:45,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:45,161 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:02:45,161 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:45,161 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:45,161 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:45,161 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:02:45,162 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:02:45,163 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:45,173 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-19 15:02:45,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:45,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:45,175 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-19 15:02:45,176 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-19 15:02:45,176 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:02:45,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:45,186 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:02:45,186 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:45,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:45,186 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:45,186 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:02:45,186 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:02:45,188 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:45,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2024-11-19 15:02:45,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:45,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:45,199 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-19 15:02:45,200 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-19 15:02:45,201 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:02:45,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:45,210 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:02:45,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:45,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:45,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:45,211 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:02:45,211 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:02:45,212 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:45,222 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-19 15:02:45,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:45,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:45,224 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-19 15:02:45,225 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-19 15:02:45,225 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:02:45,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:45,235 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:02:45,236 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:45,236 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:45,236 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:45,236 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:02:45,236 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:02:45,237 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:45,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2024-11-19 15:02:45,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:45,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:45,249 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-19 15:02:45,250 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-19 15:02:45,250 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:02:45,260 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:45,260 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:02:45,260 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:45,260 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:45,260 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:45,261 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:02:45,261 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:02:45,262 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:45,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2024-11-19 15:02:45,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:45,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:45,275 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-19 15:02:45,276 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-19 15:02:45,277 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:02:45,286 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:45,287 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:02:45,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:45,287 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:45,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:45,287 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:02:45,287 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:02:45,291 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:45,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2024-11-19 15:02:45,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:45,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:45,304 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-19 15:02:45,332 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-19 15:02:45,333 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:02:45,343 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:45,343 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:02:45,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:45,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:45,343 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:45,343 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:02:45,344 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:02:45,345 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:45,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2024-11-19 15:02:45,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:45,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:45,356 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-19 15:02:45,357 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-19 15:02:45,357 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 15:02:45,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:45,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:45,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:45,367 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:45,368 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 15:02:45,368 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 15:02:45,370 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:45,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2024-11-19 15:02:45,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:45,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:45,383 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-19 15:02:45,383 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-19 15:02:45,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-19 15:02:45,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:45,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:45,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:45,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:45,395 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 15:02:45,395 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 15:02:45,398 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:45,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2024-11-19 15:02:45,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:45,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:45,410 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-19 15:02:45,411 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-19 15:02:45,412 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:02:45,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:45,421 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:02:45,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:45,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:45,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:45,422 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:02:45,422 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:02:45,423 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:45,434 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-19 15:02:45,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:45,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:45,435 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-19 15:02:45,436 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-19 15:02:45,437 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:02:45,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:45,447 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:02:45,447 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:45,447 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:45,447 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:45,447 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:02:45,447 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:02:45,448 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:45,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2024-11-19 15:02:45,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:45,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:45,461 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-19 15:02:45,462 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-19 15:02:45,462 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 15:02:45,472 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:45,472 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:02:45,472 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:45,472 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:45,473 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:45,473 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:02:45,473 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:02:45,475 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:45,485 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-19 15:02:45,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:45,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:45,486 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-19 15:02:45,487 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-19 15:02:45,488 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 15:02:45,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:45,498 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:02:45,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:45,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:45,498 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:45,499 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:02:45,499 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:02:45,500 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:45,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2024-11-19 15:02:45,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:45,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:45,511 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-19 15:02:45,513 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-19 15:02:45,513 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:02:45,523 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:45,524 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:02:45,524 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:45,524 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:45,524 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:45,524 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:02:45,524 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:02:45,525 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:45,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2024-11-19 15:02:45,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:45,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:45,537 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-19 15:02:45,538 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-19 15:02:45,539 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:02:45,552 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:45,552 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:02:45,552 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:45,552 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:45,552 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:45,552 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:02:45,553 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:02:45,555 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:45,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2024-11-19 15:02:45,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:45,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:45,568 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-19 15:02:45,570 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-19 15:02:45,570 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:02:45,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:45,581 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:02:45,581 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:45,581 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:45,581 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:45,581 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:02:45,581 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:02:45,584 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:45,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2024-11-19 15:02:45,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:45,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:45,598 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-19 15:02:45,599 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-19 15:02:45,599 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 15:02:45,609 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:45,609 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:02:45,609 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:45,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:45,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:45,609 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:02:45,610 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:02:45,613 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:45,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2024-11-19 15:02:45,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:45,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:45,629 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-19 15:02:45,630 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-19 15:02:45,631 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:02:45,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:45,640 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:02:45,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:45,641 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:45,641 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:45,641 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:02:45,641 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:02:45,642 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:45,652 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-19 15:02:45,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:45,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:45,654 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-19 15:02:45,655 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-19 15:02:45,655 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:02:45,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:45,665 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:02:45,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:45,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:45,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:45,666 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:02:45,666 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:02:45,667 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:45,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2024-11-19 15:02:45,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:45,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:45,678 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-19 15:02:45,679 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-19 15:02:45,680 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:02:45,689 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:45,689 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:02:45,690 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:45,690 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:45,690 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:45,690 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:02:45,690 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:02:45,691 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:45,701 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-19 15:02:45,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:45,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:45,703 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:02:45,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2024-11-19 15:02:45,704 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:02:45,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:45,714 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:02:45,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:45,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:45,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:45,714 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:02:45,714 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:02:45,715 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:45,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2024-11-19 15:02:45,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:45,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:45,727 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-19 15:02:45,728 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-19 15:02:45,729 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:02:45,739 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:45,739 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:02:45,739 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:45,739 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:45,739 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:45,740 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:02:45,740 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:02:45,741 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:45,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2024-11-19 15:02:45,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:45,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:45,753 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-19 15:02:45,754 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-19 15:02:45,755 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:02:45,764 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:45,764 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:45,764 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:45,764 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:45,765 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 15:02:45,765 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 15:02:45,768 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:45,778 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-19 15:02:45,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:45,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:45,779 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-19 15:02:45,780 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-19 15:02:45,781 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 15:02:45,791 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:45,791 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:45,791 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:45,791 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:45,795 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 15:02:45,795 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 15:02:45,805 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 15:02:45,824 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-11-19 15:02:45,824 INFO L444 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2024-11-19 15:02:45,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:45,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:45,826 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-19 15:02:45,828 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-19 15:02:45,828 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 15:02:45,843 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-19 15:02:45,843 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 15:02:45,843 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 func_to_recursive_line_23_to_23_0_#in~c.base) 0)_1) = -2*v_rep(select (select #memory_int#1 func_to_recursive_line_23_to_23_0_#in~c.base) 0)_1 + 11 Supporting invariants [] [2024-11-19 15:02:45,854 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-19 15:02:45,868 INFO L156 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2024-11-19 15:02:45,870 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-19 15:02:45,870 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-19 15:02:45,870 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~c!base,]]] [2024-11-19 15:02:45,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:02:45,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:02:45,925 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 15:02:45,926 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 15:02:46,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:02:46,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-19 15:02:46,042 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 15:02:46,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2024-11-19 15:02:46,109 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-19 15:02:46,109 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 3 loop predicates [2024-11-19 15:02:46,110 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 142 states and 166 transitions. cyclomatic complexity: 34 Second operand has 10 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 4 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:02:46,314 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 142 states and 166 transitions. cyclomatic complexity: 34. Second operand has 10 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 4 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 184 states and 223 transitions. Complement of second has 20 states. [2024-11-19 15:02:46,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 7 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-19 15:02:46,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 4 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 15:02:46,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2024-11-19 15:02:46,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. Stem has 9 letters. Loop has 3 letters. [2024-11-19 15:02:46,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 15:02:46,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. Stem has 12 letters. Loop has 3 letters. [2024-11-19 15:02:46,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 15:02:46,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. Stem has 9 letters. Loop has 6 letters. [2024-11-19 15:02:46,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 15:02:46,316 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 184 states and 223 transitions. [2024-11-19 15:02:46,318 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2024-11-19 15:02:46,323 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 184 states to 162 states and 200 transitions. [2024-11-19 15:02:46,323 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2024-11-19 15:02:46,323 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2024-11-19 15:02:46,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 162 states and 200 transitions. [2024-11-19 15:02:46,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 15:02:46,324 INFO L218 hiAutomatonCegarLoop]: Abstraction has 162 states and 200 transitions. [2024-11-19 15:02:46,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states and 200 transitions. [2024-11-19 15:02:46,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2024-11-19 15:02:46,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 93 states have (on average 1.118279569892473) internal successors, (104), 104 states have internal predecessors, (104), 31 states have call successors, (31), 20 states have call predecessors, (31), 38 states have return successors, (65), 37 states have call predecessors, (65), 23 states have call successors, (65) [2024-11-19 15:02:46,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 200 transitions. [2024-11-19 15:02:46,335 INFO L240 hiAutomatonCegarLoop]: Abstraction has 162 states and 200 transitions. [2024-11-19 15:02:46,335 INFO L425 stractBuchiCegarLoop]: Abstraction has 162 states and 200 transitions. [2024-11-19 15:02:46,335 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-19 15:02:46,335 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 162 states and 200 transitions. [2024-11-19 15:02:46,336 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2024-11-19 15:02:46,336 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:02:46,336 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:02:46,337 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 7, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 15:02:46,337 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-19 15:02:46,337 INFO L745 eck$LassoCheckResult]: Stem: 5567#$Ultimate##0 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);call #Ultimate.allocInit(12, 3); 5544#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int#3(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 5511#L86 call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);< 5513#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#3(~a.base, ~a.offset, 4); 5564#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~b.base, ~b.offset, 4); 5555#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 5554#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 5556#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 5584#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 5619#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 5620#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 5547#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 5592#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 5603#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 5548#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 5592#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 5603#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 5548#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 5592#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 5603#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 5548#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 5592#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 5603#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 5548#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 5592#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 5603#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 5548#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 5592#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 5666#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 5546#L25-1 assume true; 5549#func_to_recursive_line_23_to_23_0EXIT >#62#return; 5633#L25-1 assume true; 5611#func_to_recursive_line_23_to_23_0EXIT >#62#return; 5609#L25-1 assume true; 5600#func_to_recursive_line_23_to_23_0EXIT >#62#return; 5599#L25-1 assume true; 5598#func_to_recursive_line_23_to_23_0EXIT >#62#return; 5597#L25-1 assume true; 5596#func_to_recursive_line_23_to_23_0EXIT >#62#return; 5591#L25-1 assume true; 5588#func_to_recursive_line_23_to_23_0EXIT >#62#return; 5586#L25-1 assume true; 5583#func_to_recursive_line_23_to_23_0EXIT >#64#return; 5581#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 5531#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 5579#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 5530#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 5519#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 5518#$Ultimate##0 [2024-11-19 15:02:46,337 INFO L747 eck$LassoCheckResult]: Loop: 5518#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 5521#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 5520#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 5518#$Ultimate##0 [2024-11-19 15:02:46,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:02:46,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1721128109, now seen corresponding path program 2 times [2024-11-19 15:02:46,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:02:46,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485620333] [2024-11-19 15:02:46,338 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 15:02:46,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:02:46,358 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 15:02:46,358 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 15:02:46,358 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 15:02:46,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:02:46,381 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 15:02:46,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:02:46,382 INFO L85 PathProgramCache]: Analyzing trace with hash 29945, now seen corresponding path program 2 times [2024-11-19 15:02:46,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:02:46,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410870608] [2024-11-19 15:02:46,382 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 15:02:46,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:02:46,387 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 15:02:46,388 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 15:02:46,388 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 15:02:46,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:02:46,392 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 15:02:46,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:02:46,394 INFO L85 PathProgramCache]: Analyzing trace with hash 807915725, now seen corresponding path program 3 times [2024-11-19 15:02:46,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:02:46,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917591158] [2024-11-19 15:02:46,394 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 15:02:46,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:02:46,433 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-11-19 15:02:46,433 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 15:02:46,434 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 15:02:46,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:02:46,457 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 15:02:48,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2024-11-19 15:02:50,129 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 15:02:50,129 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 15:02:50,129 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 15:02:50,129 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 15:02:50,129 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 15:02:50,129 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:50,129 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 15:02:50,129 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 15:02:50,129 INFO L132 ssoRankerPreferences]: Filename of dumped script: recursified_nested_3.c_Iteration11_Lasso [2024-11-19 15:02:50,129 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 15:02:50,129 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 15:02:50,131 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:50,133 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:50,134 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:50,436 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:50,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:50,439 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:50,441 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:50,442 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:50,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:50,445 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:50,446 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:50,448 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:50,449 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:50,451 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:50,452 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:50,467 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:50,468 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:50,470 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:50,471 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:50,474 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:50,476 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:50,477 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:50,479 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:50,480 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:50,481 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:50,483 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:50,484 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:50,486 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:50,487 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:50,488 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:50,490 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:50,492 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:50,495 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:50,496 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:50,498 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:50,499 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:50,500 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:50,511 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:50,513 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:50,515 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:50,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:02:50,813 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 15:02:50,813 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 15:02:50,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:50,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:50,816 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-19 15:02:50,817 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-19 15:02:50,818 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:02:50,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:50,828 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:02:50,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:50,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:50,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:50,828 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:02:50,828 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:02:50,829 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:50,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Forceful destruction successful, exit code 0 [2024-11-19 15:02:50,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:50,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:50,861 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-19 15:02:50,862 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-19 15:02:50,863 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 15:02:50,873 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:50,873 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:02:50,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:50,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:50,873 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:50,873 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:02:50,873 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:02:50,875 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:02:50,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Forceful destruction successful, exit code 0 [2024-11-19 15:02:50,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:50,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:50,886 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-19 15:02:50,887 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-19 15:02:50,888 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:02:50,897 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:02:50,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:02:50,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:02:50,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:02:50,902 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 15:02:50,902 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 15:02:50,909 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 15:02:50,927 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-11-19 15:02:50,927 INFO L444 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2024-11-19 15:02:50,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:02:50,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:02:50,929 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-19 15:02:50,931 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-19 15:02:50,931 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 15:02:50,943 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-19 15:02:50,943 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 15:02:50,943 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 func_to_recursive_line_23_to_23_0_#in~c.base) func_to_recursive_line_23_to_23_0_#in~c.offset)_2) = -2*v_rep(select (select #memory_int#1 func_to_recursive_line_23_to_23_0_#in~c.base) func_to_recursive_line_23_to_23_0_#in~c.offset)_2 + 11 Supporting invariants [] [2024-11-19 15:02:50,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2024-11-19 15:02:50,967 INFO L156 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2024-11-19 15:02:50,968 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-19 15:02:50,968 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-19 15:02:50,968 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~c!base,]]] [2024-11-19 15:02:50,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:02:51,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:02:51,075 INFO L255 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-19 15:02:51,076 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 15:02:51,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:02:51,479 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-19 15:02:51,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 15:02:51,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2024-11-19 15:02:51,527 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-19 15:02:51,528 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2024-11-19 15:02:51,528 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 162 states and 200 transitions. cyclomatic complexity: 50 Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 15:02:51,600 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 162 states and 200 transitions. cyclomatic complexity: 50. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 176 states and 214 transitions. Complement of second has 16 states. [2024-11-19 15:02:51,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-19 15:02:51,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 15:02:51,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2024-11-19 15:02:51,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 48 letters. Loop has 3 letters. [2024-11-19 15:02:51,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 15:02:51,601 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 15:02:51,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:02:51,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:02:51,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-19 15:02:51,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 15:02:52,036 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-19 15:02:52,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:02:52,159 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-19 15:02:52,159 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 15:02:52,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2024-11-19 15:02:52,204 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-19 15:02:52,205 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2024-11-19 15:02:52,205 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 162 states and 200 transitions. cyclomatic complexity: 50 Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 15:02:52,283 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 162 states and 200 transitions. cyclomatic complexity: 50. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 176 states and 214 transitions. Complement of second has 16 states. [2024-11-19 15:02:52,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-19 15:02:52,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 15:02:52,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2024-11-19 15:02:52,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 48 letters. Loop has 3 letters. [2024-11-19 15:02:52,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 15:02:52,289 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 15:02:52,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:02:52,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:02:52,439 INFO L255 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-19 15:02:52,442 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 15:02:52,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:02:52,814 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-19 15:02:52,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 15:02:52,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2024-11-19 15:02:52,862 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-19 15:02:52,863 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2024-11-19 15:02:52,864 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 162 states and 200 transitions. cyclomatic complexity: 50 Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 15:02:53,006 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 162 states and 200 transitions. cyclomatic complexity: 50. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 223 states and 275 transitions. Complement of second has 17 states. [2024-11-19 15:02:53,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-19 15:02:53,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 15:02:53,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2024-11-19 15:02:53,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 48 letters. Loop has 3 letters. [2024-11-19 15:02:53,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 15:02:53,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 51 letters. Loop has 3 letters. [2024-11-19 15:02:53,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 15:02:53,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 48 letters. Loop has 6 letters. [2024-11-19 15:02:53,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 15:02:53,011 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 223 states and 275 transitions. [2024-11-19 15:02:53,014 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-19 15:02:53,017 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 223 states to 129 states and 159 transitions. [2024-11-19 15:02:53,017 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2024-11-19 15:02:53,017 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2024-11-19 15:02:53,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 129 states and 159 transitions. [2024-11-19 15:02:53,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-19 15:02:53,018 INFO L218 hiAutomatonCegarLoop]: Abstraction has 129 states and 159 transitions. [2024-11-19 15:02:53,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states and 159 transitions. [2024-11-19 15:02:53,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 118. [2024-11-19 15:02:53,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 68 states have (on average 1.088235294117647) internal successors, (74), 74 states have internal predecessors, (74), 21 states have call successors, (21), 13 states have call predecessors, (21), 29 states have return successors, (46), 30 states have call predecessors, (46), 17 states have call successors, (46) [2024-11-19 15:02:53,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 141 transitions. [2024-11-19 15:02:53,031 INFO L240 hiAutomatonCegarLoop]: Abstraction has 118 states and 141 transitions. [2024-11-19 15:02:53,031 INFO L425 stractBuchiCegarLoop]: Abstraction has 118 states and 141 transitions. [2024-11-19 15:02:53,031 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-19 15:02:53,031 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states and 141 transitions. [2024-11-19 15:02:53,032 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-19 15:02:53,032 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-19 15:02:53,032 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-19 15:02:53,036 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [42, 42, 36, 36, 36, 7, 7, 6, 6, 6, 6, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 15:02:53,038 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 15:02:53,038 INFO L745 eck$LassoCheckResult]: Stem: 6866#$Ultimate##0 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);call #Ultimate.allocInit(12, 3); 6852#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem13#1, main_#t~mem14#1, main_#t~short15#1, main_#t~mem16#1, main_#t~short17#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call write~int#3(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 6820#L86 call func_to_recursive_line_21_to_22_0(main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset);< 6821#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#3(~a.base, ~a.offset, 4); 6863#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~b.base, ~b.offset, 4); 6838#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 6909#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 6908#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 6905#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6906#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 6934#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6830#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6829#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 6832#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6831#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6829#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 6832#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6831#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6829#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 6832#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6831#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6829#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 6832#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6831#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6829#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 6832#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6831#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6829#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 6833#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6854#L25-1 assume true; 6855#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6925#L25-1 assume true; 6923#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6921#L25-1 assume true; 6918#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6917#L25-1 assume true; 6916#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6915#L25-1 assume true; 6914#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6911#L25-1 assume true; 6910#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6907#L25-1 assume true; 6904#func_to_recursive_line_23_to_23_0EXIT >#64#return; 6837#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 6823#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 6843#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 6840#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 6841#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6906#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 6934#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6830#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6829#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 6832#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6831#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6829#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 6832#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6831#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6829#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 6832#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6831#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6829#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 6832#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6831#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6829#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 6832#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6831#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6829#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 6833#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6854#L25-1 assume true; 6855#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6925#L25-1 assume true; 6923#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6921#L25-1 assume true; 6918#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6917#L25-1 assume true; 6916#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6915#L25-1 assume true; 6914#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6911#L25-1 assume true; 6910#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6907#L25-1 assume true; 6904#func_to_recursive_line_23_to_23_0EXIT >#64#return; 6903#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 6824#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 6843#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 6840#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 6841#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6906#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 6934#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6830#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6829#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 6832#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6831#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6829#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 6832#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6831#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6829#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 6832#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6831#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6829#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 6832#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6831#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6829#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 6832#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6831#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6829#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 6833#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6854#L25-1 assume true; 6855#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6925#L25-1 assume true; 6923#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6921#L25-1 assume true; 6918#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6917#L25-1 assume true; 6916#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6915#L25-1 assume true; 6914#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6911#L25-1 assume true; 6910#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6907#L25-1 assume true; 6904#func_to_recursive_line_23_to_23_0EXIT >#64#return; 6903#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 6824#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 6843#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 6840#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 6841#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6906#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 6934#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6830#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6829#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 6832#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6831#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6829#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 6832#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6831#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6829#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 6832#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6831#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6829#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 6832#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6831#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6829#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 6832#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6831#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6829#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 6833#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6854#L25-1 assume true; 6855#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6925#L25-1 assume true; 6923#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6921#L25-1 assume true; 6918#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6917#L25-1 assume true; 6916#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6915#L25-1 assume true; 6914#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6911#L25-1 assume true; 6910#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6907#L25-1 assume true; 6904#func_to_recursive_line_23_to_23_0EXIT >#64#return; 6903#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 6824#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 6843#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 6840#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 6841#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6906#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 6934#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6830#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6829#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 6832#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6831#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6829#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 6832#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6831#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6829#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 6832#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6831#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6829#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 6832#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6831#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6829#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 6832#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6831#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6829#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 6833#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6854#L25-1 assume true; 6855#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6925#L25-1 assume true; 6923#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6921#L25-1 assume true; 6918#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6917#L25-1 assume true; 6916#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6915#L25-1 assume true; 6914#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6911#L25-1 assume true; 6910#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6907#L25-1 assume true; 6904#func_to_recursive_line_23_to_23_0EXIT >#64#return; 6903#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 6824#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 6843#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 6840#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 6841#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6906#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 6934#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6830#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6829#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 6832#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6831#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6829#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 6832#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6831#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6829#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 6832#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6831#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6829#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 6832#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6831#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6829#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 6832#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6831#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6829#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 6833#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6854#L25-1 assume true; 6855#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6925#L25-1 assume true; 6923#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6921#L25-1 assume true; 6918#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6917#L25-1 assume true; 6916#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6915#L25-1 assume true; 6914#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6911#L25-1 assume true; 6910#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6907#L25-1 assume true; 6904#func_to_recursive_line_23_to_23_0EXIT >#64#return; 6903#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 6824#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 6843#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 6895#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 6822#L41-1 assume true; 6825#func_to_recursive_line_22_to_23_0EXIT >#66#return; 6857#L41-1 assume true; 6893#func_to_recursive_line_22_to_23_0EXIT >#66#return; 6892#L41-1 assume true; 6891#func_to_recursive_line_22_to_23_0EXIT >#66#return; 6890#L41-1 assume true; 6889#func_to_recursive_line_22_to_23_0EXIT >#66#return; 6888#L41-1 assume true; 6887#func_to_recursive_line_22_to_23_0EXIT >#66#return; 6886#L41-1 assume true; 6883#func_to_recursive_line_22_to_23_0EXIT >#66#return; 6882#L41-1 assume true; 6881#func_to_recursive_line_22_to_23_0EXIT >#70#return; 6867#L67-1 call #t~mem11 := read~int#3(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12; 6818#L72 call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);< 6819#$Ultimate##0 ~a.base, ~a.offset := #in~a.base, #in~a.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem10 := read~int#3(~a.base, ~a.offset, 4); 6865#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~b.base, ~b.offset, 4); 6835#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 6842#$Ultimate##0 [2024-11-19 15:02:53,040 INFO L747 eck$LassoCheckResult]: Loop: 6842#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#2(~b.base, ~b.offset, 4); 6839#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 6827#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6826#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 6828#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6846#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6868#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 6869#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6845#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6868#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 6869#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6845#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6868#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 6869#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6845#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6868#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 6869#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6845#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6868#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 6869#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#1(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#1(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6845#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6868#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 6856#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6853#L25-1 assume true; 6844#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6847#L25-1 assume true; 6880#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6879#L25-1 assume true; 6878#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6877#L25-1 assume true; 6876#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6875#L25-1 assume true; 6874#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6873#L25-1 assume true; 6872#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6871#L25-1 assume true; 6870#func_to_recursive_line_23_to_23_0EXIT >#64#return; 6834#L47-1 call #t~mem8 := read~int#2(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 6836#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 6842#$Ultimate##0 [2024-11-19 15:02:53,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:02:53,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1634781349, now seen corresponding path program 2 times [2024-11-19 15:02:53,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:02:53,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957288800] [2024-11-19 15:02:53,041 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 15:02:53,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:02:53,142 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 15:02:53,142 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 15:02:53,142 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 15:02:53,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:02:53,236 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 15:02:53,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:02:53,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1388529776, now seen corresponding path program 2 times [2024-11-19 15:02:53,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:02:53,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530461200] [2024-11-19 15:02:53,237 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 15:02:53,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:02:53,250 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 15:02:53,251 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 15:02:53,251 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 15:02:53,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:02:53,263 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 15:02:53,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:02:53,264 INFO L85 PathProgramCache]: Analyzing trace with hash -350990602, now seen corresponding path program 3 times [2024-11-19 15:02:53,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 15:02:53,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542091175] [2024-11-19 15:02:53,265 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 15:02:53,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 15:02:53,691 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2024-11-19 15:02:53,691 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 15:02:53,691 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 15:02:53,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 15:02:53,793 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 15:03:07,719 INFO L204 LassoAnalysis]: Preferences: [2024-11-19 15:03:07,719 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-19 15:03:07,719 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-19 15:03:07,719 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-19 15:03:07,719 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-19 15:03:07,719 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:03:07,719 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-19 15:03:07,719 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-19 15:03:07,719 INFO L132 ssoRankerPreferences]: Filename of dumped script: recursified_nested_3.c_Iteration12_Lasso [2024-11-19 15:03:07,719 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-19 15:03:07,719 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-19 15:03:07,721 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:07,723 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:07,725 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:07,735 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:07,737 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:07,738 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:07,739 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:07,741 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:07,742 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:07,744 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:07,745 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:07,746 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:07,748 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:07,749 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:07,750 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:07,752 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:07,753 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:07,755 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:07,756 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:07,757 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:07,759 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:07,760 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:07,762 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:07,763 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:07,764 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:07,766 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:07,767 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:08,232 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:08,233 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:08,234 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:08,236 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:08,237 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:08,238 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:08,240 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:08,241 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-19 15:03:08,629 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-19 15:03:08,630 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-19 15:03:08,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:03:08,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:03:08,632 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-19 15:03:08,633 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-19 15:03:08,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-19 15:03:08,645 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:03:08,646 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:03:08,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:03:08,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:03:08,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:03:08,646 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:03:08,646 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:03:08,647 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:03:08,657 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-19 15:03:08,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:03:08,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:03:08,658 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-19 15:03:08,659 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-19 15:03:08,660 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:03:08,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:03:08,669 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:03:08,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:03:08,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:03:08,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:03:08,670 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:03:08,670 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:03:08,671 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:03:08,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Forceful destruction successful, exit code 0 [2024-11-19 15:03:08,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:03:08,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:03:08,682 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-19 15:03:08,683 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-19 15:03:08,684 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:03:08,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:03:08,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:03:08,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:03:08,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:03:08,694 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 15:03:08,695 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 15:03:08,697 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:03:08,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2024-11-19 15:03:08,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:03:08,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:03:08,709 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-19 15:03:08,710 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-19 15:03:08,710 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:03:08,720 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:03:08,720 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:03:08,720 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:03:08,720 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:03:08,721 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 15:03:08,721 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 15:03:08,724 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:03:08,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2024-11-19 15:03:08,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:03:08,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:03:08,736 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-19 15:03:08,737 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-19 15:03:08,738 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:03:08,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:03:08,747 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:03:08,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:03:08,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:03:08,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:03:08,748 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:03:08,748 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:03:08,749 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:03:08,759 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-19 15:03:08,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:03:08,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:03:08,761 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-19 15:03:08,762 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-19 15:03:08,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-19 15:03:08,772 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:03:08,772 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:03:08,772 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:03:08,772 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:03:08,772 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:03:08,773 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:03:08,773 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:03:08,774 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:03:08,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2024-11-19 15:03:08,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:03:08,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:03:08,786 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-19 15:03:08,787 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-19 15:03:08,787 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:03:08,797 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:03:08,797 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:03:08,797 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:03:08,797 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:03:08,797 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:03:08,798 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:03:08,798 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:03:08,799 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:03:08,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2024-11-19 15:03:08,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:03:08,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:03:08,810 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-19 15:03:08,811 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-19 15:03:08,811 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:03:08,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:03:08,821 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:03:08,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:03:08,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:03:08,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:03:08,821 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:03:08,821 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:03:08,822 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:03:08,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2024-11-19 15:03:08,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:03:08,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:03:08,834 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-19 15:03:08,834 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-19 15:03:08,835 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:03:08,845 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:03:08,845 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:03:08,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:03:08,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:03:08,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:03:08,845 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:03:08,845 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:03:08,846 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:03:08,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2024-11-19 15:03:08,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:03:08,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:03:08,858 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-19 15:03:08,858 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-19 15:03:08,859 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:03:08,868 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:03:08,869 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:03:08,869 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:03:08,869 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:03:08,869 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:03:08,869 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:03:08,869 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:03:08,870 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:03:08,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2024-11-19 15:03:08,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:03:08,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:03:08,882 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-19 15:03:08,883 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-19 15:03:08,883 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:03:08,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:03:08,893 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:03:08,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:03:08,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:03:08,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:03:08,894 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:03:08,894 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:03:08,895 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:03:08,905 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-19 15:03:08,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:03:08,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:03:08,906 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-19 15:03:08,907 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-19 15:03:08,908 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 15:03:08,917 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:03:08,917 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:03:08,918 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:03:08,918 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:03:08,918 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:03:08,918 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:03:08,918 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:03:08,919 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:03:08,929 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-19 15:03:08,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:03:08,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:03:08,931 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-19 15:03:08,931 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-19 15:03:08,932 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:03:08,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:03:08,942 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:03:08,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:03:08,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:03:08,942 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:03:08,942 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:03:08,942 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:03:08,944 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:03:08,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2024-11-19 15:03:08,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:03:08,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:03:08,955 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-19 15:03:08,956 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-19 15:03:08,956 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 15:03:08,966 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:03:08,966 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:03:08,966 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:03:08,966 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:03:08,966 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:03:08,966 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:03:08,966 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:03:08,968 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:03:08,978 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-19 15:03:08,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:03:08,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:03:08,979 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-19 15:03:08,980 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-19 15:03:08,981 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 15:03:08,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:03:08,990 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:03:08,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:03:08,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:03:08,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:03:08,991 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:03:08,991 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:03:08,992 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:03:09,002 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-19 15:03:09,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:03:09,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:03:09,003 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-19 15:03:09,004 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-19 15:03:09,005 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:03:09,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:03:09,015 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:03:09,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:03:09,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:03:09,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:03:09,015 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:03:09,015 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:03:09,016 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:03:09,027 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-19 15:03:09,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:03:09,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:03:09,029 INFO L229 MonitoredProcess]: Starting monitored process 98 with /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-19 15:03:09,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2024-11-19 15:03:09,030 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:03:09,040 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:03:09,040 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:03:09,040 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:03:09,040 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:03:09,040 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:03:09,040 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:03:09,040 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:03:09,042 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:03:09,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2024-11-19 15:03:09,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:03:09,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:03:09,054 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:03:09,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2024-11-19 15:03:09,055 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:03:09,065 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:03:09,065 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:03:09,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:03:09,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:03:09,065 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:03:09,065 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:03:09,065 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:03:09,066 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:03:09,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0 [2024-11-19 15:03:09,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:03:09,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:03:09,078 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-19 15:03:09,079 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-19 15:03:09,080 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:03:09,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:03:09,090 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:03:09,090 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:03:09,090 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:03:09,090 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:03:09,090 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:03:09,090 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:03:09,091 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:03:09,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Forceful destruction successful, exit code 0 [2024-11-19 15:03:09,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:03:09,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:03:09,103 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-19 15:03:09,104 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-19 15:03:09,104 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:03:09,114 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:03:09,114 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:03:09,114 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:03:09,114 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:03:09,114 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:03:09,114 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:03:09,114 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:03:09,115 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:03:09,125 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-19 15:03:09,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:03:09,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:03:09,127 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-19 15:03:09,127 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-19 15:03:09,128 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:03:09,138 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:03:09,138 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:03:09,138 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:03:09,138 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:03:09,138 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:03:09,138 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:03:09,138 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:03:09,139 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:03:09,149 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-19 15:03:09,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:03:09,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:03:09,151 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-19 15:03:09,152 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-19 15:03:09,152 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 15:03:09,162 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:03:09,162 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:03:09,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:03:09,162 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:03:09,162 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:03:09,163 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:03:09,163 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:03:09,164 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:03:09,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Ended with exit code 0 [2024-11-19 15:03:09,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:03:09,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:03:09,175 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-19 15:03:09,176 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-19 15:03:09,177 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:03:09,186 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:03:09,186 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:03:09,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:03:09,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:03:09,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:03:09,187 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:03:09,187 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:03:09,188 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:03:09,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Ended with exit code 0 [2024-11-19 15:03:09,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:03:09,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:03:09,200 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-19 15:03:09,201 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-19 15:03:09,202 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:03:09,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:03:09,211 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-19 15:03:09,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:03:09,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:03:09,212 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:03:09,212 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-19 15:03:09,212 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-19 15:03:09,213 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:03:09,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Ended with exit code 0 [2024-11-19 15:03:09,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:03:09,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:03:09,225 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-19 15:03:09,226 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-19 15:03:09,226 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:03:09,236 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:03:09,236 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:03:09,236 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:03:09,236 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:03:09,238 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 15:03:09,238 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 15:03:09,243 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:03:09,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Ended with exit code 0 [2024-11-19 15:03:09,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:03:09,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:03:09,254 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-19 15:03:09,255 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-19 15:03:09,256 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:03:09,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:03:09,266 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:03:09,266 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:03:09,266 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:03:09,267 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 15:03:09,267 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 15:03:09,270 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:03:09,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Ended with exit code 0 [2024-11-19 15:03:09,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:03:09,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:03:09,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-19 15:03:09,284 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-19 15:03:09,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-19 15:03:09,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:03:09,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:03:09,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:03:09,295 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:03:09,297 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 15:03:09,297 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 15:03:09,299 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:03:09,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Forceful destruction successful, exit code 0 [2024-11-19 15:03:09,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:03:09,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:03:09,311 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-19 15:03:09,312 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-19 15:03:09,312 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:03:09,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:03:09,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:03:09,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:03:09,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:03:09,323 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 15:03:09,323 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 15:03:09,326 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:03:09,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-19 15:03:09,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:03:09,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:03:09,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-19 15:03:09,338 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-19 15:03:09,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-19 15:03:09,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:03:09,349 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:03:09,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:03:09,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:03:09,350 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 15:03:09,350 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 15:03:09,352 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:03:09,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2024-11-19 15:03:09,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:03:09,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:03:09,364 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-19 15:03:09,365 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-19 15:03:09,365 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:03:09,375 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:03:09,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:03:09,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:03:09,375 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:03:09,376 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 15:03:09,376 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 15:03:09,380 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:03:09,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Ended with exit code 0 [2024-11-19 15:03:09,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:03:09,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:03:09,392 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-19 15:03:09,392 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-19 15:03:09,393 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:03:09,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:03:09,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:03:09,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:03:09,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:03:09,404 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 15:03:09,404 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 15:03:09,407 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:03:09,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Ended with exit code 0 [2024-11-19 15:03:09,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:03:09,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:03:09,419 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-19 15:03:09,420 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-19 15:03:09,420 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 15:03:09,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:03:09,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:03:09,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:03:09,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:03:09,433 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 15:03:09,433 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 15:03:09,438 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:03:09,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0 [2024-11-19 15:03:09,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:03:09,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:03:09,450 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-19 15:03:09,451 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-19 15:03:09,452 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-19 15:03:09,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:03:09,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:03:09,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:03:09,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:03:09,464 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 15:03:09,464 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 15:03:09,467 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-19 15:03:09,477 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-19 15:03:09,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:03:09,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:03:09,479 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:03:09,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2024-11-19 15:03:09,480 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-19 15:03:09,489 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-19 15:03:09,490 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-19 15:03:09,490 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-19 15:03:09,490 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-19 15:03:09,494 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-19 15:03:09,494 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-19 15:03:09,501 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-19 15:03:09,516 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2024-11-19 15:03:09,516 INFO L444 ModelExtractionUtils]: 5 out of 16 variables were initially zero. Simplification set additionally 8 variables to zero. [2024-11-19 15:03:09,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-19 15:03:09,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 15:03:09,518 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-19 15:03:09,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2024-11-19 15:03:09,519 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-19 15:03:09,529 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-19 15:03:09,529 INFO L474 LassoAnalysis]: Proved termination. [2024-11-19 15:03:09,529 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#2 func_to_recursive_line_22_to_23_0_#in~b.base) func_to_recursive_line_22_to_23_0_#in~b.offset)_2) = -2*v_rep(select (select #memory_int#2 func_to_recursive_line_22_to_23_0_#in~b.base) func_to_recursive_line_22_to_23_0_#in~b.offset)_2 + 11 Supporting invariants [] [2024-11-19 15:03:09,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Ended with exit code 0 [2024-11-19 15:03:09,572 INFO L156 tatePredicateManager]: 12 out of 12 supporting invariants were superfluous and have been removed [2024-11-19 15:03:09,574 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-11-19 15:03:09,574 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-11-19 15:03:09,574 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#in~b!base,]]] [2024-11-19 15:03:09,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:03:09,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:03:09,997 INFO L255 TraceCheckSpWp]: Trace formula consists of 3122 conjuncts, 106 conjuncts are in the unsatisfiable core [2024-11-19 15:03:10,006 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 15:03:10,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Ended with exit code 0 [2024-11-19 15:03:12,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:03:12,291 INFO L255 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-19 15:03:12,293 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 15:03:12,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 20 [2024-11-19 15:03:12,499 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-11-19 15:03:12,500 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2024-11-19 15:03:12,500 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 118 states and 141 transitions. cyclomatic complexity: 30 Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-19 15:03:12,629 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 118 states and 141 transitions. cyclomatic complexity: 30. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Result 150 states and 176 transitions. Complement of second has 23 states. [2024-11-19 15:03:12,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2024-11-19 15:03:12,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-19 15:03:12,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 20 transitions. [2024-11-19 15:03:12,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 20 transitions. Stem has 261 letters. Loop has 39 letters. [2024-11-19 15:03:12,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 15:03:12,631 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 15:03:12,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:03:13,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:03:13,042 INFO L255 TraceCheckSpWp]: Trace formula consists of 3122 conjuncts, 106 conjuncts are in the unsatisfiable core [2024-11-19 15:03:13,051 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 15:03:15,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:03:15,357 INFO L255 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-19 15:03:15,358 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 15:03:15,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 20 [2024-11-19 15:03:15,583 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-11-19 15:03:15,584 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 5 loop predicates [2024-11-19 15:03:15,584 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 118 states and 141 transitions. cyclomatic complexity: 30 Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-19 15:03:15,716 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 118 states and 141 transitions. cyclomatic complexity: 30. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Result 150 states and 176 transitions. Complement of second has 23 states. [2024-11-19 15:03:15,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2024-11-19 15:03:15,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 5 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-19 15:03:15,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 20 transitions. [2024-11-19 15:03:15,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 20 transitions. Stem has 261 letters. Loop has 39 letters. [2024-11-19 15:03:15,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-19 15:03:15,719 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-19 15:03:15,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 15:03:16,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:03:16,141 INFO L255 TraceCheckSpWp]: Trace formula consists of 3122 conjuncts, 106 conjuncts are in the unsatisfiable core [2024-11-19 15:03:16,148 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 15:03:18,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 15:03:18,235 INFO L255 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-19 15:03:18,237 INFO L278 TraceCheckSpWp]: Computing forward predicates...