./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 c7c6ca5d 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-?-c7c6ca5-m [2024-11-09 16:06:55,527 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 16:06:55,590 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-09 16:06:55,595 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 16:06:55,598 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 16:06:55,622 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 16:06:55,623 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 16:06:55,623 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 16:06:55,623 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 16:06:55,623 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 16:06:55,624 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 16:06:55,624 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 16:06:55,624 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 16:06:55,625 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-09 16:06:55,625 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-09 16:06:55,625 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-09 16:06:55,625 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-09 16:06:55,626 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-09 16:06:55,626 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-09 16:06:55,626 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 16:06:55,626 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-09 16:06:55,627 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 16:06:55,627 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 16:06:55,627 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 16:06:55,628 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 16:06:55,628 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-09 16:06:55,628 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-09 16:06:55,628 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-09 16:06:55,628 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 16:06:55,629 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 16:06:55,629 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 16:06:55,629 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 16:06:55,629 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-09 16:06:55,629 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 16:06:55,630 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 16:06:55,630 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 16:06:55,632 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 16:06:55,632 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 16:06:55,633 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-09 16:06:55,633 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-09 16:06:55,827 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 16:06:55,846 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 16:06:55,848 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 16:06:55,848 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 16:06:55,849 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 16:06:55,850 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-09 16:06:57,022 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 16:06:57,185 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 16:06:57,185 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c [2024-11-09 16:06:57,193 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f579a407/cb56104a7ed14b799b25436b75d808bb/FLAG3678736ab [2024-11-09 16:06:57,205 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f579a407/cb56104a7ed14b799b25436b75d808bb [2024-11-09 16:06:57,208 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 16:06:57,209 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 16:06:57,210 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 16:06:57,210 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 16:06:57,214 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 16:06:57,214 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:06:57" (1/1) ... [2024-11-09 16:06:57,215 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2091a514 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:06:57, skipping insertion in model container [2024-11-09 16:06:57,215 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:06:57" (1/1) ... [2024-11-09 16:06:57,231 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 16:06:57,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 16:06:57,380 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 16:06:57,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 16:06:57,404 INFO L204 MainTranslator]: Completed translation [2024-11-09 16:06:57,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:06:57 WrapperNode [2024-11-09 16:06:57,405 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 16:06:57,406 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 16:06:57,406 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 16:06:57,406 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 16:06:57,411 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:06:57" (1/1) ... [2024-11-09 16:06:57,416 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:06:57" (1/1) ... [2024-11-09 16:06:57,428 INFO L138 Inliner]: procedures = 14, calls = 41, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 53 [2024-11-09 16:06:57,428 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 16:06:57,428 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 16:06:57,429 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 16:06:57,429 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 16:06:57,436 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:06:57" (1/1) ... [2024-11-09 16:06:57,437 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:06:57" (1/1) ... [2024-11-09 16:06:57,439 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:06:57" (1/1) ... [2024-11-09 16:06:57,450 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-09 16:06:57,451 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:06:57" (1/1) ... [2024-11-09 16:06:57,451 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:06:57" (1/1) ... [2024-11-09 16:06:57,455 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:06:57" (1/1) ... [2024-11-09 16:06:57,457 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:06:57" (1/1) ... [2024-11-09 16:06:57,458 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:06:57" (1/1) ... [2024-11-09 16:06:57,459 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:06:57" (1/1) ... [2024-11-09 16:06:57,460 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 16:06:57,461 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 16:06:57,461 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 16:06:57,461 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 16:06:57,462 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:06:57" (1/1) ... [2024-11-09 16:06:57,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:06:57,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:06:57,487 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-09 16:06:57,490 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-09 16:06:57,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 16:06:57,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 16:06:57,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 16:06:57,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 16:06:57,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 16:06:57,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 16:06:57,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 16:06:57,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 16:06:57,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 16:06:57,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 16:06:57,526 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_23_0 [2024-11-09 16:06:57,526 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_23_0 [2024-11-09 16:06:57,526 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_22_to_23_0 [2024-11-09 16:06:57,526 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_22_to_23_0 [2024-11-09 16:06:57,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 16:06:57,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 16:06:57,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 16:06:57,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 16:06:57,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 16:06:57,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 16:06:57,528 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_21_to_22_0 [2024-11-09 16:06:57,528 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_21_to_22_0 [2024-11-09 16:06:57,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 16:06:57,589 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 16:06:57,591 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 16:06:57,735 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-11-09 16:06:57,735 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 16:06:57,745 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 16:06:57,745 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 16:06:57,746 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:06:57 BoogieIcfgContainer [2024-11-09 16:06:57,746 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 16:06:57,746 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-09 16:06:57,746 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-09 16:06:57,751 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-09 16:06:57,752 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 16:06:57,752 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.11 04:06:57" (1/3) ... [2024-11-09 16:06:57,753 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@248c1f49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 04:06:57, skipping insertion in model container [2024-11-09 16:06:57,753 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 16:06:57,753 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:06:57" (2/3) ... [2024-11-09 16:06:57,754 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@248c1f49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 04:06:57, skipping insertion in model container [2024-11-09 16:06:57,754 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 16:06:57,754 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:06:57" (3/3) ... [2024-11-09 16:06:57,755 INFO L332 chiAutomizerObserver]: Analyzing ICFG recursified_nested_3.c [2024-11-09 16:06:57,800 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-09 16:06:57,800 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-09 16:06:57,800 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-09 16:06:57,800 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-09 16:06:57,800 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-09 16:06:57,801 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-09 16:06:57,801 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-09 16:06:57,801 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-09 16:06:57,804 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-09 16:06:57,831 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-11-09 16:06:57,832 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:06:57,832 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:06:57,836 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-09 16:06:57,836 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 16:06:57,837 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-09 16:06:57,837 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-09 16:06:57,839 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-11-09 16:06:57,839 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:06:57,839 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:06:57,839 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-09 16:06:57,839 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 16:06:57,844 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#2(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#3(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#2(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-09 16:06:57,856 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#2(~a.base, ~a.offset, 4); 16#L61true assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(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#3(~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#2(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(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-09 16:06:57,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:06:57,860 INFO L85 PathProgramCache]: Analyzing trace with hash 49760, now seen corresponding path program 1 times [2024-11-09 16:06:57,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:06:57,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548049846] [2024-11-09 16:06:57,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:06:57,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:06:57,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:06:57,962 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:06:57,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:06:57,999 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:06:58,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:06:58,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1113047060, now seen corresponding path program 1 times [2024-11-09 16:06:58,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:06:58,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150647350] [2024-11-09 16:06:58,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:06:58,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:06:58,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:06:58,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:06:58,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:06:58,283 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-09 16:06:58,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 16:06:58,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150647350] [2024-11-09 16:06:58,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150647350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 16:06:58,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 16:06:58,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 16:06:58,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460659456] [2024-11-09 16:06:58,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 16:06:58,288 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 16:06:58,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 16:06:58,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 16:06:58,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 16:06:58,316 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-09 16:06:58,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 16:06:58,423 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2024-11-09 16:06:58,425 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 46 transitions. [2024-11-09 16:06:58,427 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-11-09 16:06:58,434 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 24 states and 29 transitions. [2024-11-09 16:06:58,434 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2024-11-09 16:06:58,434 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-11-09 16:06:58,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 29 transitions. [2024-11-09 16:06:58,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 16:06:58,436 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 29 transitions. [2024-11-09 16:06:58,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 29 transitions. [2024-11-09 16:06:58,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2024-11-09 16:06:58,454 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-09 16:06:58,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-11-09 16:06:58,456 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-11-09 16:06:58,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 16:06:58,460 INFO L425 stractBuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-11-09 16:06:58,460 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-09 16:06:58,460 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 26 transitions. [2024-11-09 16:06:58,462 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-11-09 16:06:58,462 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:06:58,462 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:06:58,464 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-09 16:06:58,464 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-09 16:06:58,464 INFO L745 eck$LassoCheckResult]: Stem: 108#$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); 105#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#2(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#3(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#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 90#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);< 91#$Ultimate##0 [2024-11-09 16:06:58,464 INFO L747 eck$LassoCheckResult]: Loop: 91#$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#2(~a.base, ~a.offset, 4); 107#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~b.base, ~b.offset, 4); 97#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 102#$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#3(~b.base, ~b.offset, 4); 101#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 93#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 92#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 95#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 104#L25-1 assume true; 103#func_to_recursive_line_23_to_23_0EXIT >#64#return; 100#L47-1 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 98#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 102#$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#3(~b.base, ~b.offset, 4); 101#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 96#L41-1 assume true; 99#func_to_recursive_line_22_to_23_0EXIT >#66#return; 106#L41-1 assume true; 110#func_to_recursive_line_22_to_23_0EXIT >#70#return; 109#L67-1 call #t~mem11 := read~int#2(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12; 89#L72 call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);< 91#$Ultimate##0 [2024-11-09 16:06:58,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:06:58,466 INFO L85 PathProgramCache]: Analyzing trace with hash 49760, now seen corresponding path program 2 times [2024-11-09 16:06:58,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:06:58,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769648922] [2024-11-09 16:06:58,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:06:58,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:06:58,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:06:58,486 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:06:58,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:06:58,493 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:06:58,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:06:58,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1122494970, now seen corresponding path program 1 times [2024-11-09 16:06:58,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:06:58,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768543068] [2024-11-09 16:06:58,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:06:58,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:06:58,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:06:58,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:06:58,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:06:58,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:06:58,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:06:58,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 16:06:58,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:06:58,721 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-09 16:06:58,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 16:06:58,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768543068] [2024-11-09 16:06:58,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768543068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 16:06:58,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 16:06:58,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 16:06:58,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666123975] [2024-11-09 16:06:58,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 16:06:58,724 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 16:06:58,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 16:06:58,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 16:06:58,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 16:06:58,726 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. cyclomatic complexity: 7 Second operand has 7 states, 6 states have (on average 2.0) 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-09 16:06:58,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 16:06:58,804 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2024-11-09 16:06:58,804 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions. [2024-11-09 16:06:58,806 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-11-09 16:06:58,808 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 28 transitions. [2024-11-09 16:06:58,809 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2024-11-09 16:06:58,809 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-11-09 16:06:58,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2024-11-09 16:06:58,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 16:06:58,809 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-11-09 16:06:58,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2024-11-09 16:06:58,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-09 16:06:58,811 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-09 16:06:58,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2024-11-09 16:06:58,811 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-11-09 16:06:58,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 16:06:58,812 INFO L425 stractBuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-11-09 16:06:58,813 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-09 16:06:58,813 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 28 transitions. [2024-11-09 16:06:58,813 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-11-09 16:06:58,813 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:06:58,813 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:06:58,814 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-09 16:06:58,814 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-09 16:06:58,814 INFO L745 eck$LassoCheckResult]: Stem: 192#$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); 188#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#2(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#3(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#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 173#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);< 174#$Ultimate##0 [2024-11-09 16:06:58,814 INFO L747 eck$LassoCheckResult]: Loop: 174#$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#2(~a.base, ~a.offset, 4); 191#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~b.base, ~b.offset, 4); 176#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 185#$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#3(~b.base, ~b.offset, 4); 184#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 180#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 179#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 182#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; 181#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 179#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 182#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 189#L25-1 assume true; 186#func_to_recursive_line_23_to_23_0EXIT >#62#return; 187#L25-1 assume true; 195#func_to_recursive_line_23_to_23_0EXIT >#64#return; 183#L47-1 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 177#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 185#$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#3(~b.base, ~b.offset, 4); 184#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 175#L41-1 assume true; 178#func_to_recursive_line_22_to_23_0EXIT >#66#return; 190#L41-1 assume true; 194#func_to_recursive_line_22_to_23_0EXIT >#70#return; 193#L67-1 call #t~mem11 := read~int#2(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12; 172#L72 call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);< 174#$Ultimate##0 [2024-11-09 16:06:58,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:06:58,815 INFO L85 PathProgramCache]: Analyzing trace with hash 49760, now seen corresponding path program 3 times [2024-11-09 16:06:58,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:06:58,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466712327] [2024-11-09 16:06:58,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:06:58,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:06:58,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:06:58,829 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:06:58,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:06:58,840 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:06:58,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:06:58,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1944809856, now seen corresponding path program 1 times [2024-11-09 16:06:58,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:06:58,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592418259] [2024-11-09 16:06:58,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:06:58,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:06:58,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:06:58,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:06:58,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:06:59,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:06:59,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:06:59,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:06:59,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:06:59,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 16:06:59,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:06:59,259 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-09 16:06:59,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 16:06:59,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592418259] [2024-11-09 16:06:59,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592418259] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 16:06:59,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554755303] [2024-11-09 16:06:59,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:06:59,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 16:06:59,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:06:59,263 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-09 16:06:59,264 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-09 16:06:59,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:06:59,334 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 16:06:59,337 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:06:59,367 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-09 16:06:59,570 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-09 16:06:59,570 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 16:06:59,926 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-09 16:06:59,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554755303] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 16:06:59,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 16:06:59,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 25 [2024-11-09 16:06:59,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005147784] [2024-11-09 16:06:59,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 16:06:59,928 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 16:06:59,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 16:06:59,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-09 16:06:59,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2024-11-09 16:06:59,931 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. cyclomatic complexity: 7 Second operand has 25 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 20 states have internal predecessors, (35), 10 states have call successors, (12), 7 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-09 16:07:00,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 16:07:00,269 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2024-11-09 16:07:00,269 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 32 transitions. [2024-11-09 16:07:00,270 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-11-09 16:07:00,270 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 32 transitions. [2024-11-09 16:07:00,270 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2024-11-09 16:07:00,271 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2024-11-09 16:07:00,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 32 transitions. [2024-11-09 16:07:00,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 16:07:00,271 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-11-09 16:07:00,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 32 transitions. [2024-11-09 16:07:00,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-09 16:07:00,274 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-09 16:07:00,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-11-09 16:07:00,275 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-11-09 16:07:00,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 16:07:00,276 INFO L425 stractBuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-11-09 16:07:00,276 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-09 16:07:00,276 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 32 transitions. [2024-11-09 16:07:00,276 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-11-09 16:07:00,276 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:07:00,276 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:07:00,277 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-09 16:07:00,277 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-09 16:07:00,277 INFO L745 eck$LassoCheckResult]: Stem: 472#$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); 466#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#2(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#3(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#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 453#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);< 454#$Ultimate##0 [2024-11-09 16:07:00,278 INFO L747 eck$LassoCheckResult]: Loop: 454#$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#2(~a.base, ~a.offset, 4); 471#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~b.base, ~b.offset, 4); 456#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 465#$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#3(~b.base, ~b.offset, 4); 463#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 460#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 459#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 462#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; 461#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 459#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 462#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; 461#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 459#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 462#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 469#L25-1 assume true; 467#func_to_recursive_line_23_to_23_0EXIT >#62#return; 468#L25-1 assume true; 479#func_to_recursive_line_23_to_23_0EXIT >#62#return; 478#L25-1 assume true; 477#func_to_recursive_line_23_to_23_0EXIT >#64#return; 464#L47-1 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 457#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 465#$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#3(~b.base, ~b.offset, 4); 463#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 460#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 459#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 462#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; 461#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 459#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 462#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; 461#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 459#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 462#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 469#L25-1 assume true; 467#func_to_recursive_line_23_to_23_0EXIT >#62#return; 468#L25-1 assume true; 479#func_to_recursive_line_23_to_23_0EXIT >#62#return; 478#L25-1 assume true; 477#func_to_recursive_line_23_to_23_0EXIT >#64#return; 464#L47-1 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 457#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 465#$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#3(~b.base, ~b.offset, 4); 463#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 455#L41-1 assume true; 458#func_to_recursive_line_22_to_23_0EXIT >#66#return; 470#L41-1 assume true; 476#func_to_recursive_line_22_to_23_0EXIT >#66#return; 475#L41-1 assume true; 474#func_to_recursive_line_22_to_23_0EXIT >#70#return; 473#L67-1 call #t~mem11 := read~int#2(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12; 452#L72 call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);< 454#$Ultimate##0 [2024-11-09 16:07:00,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:00,278 INFO L85 PathProgramCache]: Analyzing trace with hash 49760, now seen corresponding path program 4 times [2024-11-09 16:07:00,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:00,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272702023] [2024-11-09 16:07:00,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:00,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:00,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:00,285 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:07:00,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:00,291 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:07:00,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:00,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1306331242, now seen corresponding path program 2 times [2024-11-09 16:07:00,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:00,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823686902] [2024-11-09 16:07:00,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:00,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:00,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:00,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:00,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:00,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:00,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:00,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:00,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:00,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:00,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:00,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 16:07:00,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:00,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:00,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:00,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:00,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:00,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:00,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:00,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 16:07:00,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:00,958 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-09 16:07:00,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 16:07:00,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823686902] [2024-11-09 16:07:00,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823686902] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 16:07:00,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782245107] [2024-11-09 16:07:00,959 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 16:07:00,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 16:07:00,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:00,961 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-09 16:07:00,962 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-09 16:07:01,041 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 16:07:01,041 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 16:07:01,044 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-09 16:07:01,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:07:01,068 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-09 16:07:01,222 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-09 16:07:01,223 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 16:07:01,839 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-09 16:07:01,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782245107] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 16:07:01,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 16:07:01,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 14] total 30 [2024-11-09 16:07:01,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195021088] [2024-11-09 16:07:01,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 16:07:01,840 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 16:07:01,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 16:07:01,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-09 16:07:01,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=720, Unknown=0, NotChecked=0, Total=870 [2024-11-09 16:07:01,841 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. cyclomatic complexity: 7 Second operand has 30 states, 22 states have (on average 2.227272727272727) internal successors, (49), 25 states have internal predecessors, (49), 10 states have call successors, (22), 7 states have call predecessors, (22), 9 states have return successors, (17), 7 states have call predecessors, (17), 10 states have call successors, (17) [2024-11-09 16:07:02,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 16:07:02,119 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2024-11-09 16:07:02,119 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 36 transitions. [2024-11-09 16:07:02,120 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-11-09 16:07:02,121 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 36 transitions. [2024-11-09 16:07:02,121 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2024-11-09 16:07:02,121 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2024-11-09 16:07:02,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 36 transitions. [2024-11-09 16:07:02,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 16:07:02,122 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-11-09 16:07:02,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 36 transitions. [2024-11-09 16:07:02,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-09 16:07:02,127 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-09 16:07:02,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2024-11-09 16:07:02,127 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-11-09 16:07:02,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 16:07:02,129 INFO L425 stractBuchiCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-11-09 16:07:02,130 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-09 16:07:02,130 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 36 transitions. [2024-11-09 16:07:02,131 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-11-09 16:07:02,131 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:07:02,131 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:07:02,132 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-09 16:07:02,133 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-09 16:07:02,133 INFO L745 eck$LassoCheckResult]: Stem: 1008#$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); 1004#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#2(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#3(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#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 989#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);< 990#$Ultimate##0 [2024-11-09 16:07:02,133 INFO L747 eck$LassoCheckResult]: Loop: 990#$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#2(~a.base, ~a.offset, 4); 1007#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~b.base, ~b.offset, 4); 993#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 1001#$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#3(~b.base, ~b.offset, 4); 1000#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 997#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 995#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 998#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; 996#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 995#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 998#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; 996#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 995#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 998#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; 996#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 995#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 998#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; 996#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 995#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 998#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1005#L25-1 assume true; 1002#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1003#L25-1 assume true; 1019#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1018#L25-1 assume true; 1017#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1016#L25-1 assume true; 1015#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1014#L25-1 assume true; 1013#func_to_recursive_line_23_to_23_0EXIT >#64#return; 999#L47-1 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 992#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 1001#$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#3(~b.base, ~b.offset, 4); 1000#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 997#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 995#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 998#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; 996#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 995#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 998#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; 996#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 995#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 998#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; 996#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 995#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 998#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; 996#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 995#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 998#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1005#L25-1 assume true; 1002#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1003#L25-1 assume true; 1019#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1018#L25-1 assume true; 1017#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1016#L25-1 assume true; 1015#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1014#L25-1 assume true; 1013#func_to_recursive_line_23_to_23_0EXIT >#64#return; 999#L47-1 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 992#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 1001#$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#3(~b.base, ~b.offset, 4); 1000#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 991#L41-1 assume true; 994#func_to_recursive_line_22_to_23_0EXIT >#66#return; 1006#L41-1 assume true; 1012#func_to_recursive_line_22_to_23_0EXIT >#66#return; 1011#L41-1 assume true; 1010#func_to_recursive_line_22_to_23_0EXIT >#70#return; 1009#L67-1 call #t~mem11 := read~int#2(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12; 988#L72 call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);< 990#$Ultimate##0 [2024-11-09 16:07:02,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:02,134 INFO L85 PathProgramCache]: Analyzing trace with hash 49760, now seen corresponding path program 5 times [2024-11-09 16:07:02,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:02,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32203855] [2024-11-09 16:07:02,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:02,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:02,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:02,140 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:07:02,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:02,149 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:07:02,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:02,150 INFO L85 PathProgramCache]: Analyzing trace with hash -909942614, now seen corresponding path program 3 times [2024-11-09 16:07:02,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:02,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834119049] [2024-11-09 16:07:02,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:02,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:02,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:02,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:02,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:02,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:02,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:03,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:03,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:03,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:03,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:03,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:03,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:03,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:03,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:03,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 16:07:03,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:03,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:03,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:03,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:03,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:03,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:03,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:03,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:03,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:03,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:03,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:03,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 16:07:03,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:03,354 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 10 proven. 118 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-11-09 16:07:03,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 16:07:03,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834119049] [2024-11-09 16:07:03,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834119049] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 16:07:03,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351483942] [2024-11-09 16:07:03,354 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 16:07:03,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 16:07:03,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:03,357 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-09 16:07:03,359 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-09 16:07:03,437 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-09 16:07:03,437 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 16:07:03,438 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-09 16:07:03,444 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:07:03,447 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-09 16:07:03,659 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-09 16:07:03,659 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 16:07:04,225 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-09 16:07:04,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351483942] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 16:07:04,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 16:07:04,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 14] total 35 [2024-11-09 16:07:04,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580173000] [2024-11-09 16:07:04,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 16:07:04,226 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 16:07:04,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 16:07:04,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-09 16:07:04,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1032, Unknown=0, NotChecked=0, Total=1190 [2024-11-09 16:07:04,228 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. cyclomatic complexity: 7 Second operand has 35 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 29 states have internal predecessors, (48), 13 states have call successors, (18), 8 states have call predecessors, (18), 13 states have return successors, (19), 13 states have call predecessors, (19), 13 states have call successors, (19) [2024-11-09 16:07:04,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 16:07:04,581 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2024-11-09 16:07:04,582 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 40 transitions. [2024-11-09 16:07:04,583 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-11-09 16:07:04,584 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 40 transitions. [2024-11-09 16:07:04,584 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2024-11-09 16:07:04,584 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2024-11-09 16:07:04,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 40 transitions. [2024-11-09 16:07:04,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 16:07:04,585 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 40 transitions. [2024-11-09 16:07:04,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 40 transitions. [2024-11-09 16:07:04,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-09 16:07:04,587 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-09 16:07:04,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2024-11-09 16:07:04,587 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 40 transitions. [2024-11-09 16:07:04,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 16:07:04,588 INFO L425 stractBuchiCegarLoop]: Abstraction has 36 states and 40 transitions. [2024-11-09 16:07:04,588 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-09 16:07:04,588 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 40 transitions. [2024-11-09 16:07:04,589 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-11-09 16:07:04,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:07:04,589 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:07:04,590 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-09 16:07:04,590 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [18, 18, 15, 15, 15, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 16:07:04,590 INFO L745 eck$LassoCheckResult]: Stem: 1804#$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); 1800#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#2(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#3(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#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 1784#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);< 1785#$Ultimate##0 [2024-11-09 16:07:04,591 INFO L747 eck$LassoCheckResult]: Loop: 1785#$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#2(~a.base, ~a.offset, 4); 1803#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~b.base, ~b.offset, 4); 1788#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 1797#$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#3(~b.base, ~b.offset, 4); 1794#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 1792#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1790#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1793#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; 1791#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1790#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1793#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; 1791#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1790#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1793#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; 1791#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1790#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1793#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; 1791#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1790#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1793#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; 1791#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1790#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1793#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1801#L25-1 assume true; 1798#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1799#L25-1 assume true; 1818#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1817#L25-1 assume true; 1816#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1815#L25-1 assume true; 1814#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1813#L25-1 assume true; 1812#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1811#L25-1 assume true; 1810#func_to_recursive_line_23_to_23_0EXIT >#64#return; 1796#L47-1 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 1787#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 1797#$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#3(~b.base, ~b.offset, 4); 1794#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 1792#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1790#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1793#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; 1791#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1790#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1793#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; 1791#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1790#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1793#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; 1791#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1790#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1793#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; 1791#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1790#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1793#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; 1791#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1790#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1793#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1801#L25-1 assume true; 1798#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1799#L25-1 assume true; 1818#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1817#L25-1 assume true; 1816#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1815#L25-1 assume true; 1814#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1813#L25-1 assume true; 1812#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1811#L25-1 assume true; 1810#func_to_recursive_line_23_to_23_0EXIT >#64#return; 1796#L47-1 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 1787#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 1797#$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#3(~b.base, ~b.offset, 4); 1794#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 1792#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1790#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1793#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; 1791#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1790#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1793#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; 1791#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1790#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1793#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; 1791#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1790#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1793#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; 1791#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1790#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1793#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; 1791#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 1790#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 1793#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1801#L25-1 assume true; 1798#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1799#L25-1 assume true; 1818#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1817#L25-1 assume true; 1816#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1815#L25-1 assume true; 1814#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1813#L25-1 assume true; 1812#func_to_recursive_line_23_to_23_0EXIT >#62#return; 1811#L25-1 assume true; 1810#func_to_recursive_line_23_to_23_0EXIT >#64#return; 1796#L47-1 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 1787#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 1797#$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#3(~b.base, ~b.offset, 4); 1794#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1795#L41-1 assume true; 1802#func_to_recursive_line_22_to_23_0EXIT >#66#return; 1786#L41-1 assume true; 1789#func_to_recursive_line_22_to_23_0EXIT >#66#return; 1809#L41-1 assume true; 1808#func_to_recursive_line_22_to_23_0EXIT >#66#return; 1807#L41-1 assume true; 1806#func_to_recursive_line_22_to_23_0EXIT >#70#return; 1805#L67-1 call #t~mem11 := read~int#2(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12; 1783#L72 call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);< 1785#$Ultimate##0 [2024-11-09 16:07:04,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:04,591 INFO L85 PathProgramCache]: Analyzing trace with hash 49760, now seen corresponding path program 6 times [2024-11-09 16:07:04,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:04,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32889823] [2024-11-09 16:07:04,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:04,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:04,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:04,597 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:07:04,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:04,601 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:07:04,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:04,601 INFO L85 PathProgramCache]: Analyzing trace with hash -11960144, now seen corresponding path program 4 times [2024-11-09 16:07:04,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:04,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717632091] [2024-11-09 16:07:04,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:04,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:04,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:05,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:05,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:05,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:05,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:05,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:05,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:06,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:06,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:06,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:06,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:06,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:06,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:06,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:06,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:06,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:06,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:06,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:06,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:06,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:06,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:06,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:06,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:06,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:06,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:06,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:06,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:06,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:06,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:06,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:06,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:06,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:06,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:06,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:06,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:06,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:06,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:06,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:06,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:06,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:06,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:06,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:06,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:06,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 16:07:06,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:06,409 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 14 proven. 307 refuted. 0 times theorem prover too weak. 429 trivial. 0 not checked. [2024-11-09 16:07:06,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 16:07:06,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717632091] [2024-11-09 16:07:06,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717632091] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 16:07:06,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827018622] [2024-11-09 16:07:06,409 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 16:07:06,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 16:07:06,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:06,412 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-09 16:07:06,413 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-09 16:07:06,552 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 16:07:06,552 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 16:07:06,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 681 conjuncts, 100 conjuncts are in the unsatisfiable core [2024-11-09 16:07:06,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:07:06,584 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-09 16:07:06,837 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 346 proven. 35 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2024-11-09 16:07:06,837 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 16:07:08,479 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 6 proven. 414 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2024-11-09 16:07:08,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827018622] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 16:07:08,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 16:07:08,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 26] total 45 [2024-11-09 16:07:08,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812258848] [2024-11-09 16:07:08,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 16:07:08,480 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 16:07:08,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 16:07:08,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-09 16:07:08,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=1641, Unknown=0, NotChecked=0, Total=1980 [2024-11-09 16:07:08,481 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. cyclomatic complexity: 7 Second operand has 45 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 37 states have internal predecessors, (61), 13 states have call successors, (25), 10 states have call predecessors, (25), 15 states have return successors, (26), 13 states have call predecessors, (26), 13 states have call successors, (26) [2024-11-09 16:07:08,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 16:07:08,834 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2024-11-09 16:07:08,834 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 42 transitions. [2024-11-09 16:07:08,834 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-11-09 16:07:08,835 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 42 transitions. [2024-11-09 16:07:08,835 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2024-11-09 16:07:08,835 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2024-11-09 16:07:08,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 42 transitions. [2024-11-09 16:07:08,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 16:07:08,835 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 42 transitions. [2024-11-09 16:07:08,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 42 transitions. [2024-11-09 16:07:08,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-09 16:07:08,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 23 states have internal predecessors, (23), 6 states have call successors, (6), 3 states have call predecessors, (6), 11 states have return successors, (13), 11 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-09 16:07:08,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2024-11-09 16:07:08,839 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 42 transitions. [2024-11-09 16:07:08,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 16:07:08,840 INFO L425 stractBuchiCegarLoop]: Abstraction has 38 states and 42 transitions. [2024-11-09 16:07:08,841 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-09 16:07:08,841 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 42 transitions. [2024-11-09 16:07:08,841 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-11-09 16:07:08,841 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:07:08,841 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:07:08,843 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-09 16:07:08,843 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [21, 21, 18, 18, 18, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 16:07:08,843 INFO L745 eck$LassoCheckResult]: Stem: 3168#$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); 3164#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#2(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#3(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#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 3149#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);< 3150#$Ultimate##0 [2024-11-09 16:07:08,843 INFO L747 eck$LassoCheckResult]: Loop: 3150#$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#2(~a.base, ~a.offset, 4); 3167#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~b.base, ~b.offset, 4); 3152#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 3161#$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#3(~b.base, ~b.offset, 4); 3160#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 3156#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3155#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3158#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; 3157#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3155#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3158#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; 3157#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3155#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3158#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; 3157#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3155#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3158#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; 3157#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3155#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3158#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; 3157#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3155#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3158#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; 3157#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3155#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3158#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3165#L25-1 assume true; 3162#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3163#L25-1 assume true; 3185#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3184#L25-1 assume true; 3183#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3182#L25-1 assume true; 3181#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3180#L25-1 assume true; 3179#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3178#L25-1 assume true; 3177#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3176#L25-1 assume true; 3175#func_to_recursive_line_23_to_23_0EXIT >#64#return; 3159#L47-1 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 3153#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 3161#$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#3(~b.base, ~b.offset, 4); 3160#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 3156#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3155#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3158#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; 3157#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3155#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3158#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; 3157#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3155#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3158#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; 3157#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3155#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3158#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; 3157#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3155#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3158#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; 3157#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3155#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3158#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; 3157#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3155#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3158#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3165#L25-1 assume true; 3162#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3163#L25-1 assume true; 3185#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3184#L25-1 assume true; 3183#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3182#L25-1 assume true; 3181#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3180#L25-1 assume true; 3179#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3178#L25-1 assume true; 3177#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3176#L25-1 assume true; 3175#func_to_recursive_line_23_to_23_0EXIT >#64#return; 3159#L47-1 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 3153#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 3161#$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#3(~b.base, ~b.offset, 4); 3160#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 3156#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3155#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3158#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; 3157#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3155#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3158#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; 3157#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3155#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3158#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; 3157#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3155#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3158#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; 3157#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3155#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3158#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; 3157#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3155#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3158#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; 3157#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 3155#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 3158#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3165#L25-1 assume true; 3162#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3163#L25-1 assume true; 3185#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3184#L25-1 assume true; 3183#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3182#L25-1 assume true; 3181#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3180#L25-1 assume true; 3179#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3178#L25-1 assume true; 3177#func_to_recursive_line_23_to_23_0EXIT >#62#return; 3176#L25-1 assume true; 3175#func_to_recursive_line_23_to_23_0EXIT >#64#return; 3159#L47-1 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 3153#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 3161#$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#3(~b.base, ~b.offset, 4); 3160#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 3151#L41-1 assume true; 3154#func_to_recursive_line_22_to_23_0EXIT >#66#return; 3166#L41-1 assume true; 3174#func_to_recursive_line_22_to_23_0EXIT >#66#return; 3173#L41-1 assume true; 3172#func_to_recursive_line_22_to_23_0EXIT >#66#return; 3171#L41-1 assume true; 3170#func_to_recursive_line_22_to_23_0EXIT >#70#return; 3169#L67-1 call #t~mem11 := read~int#2(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12; 3148#L72 call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);< 3150#$Ultimate##0 [2024-11-09 16:07:08,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:08,845 INFO L85 PathProgramCache]: Analyzing trace with hash 49760, now seen corresponding path program 7 times [2024-11-09 16:07:08,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:08,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519371887] [2024-11-09 16:07:08,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:08,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:08,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:08,851 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:07:08,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:08,855 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:07:08,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:08,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1552670328, now seen corresponding path program 5 times [2024-11-09 16:07:08,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:08,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046967568] [2024-11-09 16:07:08,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:08,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:08,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:09,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:09,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:09,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:09,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:09,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:09,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:09,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:09,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:09,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:09,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:09,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:09,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:09,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:09,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:09,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:09,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:09,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 16:07:09,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:10,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:10,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:10,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:10,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:10,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:10,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:10,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:10,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:10,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:10,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:10,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:10,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:10,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:10,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:10,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 16:07:10,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:10,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:10,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:10,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:10,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:10,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:10,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:10,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:10,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:10,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:10,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:10,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:10,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:10,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:10,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:10,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 16:07:10,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:10,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 1003 trivial. 0 not checked. [2024-11-09 16:07:10,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 16:07:10,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046967568] [2024-11-09 16:07:10,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046967568] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 16:07:10,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858854002] [2024-11-09 16:07:10,274 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-09 16:07:10,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 16:07:10,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:10,276 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-09 16:07:10,277 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-09 16:07:10,755 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2024-11-09 16:07:10,756 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 16:07:10,759 INFO L255 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-09 16:07:10,763 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:07:10,767 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-09 16:07:10,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1011 trivial. 0 not checked. [2024-11-09 16:07:10,965 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 16:07:11,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 993 trivial. 0 not checked. [2024-11-09 16:07:11,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858854002] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 16:07:11,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 16:07:11,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 18] total 34 [2024-11-09 16:07:11,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227005547] [2024-11-09 16:07:11,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 16:07:11,775 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 16:07:11,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 16:07:11,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-09 16:07:11,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=914, Unknown=0, NotChecked=0, Total=1122 [2024-11-09 16:07:11,776 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. cyclomatic complexity: 7 Second operand has 34 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 27 states have internal predecessors, (41), 15 states have call successors, (18), 9 states have call predecessors, (18), 10 states have return successors, (18), 14 states have call predecessors, (18), 14 states have call successors, (18) [2024-11-09 16:07:12,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 16:07:12,030 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2024-11-09 16:07:12,030 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 46 transitions. [2024-11-09 16:07:12,031 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-11-09 16:07:12,032 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 46 transitions. [2024-11-09 16:07:12,032 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-11-09 16:07:12,032 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-11-09 16:07:12,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 46 transitions. [2024-11-09 16:07:12,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 16:07:12,032 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 46 transitions. [2024-11-09 16:07:12,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 46 transitions. [2024-11-09 16:07:12,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-09 16:07:12,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 25 states have internal predecessors, (25), 6 states have call successors, (6), 3 states have call predecessors, (6), 13 states have return successors, (15), 13 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-09 16:07:12,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2024-11-09 16:07:12,036 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 46 transitions. [2024-11-09 16:07:12,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 16:07:12,036 INFO L425 stractBuchiCegarLoop]: Abstraction has 42 states and 46 transitions. [2024-11-09 16:07:12,037 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-09 16:07:12,037 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 46 transitions. [2024-11-09 16:07:12,037 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-11-09 16:07:12,037 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:07:12,037 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:07:12,040 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-09 16:07:12,041 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [35, 35, 30, 30, 30, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 16:07:12,041 INFO L745 eck$LassoCheckResult]: Stem: 4748#$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); 4743#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#2(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#3(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#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 4727#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);< 4728#$Ultimate##0 [2024-11-09 16:07:12,042 INFO L747 eck$LassoCheckResult]: Loop: 4728#$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#2(~a.base, ~a.offset, 4); 4747#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~b.base, ~b.offset, 4); 4730#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 4740#$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#3(~b.base, ~b.offset, 4); 4737#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 4735#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4733#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4736#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; 4734#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4733#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4736#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; 4734#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4733#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4736#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; 4734#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4733#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4736#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; 4734#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4733#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4736#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; 4734#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4733#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4736#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; 4734#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4733#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4736#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 4745#L25-1 assume true; 4741#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4742#L25-1 assume true; 4744#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4767#L25-1 assume true; 4766#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4765#L25-1 assume true; 4764#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4763#L25-1 assume true; 4762#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4761#L25-1 assume true; 4759#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4757#L25-1 assume true; 4756#func_to_recursive_line_23_to_23_0EXIT >#64#return; 4739#L47-1 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 4731#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 4740#$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#3(~b.base, ~b.offset, 4); 4737#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 4735#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4733#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4736#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; 4734#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4733#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4736#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; 4734#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4733#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4736#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; 4734#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4733#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4736#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; 4734#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4733#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4736#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; 4734#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4733#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4736#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; 4734#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4733#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4736#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 4745#L25-1 assume true; 4741#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4742#L25-1 assume true; 4744#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4767#L25-1 assume true; 4766#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4765#L25-1 assume true; 4764#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4763#L25-1 assume true; 4762#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4761#L25-1 assume true; 4759#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4757#L25-1 assume true; 4756#func_to_recursive_line_23_to_23_0EXIT >#64#return; 4739#L47-1 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 4731#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 4740#$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#3(~b.base, ~b.offset, 4); 4737#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 4735#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4733#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4736#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; 4734#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4733#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4736#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; 4734#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4733#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4736#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; 4734#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4733#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4736#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; 4734#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4733#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4736#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; 4734#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4733#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4736#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; 4734#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4733#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4736#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 4745#L25-1 assume true; 4741#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4742#L25-1 assume true; 4744#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4767#L25-1 assume true; 4766#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4765#L25-1 assume true; 4764#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4763#L25-1 assume true; 4762#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4761#L25-1 assume true; 4759#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4757#L25-1 assume true; 4756#func_to_recursive_line_23_to_23_0EXIT >#64#return; 4739#L47-1 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 4731#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 4740#$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#3(~b.base, ~b.offset, 4); 4737#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 4735#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4733#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4736#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; 4734#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4733#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4736#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; 4734#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4733#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4736#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; 4734#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4733#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4736#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; 4734#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4733#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4736#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; 4734#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4733#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4736#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; 4734#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4733#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4736#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 4745#L25-1 assume true; 4741#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4742#L25-1 assume true; 4744#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4767#L25-1 assume true; 4766#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4765#L25-1 assume true; 4764#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4763#L25-1 assume true; 4762#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4761#L25-1 assume true; 4759#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4757#L25-1 assume true; 4756#func_to_recursive_line_23_to_23_0EXIT >#64#return; 4739#L47-1 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 4731#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 4740#$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#3(~b.base, ~b.offset, 4); 4737#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 4735#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4733#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4736#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; 4734#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4733#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4736#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; 4734#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4733#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4736#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; 4734#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4733#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4736#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; 4734#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4733#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4736#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; 4734#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4733#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4736#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; 4734#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 4733#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 4736#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 4745#L25-1 assume true; 4741#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4742#L25-1 assume true; 4744#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4767#L25-1 assume true; 4766#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4765#L25-1 assume true; 4764#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4763#L25-1 assume true; 4762#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4761#L25-1 assume true; 4759#func_to_recursive_line_23_to_23_0EXIT >#62#return; 4757#L25-1 assume true; 4756#func_to_recursive_line_23_to_23_0EXIT >#64#return; 4739#L47-1 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 4731#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 4740#$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#3(~b.base, ~b.offset, 4); 4737#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 4738#L41-1 assume true; 4746#func_to_recursive_line_22_to_23_0EXIT >#66#return; 4729#L41-1 assume true; 4732#func_to_recursive_line_22_to_23_0EXIT >#66#return; 4760#L41-1 assume true; 4758#func_to_recursive_line_22_to_23_0EXIT >#66#return; 4755#L41-1 assume true; 4754#func_to_recursive_line_22_to_23_0EXIT >#66#return; 4753#L41-1 assume true; 4752#func_to_recursive_line_22_to_23_0EXIT >#66#return; 4751#L41-1 assume true; 4750#func_to_recursive_line_22_to_23_0EXIT >#70#return; 4749#L67-1 call #t~mem11 := read~int#2(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12; 4726#L72 call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);< 4728#$Ultimate##0 [2024-11-09 16:07:12,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:12,043 INFO L85 PathProgramCache]: Analyzing trace with hash 49760, now seen corresponding path program 8 times [2024-11-09 16:07:12,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:12,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860163860] [2024-11-09 16:07:12,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:12,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:12,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:12,048 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:07:12,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:12,052 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:07:12,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:12,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1937132614, now seen corresponding path program 6 times [2024-11-09 16:07:12,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:12,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443811615] [2024-11-09 16:07:12,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:12,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:12,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:13,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:13,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:13,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:13,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:13,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:13,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:13,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:13,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:13,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:13,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:13,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:13,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:13,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:13,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:13,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:13,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:13,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 16:07:13,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:14,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:14,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:14,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:14,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:14,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:14,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:14,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:14,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:14,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:14,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:14,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:14,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:14,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:14,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:14,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 16:07:14,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:15,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:15,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:15,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:15,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:15,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:15,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:15,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:15,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:15,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:15,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:15,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:15,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:15,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:15,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:15,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 16:07:15,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:15,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:15,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:15,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:15,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:15,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:15,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:15,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:15,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:15,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:15,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:15,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:15,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:15,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:15,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:15,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 16:07:15,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:15,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:15,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:15,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:15,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:15,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:15,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:15,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:15,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:15,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:15,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:15,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:15,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:15,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 16:07:15,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:15,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 16:07:15,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:15,439 INFO L134 CoverageAnalysis]: Checked inductivity of 2905 backedges. 16 proven. 35 refuted. 0 times theorem prover too weak. 2854 trivial. 0 not checked. [2024-11-09 16:07:15,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 16:07:15,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443811615] [2024-11-09 16:07:15,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443811615] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 16:07:15,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041137954] [2024-11-09 16:07:15,439 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-09 16:07:15,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 16:07:15,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:15,441 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 16:07:15,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 16:07:18,361 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2024-11-09 16:07:18,362 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 16:07:18,370 INFO L255 TraceCheckSpWp]: Trace formula consists of 1133 conjuncts, 79 conjuncts are in the unsatisfiable core [2024-11-09 16:07:18,376 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:07:18,383 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-09 16:07:18,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2905 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 2870 trivial. 0 not checked. [2024-11-09 16:07:18,692 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 16:07:20,342 INFO L134 CoverageAnalysis]: Checked inductivity of 2905 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 2815 trivial. 0 not checked. [2024-11-09 16:07:20,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041137954] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 16:07:20,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 16:07:20,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 26] total 44 [2024-11-09 16:07:20,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300316104] [2024-11-09 16:07:20,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 16:07:20,343 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-09 16:07:20,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 16:07:20,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-09 16:07:20,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=1541, Unknown=0, NotChecked=0, Total=1892 [2024-11-09 16:07:20,344 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. cyclomatic complexity: 7 Second operand has 44 states, 34 states have (on average 1.5) internal successors, (51), 35 states have internal predecessors, (51), 19 states have call successors, (22), 11 states have call predecessors, (22), 14 states have return successors, (26), 20 states have call predecessors, (26), 18 states have call successors, (26) [2024-11-09 16:07:20,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 16:07:20,680 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2024-11-09 16:07:20,680 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 48 transitions. [2024-11-09 16:07:20,682 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-11-09 16:07:20,682 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 44 states and 48 transitions. [2024-11-09 16:07:20,682 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2024-11-09 16:07:20,683 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2024-11-09 16:07:20,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 48 transitions. [2024-11-09 16:07:20,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 16:07:20,683 INFO L218 hiAutomatonCegarLoop]: Abstraction has 44 states and 48 transitions. [2024-11-09 16:07:20,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 48 transitions. [2024-11-09 16:07:20,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-09 16:07:20,689 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-09 16:07:20,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2024-11-09 16:07:20,689 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 48 transitions. [2024-11-09 16:07:20,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 16:07:20,691 INFO L425 stractBuchiCegarLoop]: Abstraction has 44 states and 48 transitions. [2024-11-09 16:07:20,693 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-11-09 16:07:20,693 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 48 transitions. [2024-11-09 16:07:20,693 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-11-09 16:07:20,693 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:07:20,693 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:07:20,695 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-09 16:07:20,695 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-09 16:07:20,695 INFO L745 eck$LassoCheckResult]: Stem: 7478#$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); 7474#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#2(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#3(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#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 7458#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);< 7459#$Ultimate##0 [2024-11-09 16:07:20,699 INFO L747 eck$LassoCheckResult]: Loop: 7459#$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#2(~a.base, ~a.offset, 4); 7477#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~b.base, ~b.offset, 4); 7461#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 7471#$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#3(~b.base, ~b.offset, 4); 7469#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 7465#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7464#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7467#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; 7466#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7464#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7467#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; 7466#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7464#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7467#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; 7466#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7464#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7467#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; 7466#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7464#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7467#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; 7466#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7464#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7467#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; 7466#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7464#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7467#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7475#L25-1 assume true; 7472#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7473#L25-1 assume true; 7500#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7499#L25-1 assume true; 7498#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7497#L25-1 assume true; 7495#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7493#L25-1 assume true; 7491#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7490#L25-1 assume true; 7488#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7486#L25-1 assume true; 7485#func_to_recursive_line_23_to_23_0EXIT >#64#return; 7468#L47-1 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 7462#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 7471#$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#3(~b.base, ~b.offset, 4); 7469#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 7465#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7464#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7467#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; 7466#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7464#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7467#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; 7466#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7464#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7467#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; 7466#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7464#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7467#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; 7466#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7464#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7467#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; 7466#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7464#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7467#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; 7466#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7464#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7467#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7475#L25-1 assume true; 7472#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7473#L25-1 assume true; 7500#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7499#L25-1 assume true; 7498#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7497#L25-1 assume true; 7495#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7493#L25-1 assume true; 7491#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7490#L25-1 assume true; 7488#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7486#L25-1 assume true; 7485#func_to_recursive_line_23_to_23_0EXIT >#64#return; 7468#L47-1 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 7462#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 7471#$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#3(~b.base, ~b.offset, 4); 7469#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 7465#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7464#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7467#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; 7466#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7464#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7467#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; 7466#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7464#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7467#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; 7466#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7464#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7467#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; 7466#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7464#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7467#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; 7466#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7464#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7467#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; 7466#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7464#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7467#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7475#L25-1 assume true; 7472#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7473#L25-1 assume true; 7500#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7499#L25-1 assume true; 7498#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7497#L25-1 assume true; 7495#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7493#L25-1 assume true; 7491#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7490#L25-1 assume true; 7488#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7486#L25-1 assume true; 7485#func_to_recursive_line_23_to_23_0EXIT >#64#return; 7468#L47-1 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 7462#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 7471#$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#3(~b.base, ~b.offset, 4); 7469#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 7465#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7464#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7467#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; 7466#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7464#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7467#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; 7466#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7464#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7467#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; 7466#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7464#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7467#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; 7466#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7464#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7467#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; 7466#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7464#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7467#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; 7466#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7464#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7467#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7475#L25-1 assume true; 7472#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7473#L25-1 assume true; 7500#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7499#L25-1 assume true; 7498#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7497#L25-1 assume true; 7495#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7493#L25-1 assume true; 7491#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7490#L25-1 assume true; 7488#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7486#L25-1 assume true; 7485#func_to_recursive_line_23_to_23_0EXIT >#64#return; 7468#L47-1 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 7462#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 7471#$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#3(~b.base, ~b.offset, 4); 7469#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 7465#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7464#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7467#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; 7466#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7464#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7467#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; 7466#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7464#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7467#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; 7466#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7464#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7467#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; 7466#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7464#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7467#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; 7466#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7464#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7467#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; 7466#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7464#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7467#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7475#L25-1 assume true; 7472#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7473#L25-1 assume true; 7500#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7499#L25-1 assume true; 7498#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7497#L25-1 assume true; 7495#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7493#L25-1 assume true; 7491#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7490#L25-1 assume true; 7488#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7486#L25-1 assume true; 7485#func_to_recursive_line_23_to_23_0EXIT >#64#return; 7468#L47-1 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 7462#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 7471#$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#3(~b.base, ~b.offset, 4); 7469#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 7465#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7464#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7467#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; 7466#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7464#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7467#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; 7466#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7464#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7467#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; 7466#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7464#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7467#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; 7466#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7464#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7467#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; 7466#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7464#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7467#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; 7466#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7464#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 7467#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 7475#L25-1 assume true; 7472#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7473#L25-1 assume true; 7500#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7499#L25-1 assume true; 7498#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7497#L25-1 assume true; 7495#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7493#L25-1 assume true; 7491#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7490#L25-1 assume true; 7488#func_to_recursive_line_23_to_23_0EXIT >#62#return; 7486#L25-1 assume true; 7485#func_to_recursive_line_23_to_23_0EXIT >#64#return; 7468#L47-1 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 7462#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 7471#$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#3(~b.base, ~b.offset, 4); 7469#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 7470#L41-1 assume true; 7476#func_to_recursive_line_22_to_23_0EXIT >#66#return; 7460#L41-1 assume true; 7463#func_to_recursive_line_22_to_23_0EXIT >#66#return; 7496#L41-1 assume true; 7494#func_to_recursive_line_22_to_23_0EXIT >#66#return; 7492#L41-1 assume true; 7489#func_to_recursive_line_22_to_23_0EXIT >#66#return; 7487#L41-1 assume true; 7484#func_to_recursive_line_22_to_23_0EXIT >#66#return; 7483#L41-1 assume true; 7482#func_to_recursive_line_22_to_23_0EXIT >#66#return; 7481#L41-1 assume true; 7480#func_to_recursive_line_22_to_23_0EXIT >#70#return; 7479#L67-1 call #t~mem11 := read~int#2(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12; 7457#L72 call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);< 7459#$Ultimate##0 [2024-11-09 16:07:20,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:20,700 INFO L85 PathProgramCache]: Analyzing trace with hash 49760, now seen corresponding path program 9 times [2024-11-09 16:07:20,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:20,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608684411] [2024-11-09 16:07:20,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:20,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:20,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:20,708 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:07:20,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:20,712 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:07:20,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:20,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1363312666, now seen corresponding path program 7 times [2024-11-09 16:07:20,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:20,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053918891] [2024-11-09 16:07:20,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:20,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:20,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:20,780 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:07:20,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:20,869 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:07:20,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:20,872 INFO L85 PathProgramCache]: Analyzing trace with hash -993962585, now seen corresponding path program 1 times [2024-11-09 16:07:20,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:20,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262497201] [2024-11-09 16:07:20,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:20,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:20,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:20,935 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:07:20,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:21,004 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:07:28,876 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 16:07:28,876 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 16:07:28,876 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 16:07:28,876 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 16:07:28,876 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 16:07:28,876 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:28,876 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 16:07:28,876 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 16:07:28,876 INFO L132 ssoRankerPreferences]: Filename of dumped script: recursified_nested_3.c_Iteration9_Lasso [2024-11-09 16:07:28,876 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 16:07:28,876 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 16:07:28,887 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:28,896 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:28,897 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:28,899 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:28,900 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:28,901 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:28,902 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:28,904 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:28,905 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:28,906 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:28,908 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:28,909 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:29,417 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:29,419 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:29,424 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:29,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:29,434 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:29,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:29,437 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:29,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:29,439 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:29,741 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 16:07:29,744 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 16:07:29,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:29,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:29,747 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-09 16:07:29,747 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-09 16:07:29,751 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 16:07:29,762 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:29,762 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:29,763 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:29,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:29,763 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:29,764 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:29,764 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:29,766 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:29,777 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-09 16:07:29,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:29,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:29,778 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-09 16:07:29,779 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-09 16:07:29,779 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:29,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:29,790 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:29,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:29,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:29,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:29,791 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:29,791 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:29,792 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:29,804 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-09 16:07:29,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:29,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:29,806 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-09 16:07:29,808 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-09 16:07:29,809 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:29,819 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:29,819 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:29,820 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:29,820 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:29,820 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:29,820 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:29,820 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:29,821 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:29,838 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-09 16:07:29,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:29,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:29,840 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-09 16:07:29,841 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-09 16:07:29,842 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 16:07:29,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:29,852 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:29,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:29,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:29,852 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:29,852 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:29,852 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:29,853 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:29,864 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-09 16:07:29,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:29,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:29,865 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-09 16:07:29,866 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-09 16:07:29,867 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 16:07:29,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:29,876 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:29,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:29,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:29,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:29,877 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:29,877 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:29,878 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:29,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-11-09 16:07:29,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:29,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:29,890 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-09 16:07:29,891 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-09 16:07:29,892 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 16:07:29,901 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:29,902 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:29,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:29,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:29,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:29,902 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:29,902 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:29,903 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:29,914 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-09 16:07:29,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:29,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:29,916 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-09 16:07:29,917 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-09 16:07:29,919 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:29,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:29,929 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:29,929 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:29,929 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:29,929 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:29,929 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:29,929 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:29,930 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:29,941 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-09 16:07:29,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:29,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:29,944 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-09 16:07:29,945 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-09 16:07:29,946 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 16:07:29,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:29,956 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:29,956 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:29,956 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:29,956 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:29,957 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:29,957 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:29,959 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:29,969 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-09 16:07:29,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:29,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:29,970 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-09 16:07:29,971 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-09 16:07:29,972 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 16:07:29,981 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:29,982 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:29,982 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:29,982 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:29,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:29,983 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:29,983 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:29,984 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:29,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-11-09 16:07:29,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:29,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:29,995 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-09 16:07:29,996 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-09 16:07:29,997 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 16:07:30,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:30,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:30,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:30,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:30,009 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 16:07:30,009 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 16:07:30,012 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:30,023 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-09 16:07:30,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:30,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:30,024 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-09 16:07:30,025 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-09 16:07:30,027 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 16:07:30,037 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:30,037 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:30,037 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:30,037 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:30,043 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 16:07:30,044 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 16:07:30,049 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 16:07:30,059 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-11-09 16:07:30,059 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2024-11-09 16:07:30,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:30,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:30,063 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-09 16:07:30,064 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-09 16:07:30,066 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 16:07:30,077 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 16:07:30,077 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 16:07:30,078 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#2 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#2 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-09 16:07:30,089 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-09 16:07:30,138 INFO L156 tatePredicateManager]: 18 out of 18 supporting invariants were superfluous and have been removed [2024-11-09 16:07:30,143 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-11-09 16:07:30,144 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-11-09 16:07:30,144 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#in~a!base,]]] [2024-11-09 16:07:30,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:30,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:30,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 16:07:30,172 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:07:30,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:30,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 2940 conjuncts, 117 conjuncts are in the unsatisfiable core [2024-11-09 16:07:30,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:07:31,378 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-09 16:07:31,393 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-09 16:07:31,396 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-09 16:07:31,397 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-09 16:07:31,520 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-09 16:07:31,521 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-09 16:07:31,521 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-09 16:07:31,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2024-11-09 16:07:31,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 3 letters. Loop has 255 letters. [2024-11-09 16:07:31,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 16:07:31,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 258 letters. Loop has 255 letters. [2024-11-09 16:07:31,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 16:07:31,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 3 letters. Loop has 510 letters. [2024-11-09 16:07:31,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 16:07:31,530 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 131 states and 145 transitions. [2024-11-09 16:07:31,532 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-11-09 16:07:31,533 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 131 states to 87 states and 99 transitions. [2024-11-09 16:07:31,533 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2024-11-09 16:07:31,535 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2024-11-09 16:07:31,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 99 transitions. [2024-11-09 16:07:31,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 16:07:31,536 INFO L218 hiAutomatonCegarLoop]: Abstraction has 87 states and 99 transitions. [2024-11-09 16:07:31,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 99 transitions. [2024-11-09 16:07:31,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 74. [2024-11-09 16:07:31,541 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-09 16:07:31,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2024-11-09 16:07:31,541 INFO L240 hiAutomatonCegarLoop]: Abstraction has 74 states and 83 transitions. [2024-11-09 16:07:31,541 INFO L425 stractBuchiCegarLoop]: Abstraction has 74 states and 83 transitions. [2024-11-09 16:07:31,542 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-11-09 16:07:31,542 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 83 transitions. [2024-11-09 16:07:31,542 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-11-09 16:07:31,542 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:07:31,542 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:07:31,543 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-09 16:07:31,545 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 16:07:31,545 INFO L745 eck$LassoCheckResult]: Stem: 8558#$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); 8547#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#2(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#3(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#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 8522#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);< 8524#$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#2(~a.base, ~a.offset, 4); 8557#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~b.base, ~b.offset, 4); 8540#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 8545#$Ultimate##0 [2024-11-09 16:07:31,545 INFO L747 eck$LassoCheckResult]: Loop: 8545#$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#3(~b.base, ~b.offset, 4); 8543#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 8531#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 8529#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 8532#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; 8530#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 8529#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 8532#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; 8530#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 8529#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 8532#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; 8530#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 8529#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 8532#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; 8530#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 8529#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 8532#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; 8530#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 8529#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 8532#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; 8530#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 8529#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 8532#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8554#L25-1 assume true; 8548#func_to_recursive_line_23_to_23_0EXIT >#62#return; 8549#L25-1 assume true; 8552#func_to_recursive_line_23_to_23_0EXIT >#62#return; 8594#L25-1 assume true; 8593#func_to_recursive_line_23_to_23_0EXIT >#62#return; 8592#L25-1 assume true; 8591#func_to_recursive_line_23_to_23_0EXIT >#62#return; 8590#L25-1 assume true; 8589#func_to_recursive_line_23_to_23_0EXIT >#62#return; 8588#L25-1 assume true; 8587#func_to_recursive_line_23_to_23_0EXIT >#62#return; 8586#L25-1 assume true; 8585#func_to_recursive_line_23_to_23_0EXIT >#64#return; 8538#L47-1 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 8539#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 8545#$Ultimate##0 [2024-11-09 16:07:31,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:31,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1482449922, now seen corresponding path program 1 times [2024-11-09 16:07:31,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:31,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373263714] [2024-11-09 16:07:31,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:31,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:31,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:31,560 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:07:31,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:31,570 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:07:31,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:31,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1388529776, now seen corresponding path program 1 times [2024-11-09 16:07:31,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:31,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950702318] [2024-11-09 16:07:31,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:31,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:31,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:31,581 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:07:31,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:31,594 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:07:31,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:31,594 INFO L85 PathProgramCache]: Analyzing trace with hash -292174737, now seen corresponding path program 1 times [2024-11-09 16:07:31,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:31,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665789433] [2024-11-09 16:07:31,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:31,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:31,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:31,609 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:07:31,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:31,630 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:07:32,802 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-09 16:07:33,960 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 16:07:33,961 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 16:07:33,961 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 16:07:33,961 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 16:07:33,961 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 16:07:33,961 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:33,961 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 16:07:33,961 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 16:07:33,961 INFO L132 ssoRankerPreferences]: Filename of dumped script: recursified_nested_3.c_Iteration10_Lasso [2024-11-09 16:07:33,961 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 16:07:33,961 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 16:07:33,962 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:33,964 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:33,965 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:33,967 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:33,968 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:33,970 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:33,971 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:33,972 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:33,974 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:33,975 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:33,976 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:33,978 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:33,979 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:33,981 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:33,982 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:34,293 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:34,295 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:34,296 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:34,301 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:34,302 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:34,303 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:34,305 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:34,307 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:34,308 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:34,309 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:34,310 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:34,311 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:34,312 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:34,314 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:34,315 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:34,316 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:34,584 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 16:07:34,584 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 16:07:34,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:34,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:34,585 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-09 16:07:34,587 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-09 16:07:34,588 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:34,598 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:34,598 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:34,599 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:34,599 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:34,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:34,599 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:34,599 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:34,600 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:34,610 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-09 16:07:34,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:34,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:34,611 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-09 16:07:34,611 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-09 16:07:34,612 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:34,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:34,621 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:34,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:34,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:34,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:34,622 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:34,622 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:34,623 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:34,633 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-09 16:07:34,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:34,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:34,634 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-09 16:07:34,635 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-09 16:07:34,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-09 16:07:34,645 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:34,645 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:34,645 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:34,645 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:34,645 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:34,646 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:34,646 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:34,646 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:34,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2024-11-09 16:07:34,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:34,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:34,658 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-09 16:07:34,658 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-09 16:07:34,659 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:34,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:34,668 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:34,668 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:34,668 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:34,668 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:34,669 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:34,669 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:34,670 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:34,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2024-11-09 16:07:34,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:34,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:34,681 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-09 16:07:34,682 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-09 16:07:34,683 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 16:07:34,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:34,692 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:34,692 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:34,692 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:34,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:34,693 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:34,693 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:34,694 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:34,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-11-09 16:07:34,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:34,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:34,705 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-09 16:07:34,705 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-09 16:07:34,706 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 16:07:34,715 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:34,715 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:34,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:34,716 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:34,716 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:34,716 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:34,716 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:34,717 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:34,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-11-09 16:07:34,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:34,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:34,728 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-09 16:07:34,729 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-09 16:07:34,730 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:34,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:34,740 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:34,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:34,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:34,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:34,740 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:34,740 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:34,741 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:34,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2024-11-09 16:07:34,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:34,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:34,753 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-09 16:07:34,754 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-09 16:07:34,754 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:34,764 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:34,764 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:34,764 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:34,764 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:34,764 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:34,765 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:34,765 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:34,765 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:34,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2024-11-09 16:07:34,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:34,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:34,777 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-09 16:07:34,778 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-09 16:07:34,779 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:34,788 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:34,789 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:34,789 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:34,789 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:34,789 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:34,789 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:34,789 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:34,790 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:34,800 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-09 16:07:34,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:34,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:34,801 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-09 16:07:34,802 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-09 16:07:34,803 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:34,812 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:34,812 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:34,812 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:34,813 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:34,813 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:34,813 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:34,813 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:34,817 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:34,827 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-09 16:07:34,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:34,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:34,828 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-09 16:07:34,830 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-09 16:07:34,830 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:34,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:34,840 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:34,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:34,840 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:34,840 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:34,840 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:34,840 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:34,841 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:34,851 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-09 16:07:34,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:34,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:34,853 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-09 16:07:34,854 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-09 16:07:34,854 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 16:07:34,864 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:34,864 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:34,864 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:34,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:34,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:34,864 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:34,864 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:34,865 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:34,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2024-11-09 16:07:34,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:34,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:34,876 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-09 16:07:34,877 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-09 16:07:34,877 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:34,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:34,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:34,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:34,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:34,889 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 16:07:34,889 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 16:07:34,891 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:34,901 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-09 16:07:34,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:34,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:34,902 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-09 16:07:34,903 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-09 16:07:34,903 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 16:07:34,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:34,913 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:34,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:34,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:34,914 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 16:07:34,914 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 16:07:34,917 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:34,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2024-11-09 16:07:34,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:34,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:34,928 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-09 16:07:34,928 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-09 16:07:34,929 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:34,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:34,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:34,939 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:34,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:34,940 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 16:07:34,940 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 16:07:34,942 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:34,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2024-11-09 16:07:34,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:34,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:34,954 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-09 16:07:34,954 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-09 16:07:34,955 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:34,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:34,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:34,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:34,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:34,968 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 16:07:34,968 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 16:07:34,973 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:34,983 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-09 16:07:34,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:34,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:34,984 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-09 16:07:34,985 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-09 16:07:34,985 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:34,995 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:34,995 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:34,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:34,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:34,997 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 16:07:34,997 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 16:07:34,999 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:35,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2024-11-09 16:07:35,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:35,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:35,010 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-09 16:07:35,011 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-09 16:07:35,012 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:35,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:35,021 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:35,021 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:35,021 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:35,022 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 16:07:35,023 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 16:07:35,025 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:35,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2024-11-09 16:07:35,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:35,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:35,036 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 16:07:35,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2024-11-09 16:07:35,038 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 16:07:35,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:35,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:35,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:35,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:35,051 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 16:07:35,051 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 16:07:35,056 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:35,066 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-09 16:07:35,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:35,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:35,067 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-09 16:07:35,068 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-09 16:07:35,068 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:35,078 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:35,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:35,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:35,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:35,079 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 16:07:35,079 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 16:07:35,082 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:35,091 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-09 16:07:35,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:35,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:35,093 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-09 16:07:35,093 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-09 16:07:35,094 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:35,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:35,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:35,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:35,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:35,106 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 16:07:35,106 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 16:07:35,109 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:35,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2024-11-09 16:07:35,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:35,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:35,120 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-09 16:07:35,121 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-09 16:07:35,122 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 16:07:35,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:35,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:35,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:35,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:35,135 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 16:07:35,135 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 16:07:35,142 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 16:07:35,159 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2024-11-09 16:07:35,159 INFO L444 ModelExtractionUtils]: 3 out of 16 variables were initially zero. Simplification set additionally 6 variables to zero. [2024-11-09 16:07:35,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:35,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:35,161 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-09 16:07:35,162 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-09 16:07:35,162 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 16:07:35,173 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2024-11-09 16:07:35,173 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 16:07:35,174 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select old(#memory_int#3) func_to_recursive_line_22_to_23_0_#in~b.base) 0)_1) = -2*v_rep(select (select old(#memory_int#3) func_to_recursive_line_22_to_23_0_#in~b.base) 0)_1 + 11 Supporting invariants [1*v_rep(select (select #memory_int#3 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#3) func_to_recursive_line_22_to_23_0_#in~b.base) func_to_recursive_line_22_to_23_0_#in~b.offset)_1 >= 0, -1*v_rep(select (select old(#memory_int#3) 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#3 func_to_recursive_line_22_to_23_0_#in~b.base) 0)_1 >= 0] [2024-11-09 16:07:35,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2024-11-09 16:07:35,211 INFO L156 tatePredicateManager]: 12 out of 14 supporting invariants were superfluous and have been removed [2024-11-09 16:07:35,215 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-09 16:07:35,215 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]] [2024-11-09 16:07:35,215 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]],[IdentifierExpression[#in~b!base,]]] [2024-11-09 16:07:35,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:35,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:35,249 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 16:07:35,249 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:07:35,285 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-09 16:07:35,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:35,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-09 16:07:35,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:07:35,357 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-09 16:07:35,531 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-09 16:07:35,551 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-09 16:07:35,552 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.5 stem predicates 5 loop predicates [2024-11-09 16:07:35,552 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 83 transitions. cyclomatic complexity: 14 Second operand has 10 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 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-09 16:07:35,739 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 83 transitions. cyclomatic complexity: 14. Second operand has 10 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 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 26 states. [2024-11-09 16:07:35,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 5 stem states 5 non-accepting loop states 1 accepting loop states [2024-11-09 16:07:35,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 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-09 16:07:35,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 20 transitions. [2024-11-09 16:07:35,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 20 transitions. Stem has 6 letters. Loop has 39 letters. [2024-11-09 16:07:35,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 16:07:35,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 20 transitions. Stem has 45 letters. Loop has 39 letters. [2024-11-09 16:07:35,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 16:07:35,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 20 transitions. Stem has 6 letters. Loop has 78 letters. [2024-11-09 16:07:35,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 16:07:35,741 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 254 states and 287 transitions. [2024-11-09 16:07:35,743 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2024-11-09 16:07:35,745 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 254 states to 155 states and 182 transitions. [2024-11-09 16:07:35,745 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2024-11-09 16:07:35,745 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2024-11-09 16:07:35,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 155 states and 182 transitions. [2024-11-09 16:07:35,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 16:07:35,745 INFO L218 hiAutomatonCegarLoop]: Abstraction has 155 states and 182 transitions. [2024-11-09 16:07:35,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states and 182 transitions. [2024-11-09 16:07:35,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 142. [2024-11-09 16:07:35,751 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-09 16:07:35,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 166 transitions. [2024-11-09 16:07:35,754 INFO L240 hiAutomatonCegarLoop]: Abstraction has 142 states and 166 transitions. [2024-11-09 16:07:35,755 INFO L425 stractBuchiCegarLoop]: Abstraction has 142 states and 166 transitions. [2024-11-09 16:07:35,755 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-11-09 16:07:35,755 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 142 states and 166 transitions. [2024-11-09 16:07:35,755 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2024-11-09 16:07:35,755 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:07:35,755 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:07:35,756 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 16:07:35,756 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-09 16:07:35,756 INFO L745 eck$LassoCheckResult]: Stem: 9153#$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); 9140#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#2(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#3(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#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 9107#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);< 9109#$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#2(~a.base, ~a.offset, 4); 9150#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~b.base, ~b.offset, 4); 9128#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 9143#$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#3(~b.base, ~b.offset, 4); 9126#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 9115#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9114#$Ultimate##0 [2024-11-09 16:07:35,756 INFO L747 eck$LassoCheckResult]: Loop: 9114#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 9116#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; 9117#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9114#$Ultimate##0 [2024-11-09 16:07:35,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:35,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1483069382, now seen corresponding path program 1 times [2024-11-09 16:07:35,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:35,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296774521] [2024-11-09 16:07:35,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:35,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:35,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:35,765 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:07:35,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:35,775 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:07:35,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:35,776 INFO L85 PathProgramCache]: Analyzing trace with hash 29945, now seen corresponding path program 1 times [2024-11-09 16:07:35,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:35,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81844311] [2024-11-09 16:07:35,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:35,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:35,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:35,780 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:07:35,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:35,783 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:07:35,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:35,783 INFO L85 PathProgramCache]: Analyzing trace with hash 208614944, now seen corresponding path program 1 times [2024-11-09 16:07:35,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:35,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716180980] [2024-11-09 16:07:35,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:35,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:35,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:35,791 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:07:35,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:35,797 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:07:36,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2024-11-09 16:07:37,213 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 16:07:37,214 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 16:07:37,214 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 16:07:37,214 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 16:07:37,214 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 16:07:37,214 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:37,214 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 16:07:37,214 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 16:07:37,214 INFO L132 ssoRankerPreferences]: Filename of dumped script: recursified_nested_3.c_Iteration11_Lasso [2024-11-09 16:07:37,214 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 16:07:37,214 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 16:07:37,216 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:37,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:37,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:37,220 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:37,221 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:37,222 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:37,223 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:37,224 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:37,225 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:37,226 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:37,228 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:37,229 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:37,232 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:37,457 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:37,458 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:37,459 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:37,460 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:37,462 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:37,463 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:37,464 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:37,465 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:37,466 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:37,467 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:37,468 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:37,469 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:37,476 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:37,477 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:37,478 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:37,481 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:37,482 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:37,483 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:37,484 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:37,485 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:37,486 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:37,488 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:37,489 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:37,490 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:37,491 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:37,493 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:37,702 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 16:07:37,702 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 16:07:37,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:37,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:37,705 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-09 16:07:37,706 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-09 16:07:37,707 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:37,717 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:37,717 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:37,717 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:37,717 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:37,717 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:37,718 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:37,718 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:37,719 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:37,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2024-11-09 16:07:37,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:37,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:37,730 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-09 16:07:37,730 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-09 16:07:37,732 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:37,742 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:37,742 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:37,742 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:37,742 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:37,742 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:37,743 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:37,743 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:37,744 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:37,754 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-09 16:07:37,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:37,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:37,755 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-09 16:07:37,756 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-09 16:07:37,756 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 16:07:37,765 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:37,766 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:37,766 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:37,766 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:37,766 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:37,766 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:37,766 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:37,767 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:37,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2024-11-09 16:07:37,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:37,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:37,778 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-09 16:07:37,779 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-09 16:07:37,779 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:37,789 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:37,789 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:37,789 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:37,789 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:37,789 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:37,789 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:37,789 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:37,790 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:37,799 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-09 16:07:37,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:37,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:37,801 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-09 16:07:37,802 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-09 16:07:37,802 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:37,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:37,812 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:37,812 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:37,812 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:37,812 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:37,812 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:37,812 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:37,813 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:37,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2024-11-09 16:07:37,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:37,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:37,824 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-09 16:07:37,825 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-09 16:07:37,825 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:37,834 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:37,835 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:37,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:37,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:37,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:37,835 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:37,835 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:37,836 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:37,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2024-11-09 16:07:37,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:37,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:37,846 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-09 16:07:37,847 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-09 16:07:37,848 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:37,857 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:37,858 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:37,858 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:37,858 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:37,858 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:37,859 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:37,859 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:37,859 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:37,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2024-11-09 16:07:37,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:37,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:37,870 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-09 16:07:37,871 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-09 16:07:37,871 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 16:07:37,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:37,881 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:37,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:37,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:37,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:37,881 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:37,881 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:37,882 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:37,892 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-09 16:07:37,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:37,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:37,893 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-09 16:07:37,893 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-09 16:07:37,894 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 16:07:37,903 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:37,903 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:37,903 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:37,903 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:37,903 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:37,903 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:37,904 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:37,904 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:37,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2024-11-09 16:07:37,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:37,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:37,915 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-09 16:07:37,915 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-09 16:07:37,916 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:37,925 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:37,925 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:37,925 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:37,925 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:37,925 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:37,926 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:37,926 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:37,927 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:37,936 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-09 16:07:37,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:37,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:37,937 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-09 16:07:37,938 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-09 16:07:37,938 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:37,948 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:37,948 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:37,948 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:37,949 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:37,949 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:37,949 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:37,949 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:37,950 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:37,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2024-11-09 16:07:37,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:37,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:37,961 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-09 16:07:37,962 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-09 16:07:37,962 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:37,972 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:37,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:37,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:37,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:37,973 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 16:07:37,973 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 16:07:37,975 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:37,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2024-11-09 16:07:37,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:37,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:37,985 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-09 16:07:37,986 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-09 16:07:37,986 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 16:07:37,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:37,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:37,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:37,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:38,000 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 16:07:38,000 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 16:07:38,006 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 16:07:38,025 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2024-11-09 16:07:38,025 INFO L444 ModelExtractionUtils]: 3 out of 16 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-11-09 16:07:38,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:38,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:38,026 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-09 16:07:38,027 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-09 16:07:38,028 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 16:07:38,038 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 16:07:38,038 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 16:07:38,038 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)_1) = -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)_1 + 11 Supporting invariants [] [2024-11-09 16:07:38,049 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-09 16:07:38,059 INFO L156 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2024-11-09 16:07:38,060 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-09 16:07:38,060 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-09 16:07:38,060 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~c!base,]]] [2024-11-09 16:07:38,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:38,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:38,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 16:07:38,096 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:07:38,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:38,113 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 16:07:38,114 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:07:38,128 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-09 16:07:38,139 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-09 16:07:38,139 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-11-09 16:07:38,139 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 142 states and 166 transitions. cyclomatic complexity: 34 Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 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-09 16:07:38,180 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 142 states and 166 transitions. cyclomatic complexity: 34. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 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 15 states. [2024-11-09 16:07:38,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-11-09 16:07:38,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (4), 2 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-09 16:07:38,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2024-11-09 16:07:38,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 9 letters. Loop has 3 letters. [2024-11-09 16:07:38,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 16:07:38,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 12 letters. Loop has 3 letters. [2024-11-09 16:07:38,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 16:07:38,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 9 letters. Loop has 6 letters. [2024-11-09 16:07:38,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 16:07:38,183 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 184 states and 223 transitions. [2024-11-09 16:07:38,185 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2024-11-09 16:07:38,187 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 184 states to 162 states and 200 transitions. [2024-11-09 16:07:38,187 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2024-11-09 16:07:38,187 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2024-11-09 16:07:38,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 162 states and 200 transitions. [2024-11-09 16:07:38,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 16:07:38,188 INFO L218 hiAutomatonCegarLoop]: Abstraction has 162 states and 200 transitions. [2024-11-09 16:07:38,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states and 200 transitions. [2024-11-09 16:07:38,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2024-11-09 16:07:38,196 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-09 16:07:38,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 200 transitions. [2024-11-09 16:07:38,197 INFO L240 hiAutomatonCegarLoop]: Abstraction has 162 states and 200 transitions. [2024-11-09 16:07:38,197 INFO L425 stractBuchiCegarLoop]: Abstraction has 162 states and 200 transitions. [2024-11-09 16:07:38,197 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-11-09 16:07:38,197 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 162 states and 200 transitions. [2024-11-09 16:07:38,198 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2024-11-09 16:07:38,198 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:07:38,198 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:07:38,198 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-09 16:07:38,199 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-09 16:07:38,199 INFO L745 eck$LassoCheckResult]: Stem: 9582#$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); 9562#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#2(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#3(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#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 9528#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);< 9530#$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#2(~a.base, ~a.offset, 4); 9579#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~b.base, ~b.offset, 4); 9572#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 9571#$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#3(~b.base, ~b.offset, 4); 9573#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 9604#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9606#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 9677#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; 9611#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9643#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 9644#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; 9612#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9643#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 9644#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; 9612#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9643#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 9644#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; 9612#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9643#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 9644#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; 9612#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9643#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 9644#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; 9612#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9643#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 9638#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 9636#L25-1 assume true; 9626#func_to_recursive_line_23_to_23_0EXIT >#62#return; 9624#L25-1 assume true; 9622#func_to_recursive_line_23_to_23_0EXIT >#62#return; 9621#L25-1 assume true; 9620#func_to_recursive_line_23_to_23_0EXIT >#62#return; 9619#L25-1 assume true; 9618#func_to_recursive_line_23_to_23_0EXIT >#62#return; 9617#L25-1 assume true; 9616#func_to_recursive_line_23_to_23_0EXIT >#62#return; 9614#L25-1 assume true; 9609#func_to_recursive_line_23_to_23_0EXIT >#62#return; 9608#L25-1 assume true; 9603#func_to_recursive_line_23_to_23_0EXIT >#64#return; 9601#L47-1 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 9543#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 9598#$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#3(~b.base, ~b.offset, 4); 9542#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 9532#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9531#$Ultimate##0 [2024-11-09 16:07:38,199 INFO L747 eck$LassoCheckResult]: Loop: 9531#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 9534#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; 9533#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9531#$Ultimate##0 [2024-11-09 16:07:38,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:38,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1721128109, now seen corresponding path program 2 times [2024-11-09 16:07:38,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:38,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630765854] [2024-11-09 16:07:38,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:38,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:38,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:38,214 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:07:38,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:38,230 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:07:38,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:38,230 INFO L85 PathProgramCache]: Analyzing trace with hash 29945, now seen corresponding path program 2 times [2024-11-09 16:07:38,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:38,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284455345] [2024-11-09 16:07:38,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:38,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:38,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:38,235 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:07:38,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:38,238 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:07:38,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:38,239 INFO L85 PathProgramCache]: Analyzing trace with hash 807915725, now seen corresponding path program 3 times [2024-11-09 16:07:38,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:38,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789679099] [2024-11-09 16:07:38,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:38,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:38,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:38,254 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:07:38,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:38,268 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:07:40,666 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-09 16:07:40,868 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 16:07:40,868 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 16:07:40,868 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 16:07:40,868 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 16:07:40,868 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 16:07:40,868 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:40,868 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 16:07:40,868 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 16:07:40,868 INFO L132 ssoRankerPreferences]: Filename of dumped script: recursified_nested_3.c_Iteration12_Lasso [2024-11-09 16:07:40,868 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 16:07:40,868 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 16:07:40,869 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:40,873 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:40,874 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:40,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:40,876 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:40,877 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:40,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:40,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:40,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:40,882 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:40,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:40,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:40,885 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:40,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:40,887 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:40,888 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:40,895 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:40,896 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:40,897 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:40,898 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:40,899 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:40,900 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:40,901 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:40,902 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:40,903 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:40,905 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:40,906 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:40,907 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:40,908 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:40,909 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:40,910 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:40,912 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:40,913 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:40,914 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:40,915 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:40,916 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:40,920 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:40,927 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:41,134 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:41,135 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:41,136 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:41,356 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 16:07:41,356 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 16:07:41,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:41,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:41,358 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-09 16:07:41,359 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-09 16:07:41,359 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 16:07:41,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:41,369 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:41,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:41,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:41,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:41,369 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:41,369 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:41,370 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:41,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2024-11-09 16:07:41,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:41,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:41,382 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-09 16:07:41,383 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-09 16:07:41,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-09 16:07:41,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:41,393 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:41,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:41,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:41,393 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:41,394 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:41,394 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:41,395 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:41,404 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-09 16:07:41,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:41,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:41,406 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-09 16:07:41,406 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-09 16:07:41,407 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:41,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:41,416 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:41,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:41,416 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:41,416 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:41,417 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:41,417 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:41,418 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:41,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2024-11-09 16:07:41,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:41,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:41,428 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-09 16:07:41,429 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-09 16:07:41,431 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 16:07:41,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:41,440 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:41,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:41,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:41,440 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:41,441 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:41,441 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:41,442 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:41,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2024-11-09 16:07:41,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:41,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:41,452 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-09 16:07:41,454 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-09 16:07:41,455 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:41,464 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:41,464 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:41,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:41,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:41,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:41,465 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:41,465 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:41,465 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:41,475 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-09 16:07:41,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:41,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:41,476 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-09 16:07:41,477 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-09 16:07:41,477 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:41,486 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:41,487 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:41,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:41,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:41,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:41,487 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:41,487 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:41,488 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:41,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2024-11-09 16:07:41,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:41,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:41,499 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-09 16:07:41,499 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-09 16:07:41,500 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:41,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:41,509 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:41,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:41,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:41,509 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:41,510 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:41,510 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:41,511 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:41,520 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-09 16:07:41,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:41,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:41,521 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-09 16:07:41,522 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-09 16:07:41,522 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:41,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:41,532 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:41,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:41,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:41,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:41,532 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:41,532 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:41,533 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:41,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2024-11-09 16:07:41,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:41,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:41,544 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-09 16:07:41,545 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-09 16:07:41,545 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 16:07:41,554 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:41,555 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:41,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:41,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:41,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:41,556 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:41,556 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:41,557 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:41,566 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-09 16:07:41,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:41,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:41,567 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-09 16:07:41,568 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-09 16:07:41,569 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:41,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:41,578 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:41,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:41,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:41,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:41,579 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:41,579 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:41,579 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:41,589 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-09 16:07:41,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:41,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:41,590 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-09 16:07:41,591 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-09 16:07:41,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-09 16:07:41,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:41,601 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:41,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:41,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:41,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:41,601 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:41,601 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:41,602 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:41,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2024-11-09 16:07:41,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:41,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:41,613 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-09 16:07:41,613 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-09 16:07:41,614 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:41,623 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:41,623 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:41,623 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:41,623 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:41,623 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:41,623 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:41,624 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:41,624 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:41,634 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-09 16:07:41,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:41,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:41,635 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-09 16:07:41,636 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-09 16:07:41,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-09 16:07:41,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:41,646 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:41,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:41,646 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:41,646 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:41,646 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:41,646 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:41,647 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:41,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2024-11-09 16:07:41,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:41,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:41,658 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-09 16:07:41,659 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-09 16:07:41,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-09 16:07:41,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:41,670 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:41,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:41,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:41,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:41,670 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:41,670 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:41,671 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:41,681 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-09 16:07:41,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:41,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:41,683 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-09 16:07:41,684 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-09 16:07:41,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-09 16:07:41,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:41,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:41,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:41,694 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:41,695 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 16:07:41,695 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 16:07:41,703 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:41,713 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-09 16:07:41,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:41,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:41,714 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-09 16:07:41,715 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-09 16:07:41,716 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:41,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:41,726 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:41,726 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:41,726 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:41,727 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 16:07:41,727 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 16:07:41,730 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:41,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2024-11-09 16:07:41,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:41,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:41,740 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-09 16:07:41,740 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-09 16:07:41,741 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:41,751 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:41,751 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:41,751 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:41,751 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:41,751 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:41,751 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:41,751 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:41,752 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:41,765 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-09 16:07:41,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:41,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:41,766 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-09 16:07:41,766 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-09 16:07:41,767 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 16:07:41,776 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:41,777 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:41,777 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:41,777 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:41,777 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:41,777 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:41,777 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:41,778 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:41,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2024-11-09 16:07:41,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:41,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:41,789 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-09 16:07:41,789 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-09 16:07:41,790 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:41,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:41,799 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:41,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:41,800 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:41,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:41,800 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:41,800 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:41,801 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:41,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2024-11-09 16:07:41,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:41,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:41,812 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-09 16:07:41,813 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-09 16:07:41,814 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 16:07:41,823 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:41,823 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:41,823 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:41,823 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:41,823 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:41,823 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:41,824 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:41,824 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:41,834 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-09 16:07:41,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:41,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:41,835 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-09 16:07:41,835 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-09 16:07:41,836 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:41,845 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:41,845 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:41,846 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:41,846 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:41,846 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:41,846 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:41,846 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:41,847 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:41,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2024-11-09 16:07:41,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:41,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:41,857 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-09 16:07:41,858 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-09 16:07:41,858 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:41,867 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:41,868 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:41,868 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:41,868 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:41,868 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:41,868 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:41,868 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:41,869 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:41,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2024-11-09 16:07:41,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:41,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:41,879 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-09 16:07:41,880 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-09 16:07:41,880 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:41,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:41,890 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:41,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:41,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:41,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:41,891 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:41,891 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:41,892 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:41,902 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-09 16:07:41,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:41,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:41,903 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-09 16:07:41,903 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-09 16:07:41,904 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:41,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:41,913 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:41,913 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:41,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:41,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:41,914 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:41,914 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:41,915 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:41,924 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-09 16:07:41,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:41,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:41,925 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-09 16:07:41,926 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-09 16:07:41,927 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 16:07:41,936 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:41,936 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:41,936 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:41,936 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:41,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:41,937 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:41,937 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:41,938 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:41,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2024-11-09 16:07:41,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:41,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:41,948 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-09 16:07:41,949 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-09 16:07:41,949 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:41,959 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:41,959 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:41,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:41,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:41,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:41,959 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:41,960 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:41,960 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:41,970 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-09 16:07:41,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:41,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:41,971 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-09 16:07:41,972 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-09 16:07:41,972 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 16:07:41,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:41,982 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:41,982 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:41,982 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:41,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:41,983 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:41,983 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:41,983 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:41,993 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-09 16:07:41,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:41,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:41,995 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-09 16:07:41,995 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-09 16:07:41,997 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 16:07:42,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:42,006 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:42,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:42,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:42,006 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:42,007 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:42,007 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:42,008 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:42,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Forceful destruction successful, exit code 0 [2024-11-09 16:07:42,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:42,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:42,018 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-09 16:07:42,019 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-09 16:07:42,019 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:42,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:42,029 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:42,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:42,029 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:42,029 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:42,029 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:42,029 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:42,030 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:42,039 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-09 16:07:42,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:42,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:42,040 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-09 16:07:42,042 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-09 16:07:42,042 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:42,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:42,052 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:42,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:42,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:42,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:42,052 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:42,052 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:42,053 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:42,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Forceful destruction successful, exit code 0 [2024-11-09 16:07:42,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:42,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:42,064 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-09 16:07:42,064 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-09 16:07:42,065 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:42,074 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:42,074 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:42,074 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:42,074 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:42,074 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:42,075 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:42,075 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:42,075 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:42,085 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-09 16:07:42,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:42,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:42,086 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-09 16:07:42,086 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-09 16:07:42,087 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:42,096 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:42,096 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:42,097 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:42,097 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:42,097 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:42,097 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:42,097 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:42,098 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:42,107 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-09 16:07:42,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:42,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:42,109 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-09 16:07:42,110 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-09 16:07:42,110 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 16:07:42,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:42,120 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:42,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:42,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:42,120 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:42,120 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:42,120 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:42,121 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:42,130 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-09 16:07:42,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:42,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:42,132 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-09 16:07:42,132 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-09 16:07:42,133 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:42,142 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:42,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:42,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:42,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:42,146 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 16:07:42,146 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 16:07:42,152 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 16:07:42,163 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2024-11-09 16:07:42,164 INFO L444 ModelExtractionUtils]: 3 out of 16 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-11-09 16:07:42,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:42,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:42,165 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-09 16:07:42,165 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-09 16:07:42,166 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 16:07:42,176 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 16:07:42,176 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 16:07:42,176 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-09 16:07:42,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Forceful destruction successful, exit code 0 [2024-11-09 16:07:42,197 INFO L156 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2024-11-09 16:07:42,197 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-11-09 16:07:42,197 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-11-09 16:07:42,197 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~c!base,]]] [2024-11-09 16:07:42,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:42,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:42,272 INFO L255 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 16:07:42,273 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:07:42,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:42,517 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 16:07:42,518 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:07:42,533 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-09 16:07:42,545 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-09 16:07:42,546 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-09 16:07:42,546 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-09 16:07:42,611 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-09 16:07:42,614 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-09 16:07:42,614 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-09 16:07:42,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2024-11-09 16:07:42,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 48 letters. Loop has 3 letters. [2024-11-09 16:07:42,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 16:07:42,614 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 16:07:42,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:42,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:42,698 INFO L255 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 16:07:42,699 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:07:42,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:42,921 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 16:07:42,922 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:07:42,940 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-09 16:07:42,956 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-09 16:07:42,957 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-09 16:07:42,957 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-09 16:07:43,019 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-09 16:07:43,021 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-09 16:07:43,021 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-09 16:07:43,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2024-11-09 16:07:43,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 48 letters. Loop has 3 letters. [2024-11-09 16:07:43,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 16:07:43,022 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 16:07:43,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:43,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:43,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 16:07:43,116 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:07:43,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:43,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 16:07:43,314 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:07:43,327 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-09 16:07:43,337 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-09 16:07:43,337 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-09 16:07:43,337 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-09 16:07:43,406 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-09 16:07:43,407 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-09 16:07:43,407 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-09 16:07:43,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2024-11-09 16:07:43,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 48 letters. Loop has 3 letters. [2024-11-09 16:07:43,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 16:07:43,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 51 letters. Loop has 3 letters. [2024-11-09 16:07:43,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 16:07:43,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 48 letters. Loop has 6 letters. [2024-11-09 16:07:43,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 16:07:43,408 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 223 states and 275 transitions. [2024-11-09 16:07:43,410 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-09 16:07:43,411 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 223 states to 129 states and 159 transitions. [2024-11-09 16:07:43,411 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2024-11-09 16:07:43,411 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2024-11-09 16:07:43,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 129 states and 159 transitions. [2024-11-09 16:07:43,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-09 16:07:43,412 INFO L218 hiAutomatonCegarLoop]: Abstraction has 129 states and 159 transitions. [2024-11-09 16:07:43,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states and 159 transitions. [2024-11-09 16:07:43,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 118. [2024-11-09 16:07:43,419 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-09 16:07:43,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 141 transitions. [2024-11-09 16:07:43,419 INFO L240 hiAutomatonCegarLoop]: Abstraction has 118 states and 141 transitions. [2024-11-09 16:07:43,419 INFO L425 stractBuchiCegarLoop]: Abstraction has 118 states and 141 transitions. [2024-11-09 16:07:43,419 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-11-09 16:07:43,420 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states and 141 transitions. [2024-11-09 16:07:43,420 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-11-09 16:07:43,420 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 16:07:43,420 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 16:07:43,421 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-09 16:07:43,422 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 16:07:43,422 INFO L745 eck$LassoCheckResult]: Stem: 10886#$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); 10868#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#2(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#3(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#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 10837#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);< 10838#$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#2(~a.base, ~a.offset, 4); 10883#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~b.base, ~b.offset, 4); 10887#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 10888#$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#3(~b.base, ~b.offset, 4); 10918#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 10843#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10842#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10844#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; 10872#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10882#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10875#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; 10871#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10882#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10875#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; 10871#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10882#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10875#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; 10871#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10882#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10875#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; 10871#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10882#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10875#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; 10871#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10882#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10952#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10870#L25-1 assume true; 10873#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10946#L25-1 assume true; 10945#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10944#L25-1 assume true; 10942#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10941#L25-1 assume true; 10940#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10939#L25-1 assume true; 10931#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10928#L25-1 assume true; 10927#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10929#L25-1 assume true; 10915#func_to_recursive_line_23_to_23_0EXIT >#64#return; 10914#L47-1 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 10847#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 10935#$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#3(~b.base, ~b.offset, 4); 10934#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 10845#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10842#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10844#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; 10872#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10882#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10875#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; 10871#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10882#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10875#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; 10871#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10882#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10875#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; 10871#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10882#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10875#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; 10871#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10882#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10875#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; 10871#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10882#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10952#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10870#L25-1 assume true; 10873#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10946#L25-1 assume true; 10945#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10944#L25-1 assume true; 10942#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10941#L25-1 assume true; 10940#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10939#L25-1 assume true; 10931#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10928#L25-1 assume true; 10927#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10929#L25-1 assume true; 10915#func_to_recursive_line_23_to_23_0EXIT >#64#return; 10916#L47-1 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 10848#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 10935#$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#3(~b.base, ~b.offset, 4); 10934#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 10845#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10842#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10844#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; 10872#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10882#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10875#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; 10871#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10882#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10875#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; 10871#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10882#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10875#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; 10871#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10882#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10875#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; 10871#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10882#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10875#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; 10871#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10882#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10952#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10870#L25-1 assume true; 10873#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10946#L25-1 assume true; 10945#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10944#L25-1 assume true; 10942#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10941#L25-1 assume true; 10940#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10939#L25-1 assume true; 10931#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10928#L25-1 assume true; 10927#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10929#L25-1 assume true; 10915#func_to_recursive_line_23_to_23_0EXIT >#64#return; 10916#L47-1 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 10848#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 10935#$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#3(~b.base, ~b.offset, 4); 10934#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 10845#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10842#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10844#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; 10872#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10882#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10875#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; 10871#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10882#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10875#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; 10871#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10882#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10875#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; 10871#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10882#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10875#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; 10871#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10882#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10875#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; 10871#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10882#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10952#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10870#L25-1 assume true; 10873#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10946#L25-1 assume true; 10945#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10944#L25-1 assume true; 10942#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10941#L25-1 assume true; 10940#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10939#L25-1 assume true; 10931#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10928#L25-1 assume true; 10927#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10929#L25-1 assume true; 10915#func_to_recursive_line_23_to_23_0EXIT >#64#return; 10916#L47-1 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 10848#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 10935#$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#3(~b.base, ~b.offset, 4); 10934#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 10845#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10842#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10844#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; 10872#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10882#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10875#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; 10871#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10882#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10875#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; 10871#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10882#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10875#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; 10871#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10882#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10875#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; 10871#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10882#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10875#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; 10871#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10882#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10952#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10870#L25-1 assume true; 10873#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10946#L25-1 assume true; 10945#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10944#L25-1 assume true; 10942#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10941#L25-1 assume true; 10940#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10939#L25-1 assume true; 10931#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10928#L25-1 assume true; 10927#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10929#L25-1 assume true; 10915#func_to_recursive_line_23_to_23_0EXIT >#64#return; 10916#L47-1 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 10848#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 10935#$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#3(~b.base, ~b.offset, 4); 10934#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 10845#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10842#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10844#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; 10872#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10882#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10875#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; 10871#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10882#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10875#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; 10871#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10882#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10875#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; 10871#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10882#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10875#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; 10871#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10882#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10875#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; 10871#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10882#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10952#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10870#L25-1 assume true; 10873#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10946#L25-1 assume true; 10945#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10944#L25-1 assume true; 10942#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10941#L25-1 assume true; 10940#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10939#L25-1 assume true; 10931#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10928#L25-1 assume true; 10927#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10929#L25-1 assume true; 10915#func_to_recursive_line_23_to_23_0EXIT >#64#return; 10916#L47-1 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 10848#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 10935#$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#3(~b.base, ~b.offset, 4); 10853#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 10846#L41-1 assume true; 10849#func_to_recursive_line_22_to_23_0EXIT >#66#return; 10878#L41-1 assume true; 10913#func_to_recursive_line_22_to_23_0EXIT >#66#return; 10912#L41-1 assume true; 10911#func_to_recursive_line_22_to_23_0EXIT >#66#return; 10910#L41-1 assume true; 10909#func_to_recursive_line_22_to_23_0EXIT >#66#return; 10908#L41-1 assume true; 10907#func_to_recursive_line_22_to_23_0EXIT >#66#return; 10906#L41-1 assume true; 10905#func_to_recursive_line_22_to_23_0EXIT >#66#return; 10904#L41-1 assume true; 10903#func_to_recursive_line_22_to_23_0EXIT >#70#return; 10889#L67-1 call #t~mem11 := read~int#2(~a.base, ~a.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#2(1 + #t~mem11, ~a.base, ~a.offset, 4);havoc #t~mem11;havoc #t~pre12; 10835#L72 call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);< 10836#$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#2(~a.base, ~a.offset, 4); 10884#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#3(0, ~b.base, ~b.offset, 4); 10851#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 10858#$Ultimate##0 [2024-11-09 16:07:43,422 INFO L747 eck$LassoCheckResult]: Loop: 10858#$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#3(~b.base, ~b.offset, 4); 10850#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#1(0, ~c.base, ~c.offset, 4); 10840#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10839#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10841#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; 10861#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10892#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10893#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; 10862#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10892#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10893#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; 10862#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10892#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10893#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; 10862#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10892#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10893#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; 10862#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10892#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10893#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; 10862#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10892#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#1(~c.base, ~c.offset, 4); 10874#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10869#L25-1 assume true; 10860#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10863#L25-1 assume true; 10902#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10901#L25-1 assume true; 10900#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10899#L25-1 assume true; 10898#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10897#L25-1 assume true; 10896#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10895#L25-1 assume true; 10894#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10891#L25-1 assume true; 10890#func_to_recursive_line_23_to_23_0EXIT >#64#return; 10854#L47-1 call #t~mem8 := read~int#3(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#3(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 10852#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 10858#$Ultimate##0 [2024-11-09 16:07:43,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:43,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1634781349, now seen corresponding path program 2 times [2024-11-09 16:07:43,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:43,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377311781] [2024-11-09 16:07:43,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:43,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:43,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:43,476 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:07:43,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:43,538 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:07:43,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:43,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1388529776, now seen corresponding path program 2 times [2024-11-09 16:07:43,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:43,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908184973] [2024-11-09 16:07:43,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:43,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:43,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:43,548 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:07:43,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:43,556 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:07:43,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:43,556 INFO L85 PathProgramCache]: Analyzing trace with hash -350990602, now seen corresponding path program 3 times [2024-11-09 16:07:43,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 16:07:43,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609361173] [2024-11-09 16:07:43,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 16:07:43,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 16:07:43,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:43,620 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 16:07:43,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 16:07:43,684 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 16:07:44,147 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-09 16:07:53,537 INFO L204 LassoAnalysis]: Preferences: [2024-11-09 16:07:53,537 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-09 16:07:53,537 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-09 16:07:53,537 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-09 16:07:53,538 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-09 16:07:53,538 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:53,538 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-09 16:07:53,538 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-09 16:07:53,538 INFO L132 ssoRankerPreferences]: Filename of dumped script: recursified_nested_3.c_Iteration13_Lasso [2024-11-09 16:07:53,538 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-09 16:07:53,538 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-09 16:07:53,539 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:53,541 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:53,547 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:53,548 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:53,549 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:53,550 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:53,551 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:53,552 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:53,553 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:53,554 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:53,555 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:53,556 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:53,557 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:53,559 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:53,560 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:53,561 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:53,562 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:53,564 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:53,565 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:53,941 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:53,943 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:53,944 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:53,945 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:53,946 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:53,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:53,948 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:53,949 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:53,950 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:53,951 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:53,952 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:53,953 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:53,954 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:53,955 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:53,959 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:53,961 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-09 16:07:54,235 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-09 16:07:54,235 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-09 16:07:54,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:54,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:54,236 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-09 16:07:54,237 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-09 16:07:54,240 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 16:07:54,249 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:54,250 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:54,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:54,250 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:54,250 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:54,250 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:54,250 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:54,251 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:54,261 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-09 16:07:54,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:54,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:54,262 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-09 16:07:54,263 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-09 16:07:54,264 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:54,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:54,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:54,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:54,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:54,274 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 16:07:54,274 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 16:07:54,277 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:54,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Forceful destruction successful, exit code 0 [2024-11-09 16:07:54,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:54,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:54,288 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-09 16:07:54,288 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-09 16:07:54,289 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:54,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:54,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:54,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:54,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:54,300 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 16:07:54,300 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 16:07:54,302 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:54,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Forceful destruction successful, exit code 0 [2024-11-09 16:07:54,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:54,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:54,313 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-09 16:07:54,313 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-09 16:07:54,314 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:54,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:54,323 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:54,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:54,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:54,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:54,324 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:54,324 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:54,325 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:54,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2024-11-09 16:07:54,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:54,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:54,336 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-09 16:07:54,336 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-09 16:07:54,337 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:54,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:54,347 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:54,347 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:54,347 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:54,347 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:54,347 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:54,347 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:54,348 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:54,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Forceful destruction successful, exit code 0 [2024-11-09 16:07:54,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:54,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:54,359 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-09 16:07:54,359 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-09 16:07:54,360 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 16:07:54,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:54,370 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:54,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:54,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:54,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:54,370 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:54,370 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:54,371 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:54,380 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-09 16:07:54,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:54,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:54,381 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-09 16:07:54,382 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-09 16:07:54,383 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:54,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:54,393 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:54,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:54,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:54,393 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:54,393 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:54,393 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:54,394 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:54,403 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-09 16:07:54,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:54,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:54,405 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-09 16:07:54,405 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-09 16:07:54,406 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 16:07:54,415 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:54,415 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:54,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:54,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:54,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:54,416 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:54,416 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:54,416 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:54,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Forceful destruction successful, exit code 0 [2024-11-09 16:07:54,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:54,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:54,430 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-09 16:07:54,430 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-09 16:07:54,431 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 16:07:54,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:54,441 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:54,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:54,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:54,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:54,441 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:54,441 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:54,442 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:54,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2024-11-09 16:07:54,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:54,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:54,452 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-09 16:07:54,453 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-09 16:07:54,454 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:54,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:54,463 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:54,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:54,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:54,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:54,463 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:54,464 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:54,464 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:54,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Forceful destruction successful, exit code 0 [2024-11-09 16:07:54,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:54,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:54,475 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-09 16:07:54,476 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-09 16:07:54,476 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:54,486 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:54,486 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:54,486 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:54,486 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:54,486 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:54,486 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:54,486 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:54,487 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:54,497 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-09 16:07:54,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:54,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:54,498 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-09 16:07:54,498 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-09 16:07:54,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-09 16:07:54,508 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:54,509 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:54,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:54,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:54,509 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:54,509 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:54,509 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:54,510 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:54,519 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-09 16:07:54,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:54,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:54,520 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-09 16:07:54,521 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-09 16:07:54,521 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 16:07:54,531 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:54,532 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:54,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:54,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:54,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:54,532 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:54,532 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:54,533 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:54,542 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-09 16:07:54,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:54,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:54,543 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-09 16:07:54,544 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-09 16:07:54,544 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:54,554 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:54,554 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:54,554 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:54,554 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:54,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:54,554 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:54,554 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:54,555 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:54,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Forceful destruction successful, exit code 0 [2024-11-09 16:07:54,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:54,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:54,566 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-09 16:07:54,567 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-09 16:07:54,567 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:54,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:54,577 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:54,577 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:54,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:54,577 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:54,577 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:54,577 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:54,578 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:54,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Forceful destruction successful, exit code 0 [2024-11-09 16:07:54,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:54,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:54,589 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-09 16:07:54,589 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-09 16:07:54,590 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:54,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:54,600 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:54,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:54,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:54,600 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:54,601 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:54,601 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:54,602 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:54,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Forceful destruction successful, exit code 0 [2024-11-09 16:07:54,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:54,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:54,613 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-09 16:07:54,613 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-09 16:07:54,615 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:54,624 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:54,624 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:54,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:54,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:54,625 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:54,625 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:54,625 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:54,626 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:54,635 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-09 16:07:54,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:54,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:54,637 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-09 16:07:54,637 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-09 16:07:54,639 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:54,649 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:54,649 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-09 16:07:54,649 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:54,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:54,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:54,649 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-09 16:07:54,649 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-09 16:07:54,650 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:54,660 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-09 16:07:54,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:54,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:54,661 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-09 16:07:54,661 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-09 16:07:54,662 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 16:07:54,671 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:54,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:54,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:54,672 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:54,673 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 16:07:54,673 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 16:07:54,675 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:54,685 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-09 16:07:54,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:54,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:54,686 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-09 16:07:54,687 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-09 16:07:54,688 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:54,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:54,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:54,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:54,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:54,699 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 16:07:54,699 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 16:07:54,702 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:54,711 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-09 16:07:54,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:54,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:54,713 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-09 16:07:54,713 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-09 16:07:54,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-09 16:07:54,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:54,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:54,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:54,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:54,725 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 16:07:54,725 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 16:07:54,728 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:54,742 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-09 16:07:54,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:54,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:54,743 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-09 16:07:54,744 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-09 16:07:54,744 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:54,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:54,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:54,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:54,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:54,756 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 16:07:54,756 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 16:07:54,759 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:54,770 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-09 16:07:54,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:54,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:54,771 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-09 16:07:54,771 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-09 16:07:54,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-09 16:07:54,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:54,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:54,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:54,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:54,783 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 16:07:54,783 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 16:07:54,786 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:54,796 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-09 16:07:54,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:54,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:54,797 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-09 16:07:54,798 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-09 16:07:54,799 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:54,808 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:54,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:54,809 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:54,809 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:54,809 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 16:07:54,810 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 16:07:54,812 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:54,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Forceful destruction successful, exit code 0 [2024-11-09 16:07:54,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:54,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:54,822 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-09 16:07:54,824 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-09 16:07:54,824 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:54,834 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:54,834 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:54,834 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:54,834 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:54,836 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 16:07:54,836 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 16:07:54,839 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:54,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Forceful destruction successful, exit code 0 [2024-11-09 16:07:54,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:54,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:54,850 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 16:07:54,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2024-11-09 16:07:54,852 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:54,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:54,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:54,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:54,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:54,863 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 16:07:54,863 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 16:07:54,865 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:54,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Ended with exit code 0 [2024-11-09 16:07:54,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:54,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:54,876 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 16:07:54,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2024-11-09 16:07:54,877 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:54,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:54,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:54,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:54,887 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:54,889 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 16:07:54,889 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 16:07:54,893 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:54,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Ended with exit code 0 [2024-11-09 16:07:54,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:54,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:54,903 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 16:07:54,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2024-11-09 16:07:54,904 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-09 16:07:54,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:54,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:54,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:54,914 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:54,916 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 16:07:54,916 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 16:07:54,919 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-09 16:07:54,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Ended with exit code 0 [2024-11-09 16:07:54,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:54,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:54,930 INFO L229 MonitoredProcess]: Starting monitored process 120 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 16:07:54,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2024-11-09 16:07:54,931 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-11-09 16:07:54,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-09 16:07:54,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-09 16:07:54,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-09 16:07:54,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-09 16:07:54,944 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-09 16:07:54,944 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-09 16:07:54,951 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-09 16:07:54,960 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-11-09 16:07:54,960 INFO L444 ModelExtractionUtils]: 3 out of 16 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-11-09 16:07:54,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 16:07:54,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 16:07:54,961 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-09 16:07:54,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2024-11-09 16:07:54,962 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-09 16:07:54,973 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-09 16:07:54,973 INFO L474 LassoAnalysis]: Proved termination. [2024-11-09 16:07:54,973 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#3 func_to_recursive_line_22_to_23_0_#in~b.base) 0)_2) = -2*v_rep(select (select #memory_int#3 func_to_recursive_line_22_to_23_0_#in~b.base) 0)_2 + 11 Supporting invariants [] [2024-11-09 16:07:54,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Ended with exit code 0 [2024-11-09 16:07:55,005 INFO L156 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed [2024-11-09 16:07:55,007 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-11-09 16:07:55,007 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-11-09 16:07:55,007 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[#in~b!base,]]] [2024-11-09 16:07:55,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:55,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:55,312 INFO L255 TraceCheckSpWp]: Trace formula consists of 3122 conjuncts, 114 conjuncts are in the unsatisfiable core [2024-11-09 16:07:55,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:07:56,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Ended with exit code 0 [2024-11-09 16:07:56,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:56,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-09 16:07:56,676 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:07:56,843 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-09 16:07:56,860 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-09 16:07:56,860 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.6 stem predicates 5 loop predicates [2024-11-09 16:07:56,860 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 118 states and 141 transitions. cyclomatic complexity: 30 Second operand has 11 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 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-09 16:07:57,044 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 118 states and 141 transitions. cyclomatic complexity: 30. Second operand has 11 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 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 26 states. [2024-11-09 16:07:57,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 5 stem states 5 non-accepting loop states 1 accepting loop states [2024-11-09 16:07:57,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 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-09 16:07:57,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 20 transitions. [2024-11-09 16:07:57,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 20 transitions. Stem has 261 letters. Loop has 39 letters. [2024-11-09 16:07:57,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 16:07:57,046 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 16:07:57,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:57,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:57,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 3122 conjuncts, 114 conjuncts are in the unsatisfiable core [2024-11-09 16:07:57,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:07:58,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:58,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-09 16:07:58,671 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:07:58,824 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-09 16:07:58,840 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-09 16:07:58,841 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.6 stem predicates 5 loop predicates [2024-11-09 16:07:58,841 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 118 states and 141 transitions. cyclomatic complexity: 30 Second operand has 11 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 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-09 16:07:59,022 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 118 states and 141 transitions. cyclomatic complexity: 30. Second operand has 11 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 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 26 states. [2024-11-09 16:07:59,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 5 stem states 5 non-accepting loop states 1 accepting loop states [2024-11-09 16:07:59,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 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-09 16:07:59,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 20 transitions. [2024-11-09 16:07:59,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 20 transitions. Stem has 261 letters. Loop has 39 letters. [2024-11-09 16:07:59,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 16:07:59,023 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-11-09 16:07:59,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 16:07:59,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:07:59,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 3122 conjuncts, 114 conjuncts are in the unsatisfiable core [2024-11-09 16:07:59,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:08:00,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 16:08:00,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-09 16:08:00,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 16:08:00,946 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-09 16:08:00,961 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-09 16:08:00,962 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.6 stem predicates 5 loop predicates [2024-11-09 16:08:00,962 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 118 states and 141 transitions. cyclomatic complexity: 30 Second operand has 11 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 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-09 16:08:01,184 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 118 states and 141 transitions. cyclomatic complexity: 30. Second operand has 11 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 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 225 states and 258 transitions. Complement of second has 30 states. [2024-11-09 16:08:01,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 6 stem states 5 non-accepting loop states 1 accepting loop states [2024-11-09 16:08:01,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 7 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-09 16:08:01,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 39 transitions. [2024-11-09 16:08:01,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 39 transitions. Stem has 261 letters. Loop has 39 letters. [2024-11-09 16:08:01,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 16:08:01,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 39 transitions. Stem has 300 letters. Loop has 39 letters. [2024-11-09 16:08:01,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 16:08:01,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 39 transitions. Stem has 261 letters. Loop has 78 letters. [2024-11-09 16:08:01,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-09 16:08:01,188 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 225 states and 258 transitions. [2024-11-09 16:08:01,191 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-09 16:08:01,191 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 225 states to 0 states and 0 transitions. [2024-11-09 16:08:01,191 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-09 16:08:01,191 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-09 16:08:01,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-09 16:08:01,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 16:08:01,191 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 16:08:01,191 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 16:08:01,191 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 16:08:01,191 INFO L332 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2024-11-09 16:08:01,191 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-09 16:08:01,191 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-09 16:08:01,191 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-09 16:08:01,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.11 04:08:01 BoogieIcfgContainer [2024-11-09 16:08:01,196 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-09 16:08:01,197 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 16:08:01,197 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 16:08:01,197 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 16:08:01,197 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:06:57" (3/4) ... [2024-11-09 16:08:01,198 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 16:08:01,199 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 16:08:01,200 INFO L158 Benchmark]: Toolchain (without parser) took 63990.71ms. Allocated memory was 153.1MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 98.6MB in the beginning and 766.4MB in the end (delta: -667.8MB). Peak memory consumption was 367.8MB. Max. memory is 16.1GB. [2024-11-09 16:08:01,200 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 153.1MB. Free memory is still 114.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 16:08:01,200 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.04ms. Allocated memory is still 153.1MB. Free memory was 98.6MB in the beginning and 86.4MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 16:08:01,200 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.57ms. Allocated memory is still 153.1MB. Free memory was 86.4MB in the beginning and 84.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 16:08:01,200 INFO L158 Benchmark]: Boogie Preprocessor took 32.01ms. Allocated memory is still 153.1MB. Free memory was 84.8MB in the beginning and 82.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 16:08:01,200 INFO L158 Benchmark]: RCFGBuilder took 284.70ms. Allocated memory is still 153.1MB. Free memory was 82.7MB in the beginning and 67.2MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 16:08:01,200 INFO L158 Benchmark]: BuchiAutomizer took 63450.00ms. Allocated memory was 153.1MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 67.2MB in the beginning and 767.4MB in the end (delta: -700.3MB). Peak memory consumption was 336.4MB. Max. memory is 16.1GB. [2024-11-09 16:08:01,201 INFO L158 Benchmark]: Witness Printer took 2.57ms. Allocated memory is still 1.2GB. Free memory was 767.4MB in the beginning and 766.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 16:08:01,201 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 153.1MB. Free memory is still 114.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 195.04ms. Allocated memory is still 153.1MB. Free memory was 98.6MB in the beginning and 86.4MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.57ms. Allocated memory is still 153.1MB. Free memory was 86.4MB in the beginning and 84.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.01ms. Allocated memory is still 153.1MB. Free memory was 84.8MB in the beginning and 82.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 284.70ms. Allocated memory is still 153.1MB. Free memory was 82.7MB in the beginning and 67.2MB in the end (delta: 15.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 63450.00ms. Allocated memory was 153.1MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 67.2MB in the beginning and 767.4MB in the end (delta: -700.3MB). Peak memory consumption was 336.4MB. Max. memory is 16.1GB. * Witness Printer took 2.57ms. Allocated memory is still 1.2GB. Free memory was 767.4MB in the beginning and 766.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#2 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#in~a!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_int#3,GLOBAL]],[IdentifierExpression[#in~b!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~c!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~c!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#3 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[#in~b!base,]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 13 terminating modules (8 trivial, 3 deterministic, 2 nondeterministic). One deterministic module has affine ranking function null and consists of 6 locations. One deterministic module has affine ranking function null and consists of 11 locations. One deterministic module has affine ranking function null and consists of 5 locations. One nondeterministic module has affine ranking function null and consists of 6 locations. One nondeterministic module has affine ranking function null and consists of 12 locations. 8 modules have a trivial ranking function, the largest among these consists of 45 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 63.4s and 14 iterations. TraceHistogramMax:42. Analysis of lassos took 51.6s. Construction of modules took 1.2s. Büchi inclusion checks took 10.3s. Highest rank in rank-based complementation 3. Minimization of det autom 9. Minimization of nondet autom 4. Automata minimization 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 39 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 4401/4401 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 525 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 512 mSDsluCounter, 1184 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 926 mSDsCounter, 484 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2180 IncrementalHoareTripleChecker+Invalid, 2664 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 484 mSolverCounterUnsat, 258 mSDtfsCounter, 2180 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI8 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital271 mio100 ax100 hnf100 lsp94 ukn66 mio100 lsp21 div100 bol100 ite100 ukn100 eq215 hnf87 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 17ms VariablesStem: 2 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-11-09 16:08:01,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 16:08:01,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 16:08:01,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 16:08:01,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 16:08:02,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 16:08:02,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 16:08:02,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE