./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/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-dev-4a390ef-m [2024-10-25 00:37:45,092 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-25 00:37:45,156 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-25 00:37:45,164 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-25 00:37:45,164 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-25 00:37:45,201 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-25 00:37:45,206 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-25 00:37:45,207 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-25 00:37:45,208 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-25 00:37:45,212 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-25 00:37:45,213 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-25 00:37:45,213 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-25 00:37:45,213 INFO L153 SettingsManager]: * Use SBE=true [2024-10-25 00:37:45,214 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-25 00:37:45,214 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-25 00:37:45,214 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-25 00:37:45,214 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-25 00:37:45,214 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-25 00:37:45,215 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-25 00:37:45,215 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-25 00:37:45,215 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-25 00:37:45,220 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-25 00:37:45,220 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-25 00:37:45,220 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-25 00:37:45,220 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-25 00:37:45,221 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-25 00:37:45,221 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-25 00:37:45,221 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-25 00:37:45,221 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-25 00:37:45,222 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-25 00:37:45,222 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-25 00:37:45,223 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-25 00:37:45,223 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-25 00:37:45,223 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-25 00:37:45,224 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-25 00:37:45,224 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-25 00:37:45,224 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-25 00:37:45,224 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-25 00:37:45,225 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-25 00:37:45,225 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-10-25 00:37:45,499 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-25 00:37:45,525 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-25 00:37:45,528 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-25 00:37:45,530 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-25 00:37:45,530 INFO L274 PluginConnector]: CDTParser initialized [2024-10-25 00:37:45,531 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c [2024-10-25 00:37:47,237 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-25 00:37:47,436 INFO L384 CDTParser]: Found 1 translation units. [2024-10-25 00:37:47,436 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c [2024-10-25 00:37:47,444 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2efb6a22/56d7da5237ef4d548bf80beabda0aea2/FLAG506167984 [2024-10-25 00:37:47,458 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2efb6a22/56d7da5237ef4d548bf80beabda0aea2 [2024-10-25 00:37:47,460 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-25 00:37:47,461 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-25 00:37:47,462 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-25 00:37:47,463 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-25 00:37:47,472 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-25 00:37:47,473 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:37:47" (1/1) ... [2024-10-25 00:37:47,474 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@450a7ce3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:47, skipping insertion in model container [2024-10-25 00:37:47,474 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 12:37:47" (1/1) ... [2024-10-25 00:37:47,495 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-25 00:37:47,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-25 00:37:47,714 INFO L200 MainTranslator]: Completed pre-run [2024-10-25 00:37:47,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-25 00:37:47,759 INFO L204 MainTranslator]: Completed translation [2024-10-25 00:37:47,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:47 WrapperNode [2024-10-25 00:37:47,760 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-25 00:37:47,761 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-25 00:37:47,761 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-25 00:37:47,761 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-25 00:37:47,769 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:47" (1/1) ... [2024-10-25 00:37:47,777 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:47" (1/1) ... [2024-10-25 00:37:47,795 INFO L138 Inliner]: procedures = 14, calls = 41, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 53 [2024-10-25 00:37:47,797 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-25 00:37:47,798 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-25 00:37:47,798 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-25 00:37:47,798 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-25 00:37:47,809 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:47" (1/1) ... [2024-10-25 00:37:47,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:47" (1/1) ... [2024-10-25 00:37:47,815 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:47" (1/1) ... [2024-10-25 00:37:47,838 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-10-25 00:37:47,841 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:47" (1/1) ... [2024-10-25 00:37:47,843 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:47" (1/1) ... [2024-10-25 00:37:47,848 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:47" (1/1) ... [2024-10-25 00:37:47,854 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:47" (1/1) ... [2024-10-25 00:37:47,858 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:47" (1/1) ... [2024-10-25 00:37:47,859 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:47" (1/1) ... [2024-10-25 00:37:47,861 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-25 00:37:47,865 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-25 00:37:47,865 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-25 00:37:47,865 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-25 00:37:47,869 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:47" (1/1) ... [2024-10-25 00:37:47,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:37:47,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:37:47,906 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-10-25 00:37:47,909 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-10-25 00:37:47,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-25 00:37:47,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-25 00:37:47,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-25 00:37:47,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-25 00:37:47,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-25 00:37:47,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-25 00:37:47,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-25 00:37:47,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-25 00:37:47,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-25 00:37:47,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-25 00:37:47,958 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_23_0 [2024-10-25 00:37:47,959 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_23_0 [2024-10-25 00:37:47,959 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_22_to_23_0 [2024-10-25 00:37:47,959 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_22_to_23_0 [2024-10-25 00:37:47,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-25 00:37:47,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-25 00:37:47,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-25 00:37:47,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-25 00:37:47,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-25 00:37:47,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-25 00:37:47,962 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_21_to_22_0 [2024-10-25 00:37:47,962 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_21_to_22_0 [2024-10-25 00:37:47,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-25 00:37:48,040 INFO L238 CfgBuilder]: Building ICFG [2024-10-25 00:37:48,043 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-25 00:37:48,345 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-10-25 00:37:48,345 INFO L287 CfgBuilder]: Performing block encoding [2024-10-25 00:37:48,371 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-25 00:37:48,371 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-25 00:37:48,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:37:48 BoogieIcfgContainer [2024-10-25 00:37:48,374 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-25 00:37:48,375 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-25 00:37:48,375 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-25 00:37:48,380 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-25 00:37:48,381 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-25 00:37:48,381 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 25.10 12:37:47" (1/3) ... [2024-10-25 00:37:48,382 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@478c45ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.10 12:37:48, skipping insertion in model container [2024-10-25 00:37:48,383 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-25 00:37:48,383 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 12:37:47" (2/3) ... [2024-10-25 00:37:48,383 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@478c45ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.10 12:37:48, skipping insertion in model container [2024-10-25 00:37:48,383 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-25 00:37:48,383 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 12:37:48" (3/3) ... [2024-10-25 00:37:48,385 INFO L332 chiAutomizerObserver]: Analyzing ICFG recursified_nested_3.c [2024-10-25 00:37:48,449 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-25 00:37:48,449 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-25 00:37:48,449 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-25 00:37:48,449 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-25 00:37:48,449 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-25 00:37:48,450 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-25 00:37:48,450 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-25 00:37:48,453 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-25 00:37:48,459 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-10-25 00:37:48,498 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-10-25 00:37:48,498 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:37:48,498 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:37:48,507 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-25 00:37:48,508 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:37:48,508 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-25 00:37:48,508 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-10-25 00:37:48,512 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-10-25 00:37:48,514 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:37:48,514 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:37:48,514 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-25 00:37:48,514 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:37:48,524 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#1(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#3(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-10-25 00:37:48,525 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#1(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#1(~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-10-25 00:37:48,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:48,533 INFO L85 PathProgramCache]: Analyzing trace with hash 49760, now seen corresponding path program 1 times [2024-10-25 00:37:48,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:48,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682118208] [2024-10-25 00:37:48,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:48,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:48,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:48,749 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:37:48,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:48,816 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:37:48,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:48,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1113047060, now seen corresponding path program 1 times [2024-10-25 00:37:48,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:48,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671406211] [2024-10-25 00:37:48,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:48,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:48,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:49,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:49,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:49,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:37:49,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:37:49,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671406211] [2024-10-25 00:37:49,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671406211] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:37:49,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:37:49,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-25 00:37:49,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607829979] [2024-10-25 00:37:49,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:37:49,312 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-25 00:37:49,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:37:49,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-25 00:37:49,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-25 00:37:49,348 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-10-25 00:37:49,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:37:49,504 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2024-10-25 00:37:49,506 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 46 transitions. [2024-10-25 00:37:49,510 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-10-25 00:37:49,518 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 24 states and 29 transitions. [2024-10-25 00:37:49,521 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2024-10-25 00:37:49,522 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-10-25 00:37:49,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 29 transitions. [2024-10-25 00:37:49,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:37:49,525 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 29 transitions. [2024-10-25 00:37:49,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 29 transitions. [2024-10-25 00:37:49,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2024-10-25 00:37:49,550 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-10-25 00:37:49,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-10-25 00:37:49,552 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-10-25 00:37:49,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-25 00:37:49,563 INFO L425 stractBuchiCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-10-25 00:37:49,564 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-25 00:37:49,564 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 26 transitions. [2024-10-25 00:37:49,565 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-10-25 00:37:49,565 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:37:49,565 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:37:49,566 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-25 00:37:49,566 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-10-25 00:37:49,566 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#1(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#3(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-10-25 00:37:49,566 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#1(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#1(~b.base, ~b.offset, 4); 101#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(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#3(~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#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(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#1(~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-10-25 00:37:49,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:49,567 INFO L85 PathProgramCache]: Analyzing trace with hash 49760, now seen corresponding path program 2 times [2024-10-25 00:37:49,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:49,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917547695] [2024-10-25 00:37:49,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:49,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:49,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:49,582 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:37:49,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:49,593 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:37:49,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:49,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1122494970, now seen corresponding path program 1 times [2024-10-25 00:37:49,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:49,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995052683] [2024-10-25 00:37:49,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:49,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:49,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:49,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:49,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:49,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:49,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:49,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-25 00:37:49,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:49,995 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-25 00:37:49,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:37:49,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995052683] [2024-10-25 00:37:49,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995052683] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 00:37:49,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 00:37:49,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-25 00:37:49,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489469310] [2024-10-25 00:37:49,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 00:37:49,999 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-25 00:37:50,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:37:50,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-25 00:37:50,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-25 00:37:50,001 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-10-25 00:37:50,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:37:50,114 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2024-10-25 00:37:50,114 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions. [2024-10-25 00:37:50,115 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-10-25 00:37:50,116 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 28 transitions. [2024-10-25 00:37:50,116 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2024-10-25 00:37:50,116 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-10-25 00:37:50,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2024-10-25 00:37:50,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:37:50,117 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-10-25 00:37:50,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2024-10-25 00:37:50,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-10-25 00:37:50,123 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-10-25 00:37:50,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2024-10-25 00:37:50,126 INFO L240 hiAutomatonCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-10-25 00:37:50,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-25 00:37:50,128 INFO L425 stractBuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-10-25 00:37:50,128 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-25 00:37:50,128 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 28 transitions. [2024-10-25 00:37:50,129 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-10-25 00:37:50,129 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:37:50,129 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:37:50,129 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-25 00:37:50,130 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-10-25 00:37:50,130 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#1(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#3(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-10-25 00:37:50,130 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#1(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#1(~b.base, ~b.offset, 4); 184#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(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#3(~c.base, ~c.offset, 4); 182#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~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#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(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#1(~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-10-25 00:37:50,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:50,135 INFO L85 PathProgramCache]: Analyzing trace with hash 49760, now seen corresponding path program 3 times [2024-10-25 00:37:50,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:50,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350369791] [2024-10-25 00:37:50,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:50,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:50,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:50,153 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:37:50,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:50,166 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:37:50,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:50,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1944809856, now seen corresponding path program 1 times [2024-10-25 00:37:50,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:50,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318160627] [2024-10-25 00:37:50,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:50,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:50,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:50,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:50,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:50,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:50,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:50,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:50,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:50,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-25 00:37:50,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:50,883 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-25 00:37:50,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:37:50,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318160627] [2024-10-25 00:37:50,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318160627] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 00:37:50,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865758617] [2024-10-25 00:37:50,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:50,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 00:37:50,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:37:50,889 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-10-25 00:37:50,891 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-10-25 00:37:50,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:50,981 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-25 00:37:50,987 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:37:51,029 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-10-25 00:37:51,279 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-25 00:37:51,279 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 00:37:51,735 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-25 00:37:51,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865758617] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 00:37:51,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 00:37:51,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 25 [2024-10-25 00:37:51,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382373363] [2024-10-25 00:37:51,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 00:37:51,737 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-25 00:37:51,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:37:51,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-25 00:37:51,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2024-10-25 00:37:51,739 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-10-25 00:37:52,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:37:52,161 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2024-10-25 00:37:52,161 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 32 transitions. [2024-10-25 00:37:52,162 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-10-25 00:37:52,163 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 32 transitions. [2024-10-25 00:37:52,164 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2024-10-25 00:37:52,164 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2024-10-25 00:37:52,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 32 transitions. [2024-10-25 00:37:52,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:37:52,165 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-10-25 00:37:52,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 32 transitions. [2024-10-25 00:37:52,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-10-25 00:37:52,167 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-10-25 00:37:52,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2024-10-25 00:37:52,168 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-10-25 00:37:52,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-25 00:37:52,169 INFO L425 stractBuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2024-10-25 00:37:52,170 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-25 00:37:52,170 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 32 transitions. [2024-10-25 00:37:52,170 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-10-25 00:37:52,170 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:37:52,171 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:37:52,172 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-25 00:37:52,172 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-10-25 00:37:52,172 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#1(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#3(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-10-25 00:37:52,172 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#1(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#1(~b.base, ~b.offset, 4); 463#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(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#3(~c.base, ~c.offset, 4); 462#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~c.base, ~c.offset, 4); 462#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~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#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(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#1(~b.base, ~b.offset, 4); 463#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(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#3(~c.base, ~c.offset, 4); 462#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~c.base, ~c.offset, 4); 462#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~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#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(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#1(~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-10-25 00:37:52,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:52,173 INFO L85 PathProgramCache]: Analyzing trace with hash 49760, now seen corresponding path program 4 times [2024-10-25 00:37:52,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:52,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529078765] [2024-10-25 00:37:52,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:52,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:52,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:52,184 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:37:52,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:52,191 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:37:52,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:52,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1306331242, now seen corresponding path program 2 times [2024-10-25 00:37:52,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:52,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268601054] [2024-10-25 00:37:52,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:52,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:52,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:52,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:52,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:52,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:52,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:52,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:52,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:53,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:53,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:53,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-25 00:37:53,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:53,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:53,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:53,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:53,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:53,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:53,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:53,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-25 00:37:53,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:53,165 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-10-25 00:37:53,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:37:53,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268601054] [2024-10-25 00:37:53,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268601054] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 00:37:53,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196639408] [2024-10-25 00:37:53,166 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-25 00:37:53,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 00:37:53,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:37:53,172 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-10-25 00:37:53,177 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-10-25 00:37:53,289 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-25 00:37:53,289 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-25 00:37:53,292 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-10-25 00:37:53,297 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:37:53,328 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-10-25 00:37:53,500 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 45 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-25 00:37:53,501 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 00:37:54,203 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 4 proven. 56 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-25 00:37:54,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196639408] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 00:37:54,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 00:37:54,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 14] total 30 [2024-10-25 00:37:54,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026456290] [2024-10-25 00:37:54,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 00:37:54,204 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-25 00:37:54,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:37:54,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-25 00:37:54,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=720, Unknown=0, NotChecked=0, Total=870 [2024-10-25 00:37:54,206 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-10-25 00:37:54,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:37:54,489 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2024-10-25 00:37:54,489 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 36 transitions. [2024-10-25 00:37:54,490 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-10-25 00:37:54,492 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 32 states and 36 transitions. [2024-10-25 00:37:54,492 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2024-10-25 00:37:54,492 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2024-10-25 00:37:54,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 36 transitions. [2024-10-25 00:37:54,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:37:54,493 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-10-25 00:37:54,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 36 transitions. [2024-10-25 00:37:54,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-25 00:37:54,497 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-10-25 00:37:54,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2024-10-25 00:37:54,498 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-10-25 00:37:54,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-25 00:37:54,499 INFO L425 stractBuchiCegarLoop]: Abstraction has 32 states and 36 transitions. [2024-10-25 00:37:54,499 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-25 00:37:54,499 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 36 transitions. [2024-10-25 00:37:54,500 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-10-25 00:37:54,501 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:37:54,501 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:37:54,503 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-25 00:37:54,504 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-10-25 00:37:54,504 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#1(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#3(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-10-25 00:37:54,504 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#1(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#1(~b.base, ~b.offset, 4); 1000#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(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#3(~c.base, ~c.offset, 4); 998#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~c.base, ~c.offset, 4); 998#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~c.base, ~c.offset, 4); 998#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~c.base, ~c.offset, 4); 998#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~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#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(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#1(~b.base, ~b.offset, 4); 1000#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(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#3(~c.base, ~c.offset, 4); 998#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~c.base, ~c.offset, 4); 998#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~c.base, ~c.offset, 4); 998#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~c.base, ~c.offset, 4); 998#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~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#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(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#1(~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-10-25 00:37:54,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:54,505 INFO L85 PathProgramCache]: Analyzing trace with hash 49760, now seen corresponding path program 5 times [2024-10-25 00:37:54,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:54,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190622169] [2024-10-25 00:37:54,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:54,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:54,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:54,512 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:37:54,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:54,518 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:37:54,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:54,518 INFO L85 PathProgramCache]: Analyzing trace with hash -909942614, now seen corresponding path program 3 times [2024-10-25 00:37:54,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:54,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593633827] [2024-10-25 00:37:54,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:54,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:54,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:55,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:55,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:55,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:55,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:55,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:55,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:56,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:56,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:56,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:56,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:56,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:56,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:56,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:37:56,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:56,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:56,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:56,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:56,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:56,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:56,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:56,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:56,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:56,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:56,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:56,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-25 00:37:56,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:56,406 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 10 proven. 118 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-10-25 00:37:56,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:37:56,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593633827] [2024-10-25 00:37:56,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593633827] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 00:37:56,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590695417] [2024-10-25 00:37:56,406 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-25 00:37:56,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 00:37:56,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:37:56,412 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-10-25 00:37:56,417 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-10-25 00:37:56,522 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-25 00:37:56,522 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-25 00:37:56,524 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-25 00:37:56,531 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:37:56,536 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-10-25 00:37:56,745 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2024-10-25 00:37:56,745 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 00:37:57,347 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-10-25 00:37:57,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590695417] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 00:37:57,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 00:37:57,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 14] total 35 [2024-10-25 00:37:57,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191148765] [2024-10-25 00:37:57,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 00:37:57,348 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-25 00:37:57,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:37:57,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-25 00:37:57,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1036, Unknown=0, NotChecked=0, Total=1190 [2024-10-25 00:37:57,349 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-10-25 00:37:57,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:37:57,843 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2024-10-25 00:37:57,843 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 40 transitions. [2024-10-25 00:37:57,844 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-10-25 00:37:57,844 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 36 states and 40 transitions. [2024-10-25 00:37:57,845 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2024-10-25 00:37:57,845 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2024-10-25 00:37:57,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 40 transitions. [2024-10-25 00:37:57,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:37:57,845 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 40 transitions. [2024-10-25 00:37:57,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 40 transitions. [2024-10-25 00:37:57,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-10-25 00:37:57,847 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-10-25 00:37:57,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2024-10-25 00:37:57,848 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 40 transitions. [2024-10-25 00:37:57,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-25 00:37:57,849 INFO L425 stractBuchiCegarLoop]: Abstraction has 36 states and 40 transitions. [2024-10-25 00:37:57,849 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-25 00:37:57,849 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 40 transitions. [2024-10-25 00:37:57,850 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-10-25 00:37:57,850 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:37:57,850 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:37:57,851 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-25 00:37:57,852 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-10-25 00:37:57,852 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#1(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#3(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-10-25 00:37:57,852 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#1(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#1(~b.base, ~b.offset, 4); 1794#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(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#3(~c.base, ~c.offset, 4); 1793#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~c.base, ~c.offset, 4); 1793#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~c.base, ~c.offset, 4); 1793#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~c.base, ~c.offset, 4); 1793#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~c.base, ~c.offset, 4); 1793#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~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#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(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#1(~b.base, ~b.offset, 4); 1794#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(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#3(~c.base, ~c.offset, 4); 1793#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~c.base, ~c.offset, 4); 1793#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~c.base, ~c.offset, 4); 1793#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~c.base, ~c.offset, 4); 1793#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~c.base, ~c.offset, 4); 1793#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~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#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(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#1(~b.base, ~b.offset, 4); 1794#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(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#3(~c.base, ~c.offset, 4); 1793#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~c.base, ~c.offset, 4); 1793#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~c.base, ~c.offset, 4); 1793#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~c.base, ~c.offset, 4); 1793#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~c.base, ~c.offset, 4); 1793#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~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#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(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#1(~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-10-25 00:37:57,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:57,853 INFO L85 PathProgramCache]: Analyzing trace with hash 49760, now seen corresponding path program 6 times [2024-10-25 00:37:57,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:57,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436369821] [2024-10-25 00:37:57,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:57,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:57,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:57,863 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:37:57,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:37:57,868 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:37:57,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:37:57,868 INFO L85 PathProgramCache]: Analyzing trace with hash -11960144, now seen corresponding path program 4 times [2024-10-25 00:37:57,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:37:57,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575560918] [2024-10-25 00:37:57,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:37:57,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:37:57,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:58,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:58,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:59,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:59,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:59,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:59,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:59,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:59,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:59,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:59,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:59,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:59,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:59,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:59,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:59,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-25 00:37:59,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:59,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:59,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:59,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:59,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:59,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:59,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:59,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:59,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:59,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:59,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:59,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:59,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:59,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-25 00:37:59,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:59,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:59,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:37:59,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:37:59,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:00,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:00,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:00,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:00,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-25 00:38:00,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:00,029 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 14 proven. 307 refuted. 0 times theorem prover too weak. 429 trivial. 0 not checked. [2024-10-25 00:38:00,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:38:00,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575560918] [2024-10-25 00:38:00,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575560918] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 00:38:00,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417140419] [2024-10-25 00:38:00,033 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-25 00:38:00,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 00:38:00,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:00,036 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-10-25 00:38:00,043 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-10-25 00:38:00,230 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-25 00:38:00,230 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-25 00:38:00,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 681 conjuncts, 100 conjuncts are in the unsatisfiable core [2024-10-25 00:38:00,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:38:00,270 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-10-25 00:38:00,709 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 346 proven. 35 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2024-10-25 00:38:00,709 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 00:38:03,180 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 6 proven. 414 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2024-10-25 00:38:03,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417140419] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 00:38:03,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 00:38:03,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 26] total 45 [2024-10-25 00:38:03,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794274583] [2024-10-25 00:38:03,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 00:38:03,183 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-25 00:38:03,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:38:03,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-10-25 00:38:03,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=1641, Unknown=0, NotChecked=0, Total=1980 [2024-10-25 00:38:03,185 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-10-25 00:38:03,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:38:03,696 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2024-10-25 00:38:03,696 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 42 transitions. [2024-10-25 00:38:03,697 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-10-25 00:38:03,698 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 42 transitions. [2024-10-25 00:38:03,698 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2024-10-25 00:38:03,699 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2024-10-25 00:38:03,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 42 transitions. [2024-10-25 00:38:03,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:38:03,699 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 42 transitions. [2024-10-25 00:38:03,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 42 transitions. [2024-10-25 00:38:03,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-25 00:38:03,703 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-10-25 00:38:03,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2024-10-25 00:38:03,704 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 42 transitions. [2024-10-25 00:38:03,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-25 00:38:03,705 INFO L425 stractBuchiCegarLoop]: Abstraction has 38 states and 42 transitions. [2024-10-25 00:38:03,705 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-25 00:38:03,705 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 42 transitions. [2024-10-25 00:38:03,706 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-10-25 00:38:03,706 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:38:03,706 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:38:03,709 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-25 00:38:03,709 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-10-25 00:38:03,710 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#1(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#3(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-10-25 00:38:03,710 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#1(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#1(~b.base, ~b.offset, 4); 3160#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(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#3(~c.base, ~c.offset, 4); 3158#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~c.base, ~c.offset, 4); 3158#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~c.base, ~c.offset, 4); 3158#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~c.base, ~c.offset, 4); 3158#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~c.base, ~c.offset, 4); 3158#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~c.base, ~c.offset, 4); 3158#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~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#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(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#1(~b.base, ~b.offset, 4); 3160#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(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#3(~c.base, ~c.offset, 4); 3158#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~c.base, ~c.offset, 4); 3158#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~c.base, ~c.offset, 4); 3158#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~c.base, ~c.offset, 4); 3158#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~c.base, ~c.offset, 4); 3158#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~c.base, ~c.offset, 4); 3158#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~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#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(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#1(~b.base, ~b.offset, 4); 3160#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(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#3(~c.base, ~c.offset, 4); 3158#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~c.base, ~c.offset, 4); 3158#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~c.base, ~c.offset, 4); 3158#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~c.base, ~c.offset, 4); 3158#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~c.base, ~c.offset, 4); 3158#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~c.base, ~c.offset, 4); 3158#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~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#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(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#1(~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-10-25 00:38:03,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:38:03,711 INFO L85 PathProgramCache]: Analyzing trace with hash 49760, now seen corresponding path program 7 times [2024-10-25 00:38:03,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:38:03,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543032525] [2024-10-25 00:38:03,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:38:03,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:38:03,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:38:03,719 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:38:03,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:38:03,724 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:38:03,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:38:03,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1552670328, now seen corresponding path program 5 times [2024-10-25 00:38:03,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:38:03,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063132393] [2024-10-25 00:38:03,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:38:03,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:38:03,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:04,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:04,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:05,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:05,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:05,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:05,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:05,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:05,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:05,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:05,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:05,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:05,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:05,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:05,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:05,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:05,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:05,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:38:05,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:05,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:05,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:05,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:05,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:05,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:05,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:05,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:05,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:05,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:05,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:05,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:05,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:05,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:05,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:05,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:38:05,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:05,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:05,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:05,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:05,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:05,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:05,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:05,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:05,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:05,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:05,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:05,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:05,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:05,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:05,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:05,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:38:05,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:05,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 1003 trivial. 0 not checked. [2024-10-25 00:38:05,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:38:05,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063132393] [2024-10-25 00:38:05,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063132393] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 00:38:05,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390890157] [2024-10-25 00:38:05,775 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-25 00:38:05,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 00:38:05,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:05,782 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-10-25 00:38:05,796 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-10-25 00:38:06,523 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2024-10-25 00:38:06,523 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-25 00:38:06,530 INFO L255 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-10-25 00:38:06,535 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:38:06,538 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-10-25 00:38:06,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1011 trivial. 0 not checked. [2024-10-25 00:38:06,770 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 00:38:08,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 993 trivial. 0 not checked. [2024-10-25 00:38:08,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390890157] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 00:38:08,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 00:38:08,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 18] total 34 [2024-10-25 00:38:08,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221344225] [2024-10-25 00:38:08,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 00:38:08,041 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-25 00:38:08,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:38:08,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-10-25 00:38:08,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=921, Unknown=0, NotChecked=0, Total=1122 [2024-10-25 00:38:08,042 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-10-25 00:38:08,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:38:08,452 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2024-10-25 00:38:08,452 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 46 transitions. [2024-10-25 00:38:08,453 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-10-25 00:38:08,454 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 46 transitions. [2024-10-25 00:38:08,454 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2024-10-25 00:38:08,454 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2024-10-25 00:38:08,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 46 transitions. [2024-10-25 00:38:08,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:38:08,455 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 46 transitions. [2024-10-25 00:38:08,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 46 transitions. [2024-10-25 00:38:08,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-25 00:38:08,458 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-10-25 00:38:08,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2024-10-25 00:38:08,459 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 46 transitions. [2024-10-25 00:38:08,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-25 00:38:08,460 INFO L425 stractBuchiCegarLoop]: Abstraction has 42 states and 46 transitions. [2024-10-25 00:38:08,460 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-25 00:38:08,460 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 46 transitions. [2024-10-25 00:38:08,463 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-10-25 00:38:08,464 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:38:08,464 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:38:08,466 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-25 00:38:08,467 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-10-25 00:38:08,467 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#1(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#3(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-10-25 00:38:08,467 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#1(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#1(~b.base, ~b.offset, 4); 4737#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(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#3(~c.base, ~c.offset, 4); 4736#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~c.base, ~c.offset, 4); 4736#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~c.base, ~c.offset, 4); 4736#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~c.base, ~c.offset, 4); 4736#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~c.base, ~c.offset, 4); 4736#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~c.base, ~c.offset, 4); 4736#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~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#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(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#1(~b.base, ~b.offset, 4); 4737#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(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#3(~c.base, ~c.offset, 4); 4736#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~c.base, ~c.offset, 4); 4736#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~c.base, ~c.offset, 4); 4736#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~c.base, ~c.offset, 4); 4736#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~c.base, ~c.offset, 4); 4736#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~c.base, ~c.offset, 4); 4736#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~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#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(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#1(~b.base, ~b.offset, 4); 4737#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(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#3(~c.base, ~c.offset, 4); 4736#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~c.base, ~c.offset, 4); 4736#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~c.base, ~c.offset, 4); 4736#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~c.base, ~c.offset, 4); 4736#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~c.base, ~c.offset, 4); 4736#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~c.base, ~c.offset, 4); 4736#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~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#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(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#1(~b.base, ~b.offset, 4); 4737#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(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#3(~c.base, ~c.offset, 4); 4736#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~c.base, ~c.offset, 4); 4736#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~c.base, ~c.offset, 4); 4736#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~c.base, ~c.offset, 4); 4736#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~c.base, ~c.offset, 4); 4736#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~c.base, ~c.offset, 4); 4736#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~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#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(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#1(~b.base, ~b.offset, 4); 4737#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(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#3(~c.base, ~c.offset, 4); 4736#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~c.base, ~c.offset, 4); 4736#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~c.base, ~c.offset, 4); 4736#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~c.base, ~c.offset, 4); 4736#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~c.base, ~c.offset, 4); 4736#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~c.base, ~c.offset, 4); 4736#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(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#3(~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#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(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#1(~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-10-25 00:38:08,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:38:08,468 INFO L85 PathProgramCache]: Analyzing trace with hash 49760, now seen corresponding path program 8 times [2024-10-25 00:38:08,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:38:08,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821933789] [2024-10-25 00:38:08,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:38:08,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:38:08,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:38:08,482 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:38:08,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:38:08,489 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:38:08,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:38:08,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1937132614, now seen corresponding path program 6 times [2024-10-25 00:38:08,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:38:08,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342249053] [2024-10-25 00:38:08,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:38:08,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:38:08,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:10,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:10,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:11,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:11,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:11,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:11,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:11,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:11,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:11,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:11,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:38:11,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:12,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:12,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:12,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:12,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:12,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:12,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:12,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:12,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:12,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:12,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:12,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:12,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:12,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:12,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:12,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:38:12,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:12,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:12,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:12,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:12,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:12,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:12,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:12,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:12,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:12,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:12,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:12,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:12,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:12,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:12,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:12,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:38:12,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:12,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:12,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:12,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:12,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:12,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:12,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:12,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:12,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:13,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:13,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:13,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:13,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:13,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:13,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:13,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:38:13,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:13,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:13,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:13,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:13,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:13,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:13,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:13,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:13,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:13,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:13,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:13,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:13,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:13,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-25 00:38:13,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:13,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-25 00:38:13,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:13,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2905 backedges. 16 proven. 35 refuted. 0 times theorem prover too weak. 2854 trivial. 0 not checked. [2024-10-25 00:38:13,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 00:38:13,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342249053] [2024-10-25 00:38:13,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342249053] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 00:38:13,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138349325] [2024-10-25 00:38:13,253 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-25 00:38:13,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 00:38:13,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:13,256 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-10-25 00:38:13,265 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-10-25 00:38:16,428 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2024-10-25 00:38:16,429 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-25 00:38:16,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 1133 conjuncts, 162 conjuncts are in the unsatisfiable core [2024-10-25 00:38:16,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:38:16,458 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-10-25 00:38:16,582 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-10-25 00:38:17,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2905 backedges. 942 proven. 83 refuted. 0 times theorem prover too weak. 1880 trivial. 0 not checked. [2024-10-25 00:38:17,313 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 00:38:22,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138349325] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 00:38:22,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-25 00:38:22,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 27] total 38 [2024-10-25 00:38:22,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536661516] [2024-10-25 00:38:22,614 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-25 00:38:22,614 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-25 00:38:22,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 00:38:22,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-10-25 00:38:22,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=2281, Unknown=0, NotChecked=0, Total=2550 [2024-10-25 00:38:22,616 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. cyclomatic complexity: 7 Second operand has 38 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 35 states have internal predecessors, (46), 11 states have call successors, (14), 5 states have call predecessors, (14), 20 states have return successors, (22), 20 states have call predecessors, (22), 10 states have call successors, (22) [2024-10-25 00:38:23,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-25 00:38:23,710 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2024-10-25 00:38:23,710 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 51 transitions. [2024-10-25 00:38:23,711 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-10-25 00:38:23,712 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 51 transitions. [2024-10-25 00:38:23,712 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2024-10-25 00:38:23,712 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2024-10-25 00:38:23,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 51 transitions. [2024-10-25 00:38:23,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-25 00:38:23,712 INFO L218 hiAutomatonCegarLoop]: Abstraction has 46 states and 51 transitions. [2024-10-25 00:38:23,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 51 transitions. [2024-10-25 00:38:23,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2024-10-25 00:38:23,719 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-10-25 00:38:23,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2024-10-25 00:38:23,720 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 48 transitions. [2024-10-25 00:38:23,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-25 00:38:23,723 INFO L425 stractBuchiCegarLoop]: Abstraction has 44 states and 48 transitions. [2024-10-25 00:38:23,724 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2024-10-25 00:38:23,724 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 48 transitions. [2024-10-25 00:38:23,724 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2024-10-25 00:38:23,724 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:38:23,724 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:38:23,730 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-25 00:38:23,730 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-10-25 00:38:23,730 INFO L745 eck$LassoCheckResult]: Stem: 6946#$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); 6942#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#1(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#3(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); 6927#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);< 6928#$Ultimate##0 [2024-10-25 00:38:23,731 INFO L747 eck$LassoCheckResult]: Loop: 6928#$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); 6945#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~b.base, ~b.offset, 4); 6931#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 6939#$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#1(~b.base, ~b.offset, 4); 6937#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 6935#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6933#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6936#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6934#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6933#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6936#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6934#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6933#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6936#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6934#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6933#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6936#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6934#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6933#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6936#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6934#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6933#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6936#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6934#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6933#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6936#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6943#L25-1 assume true; 6940#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6941#L25-1 assume true; 6969#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6968#L25-1 assume true; 6967#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6966#L25-1 assume true; 6965#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6964#L25-1 assume true; 6963#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6962#L25-1 assume true; 6961#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6955#L25-1 assume true; 6954#func_to_recursive_line_23_to_23_0EXIT >#64#return; 6938#L47-1 call #t~mem8 := read~int#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 6930#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 6939#$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#1(~b.base, ~b.offset, 4); 6937#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 6935#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6933#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6936#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6934#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6933#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6936#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6934#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6933#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6936#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6934#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6933#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6936#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6934#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6933#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6936#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6934#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6933#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6936#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6934#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6933#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6936#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6943#L25-1 assume true; 6940#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6941#L25-1 assume true; 6969#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6968#L25-1 assume true; 6967#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6966#L25-1 assume true; 6965#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6964#L25-1 assume true; 6963#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6962#L25-1 assume true; 6961#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6955#L25-1 assume true; 6954#func_to_recursive_line_23_to_23_0EXIT >#64#return; 6938#L47-1 call #t~mem8 := read~int#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 6930#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 6939#$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#1(~b.base, ~b.offset, 4); 6937#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 6935#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6933#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6936#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6934#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6933#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6936#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6934#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6933#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6936#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6934#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6933#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6936#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6934#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6933#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6936#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6934#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6933#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6936#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6934#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6933#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6936#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6943#L25-1 assume true; 6940#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6941#L25-1 assume true; 6969#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6968#L25-1 assume true; 6967#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6966#L25-1 assume true; 6965#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6964#L25-1 assume true; 6963#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6962#L25-1 assume true; 6961#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6955#L25-1 assume true; 6954#func_to_recursive_line_23_to_23_0EXIT >#64#return; 6938#L47-1 call #t~mem8 := read~int#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 6930#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 6939#$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#1(~b.base, ~b.offset, 4); 6937#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 6935#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6933#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6936#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6934#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6933#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6936#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6934#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6933#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6936#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6934#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6933#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6936#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6934#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6933#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6936#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6934#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6933#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6936#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6934#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6933#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6936#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6943#L25-1 assume true; 6940#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6941#L25-1 assume true; 6969#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6968#L25-1 assume true; 6967#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6966#L25-1 assume true; 6965#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6964#L25-1 assume true; 6963#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6962#L25-1 assume true; 6961#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6955#L25-1 assume true; 6954#func_to_recursive_line_23_to_23_0EXIT >#64#return; 6938#L47-1 call #t~mem8 := read~int#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 6930#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 6939#$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#1(~b.base, ~b.offset, 4); 6937#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 6935#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6933#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6936#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6934#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6933#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6936#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6934#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6933#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6936#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6934#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6933#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6936#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6934#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6933#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6936#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6934#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6933#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6936#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6934#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6933#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6936#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6943#L25-1 assume true; 6940#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6941#L25-1 assume true; 6969#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6968#L25-1 assume true; 6967#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6966#L25-1 assume true; 6965#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6964#L25-1 assume true; 6963#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6962#L25-1 assume true; 6961#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6955#L25-1 assume true; 6954#func_to_recursive_line_23_to_23_0EXIT >#64#return; 6938#L47-1 call #t~mem8 := read~int#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 6930#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 6939#$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#1(~b.base, ~b.offset, 4); 6937#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 6935#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6933#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6936#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6934#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6933#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6936#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6934#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6933#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6936#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6934#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6933#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6936#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6934#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6933#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6936#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6934#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6933#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6936#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 6934#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 6933#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 6936#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 6943#L25-1 assume true; 6940#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6941#L25-1 assume true; 6969#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6968#L25-1 assume true; 6967#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6966#L25-1 assume true; 6965#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6964#L25-1 assume true; 6963#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6962#L25-1 assume true; 6961#func_to_recursive_line_23_to_23_0EXIT >#62#return; 6955#L25-1 assume true; 6954#func_to_recursive_line_23_to_23_0EXIT >#64#return; 6938#L47-1 call #t~mem8 := read~int#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 6930#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 6939#$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#1(~b.base, ~b.offset, 4); 6937#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 6929#L41-1 assume true; 6932#func_to_recursive_line_22_to_23_0EXIT >#66#return; 6944#L41-1 assume true; 6960#func_to_recursive_line_22_to_23_0EXIT >#66#return; 6959#L41-1 assume true; 6958#func_to_recursive_line_22_to_23_0EXIT >#66#return; 6957#L41-1 assume true; 6956#func_to_recursive_line_22_to_23_0EXIT >#66#return; 6953#L41-1 assume true; 6952#func_to_recursive_line_22_to_23_0EXIT >#66#return; 6951#L41-1 assume true; 6950#func_to_recursive_line_22_to_23_0EXIT >#66#return; 6949#L41-1 assume true; 6948#func_to_recursive_line_22_to_23_0EXIT >#70#return; 6947#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; 6926#L72 call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);< 6928#$Ultimate##0 [2024-10-25 00:38:23,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:38:23,731 INFO L85 PathProgramCache]: Analyzing trace with hash 49760, now seen corresponding path program 9 times [2024-10-25 00:38:23,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:38:23,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698354783] [2024-10-25 00:38:23,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:38:23,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:38:23,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:38:23,743 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:38:23,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:38:23,750 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:38:23,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:38:23,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1363312666, now seen corresponding path program 7 times [2024-10-25 00:38:23,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:38:23,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701266022] [2024-10-25 00:38:23,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:38:23,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:38:23,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:38:23,929 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:38:23,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:38:24,046 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:38:24,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:38:24,046 INFO L85 PathProgramCache]: Analyzing trace with hash -993962585, now seen corresponding path program 1 times [2024-10-25 00:38:24,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:38:24,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10894534] [2024-10-25 00:38:24,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:38:24,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:38:24,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:38:24,131 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:38:24,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:38:24,229 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:38:35,636 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:38:35,637 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:38:35,637 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:38:35,638 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:38:35,638 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-25 00:38:35,638 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:35,638 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:38:35,638 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:38:35,638 INFO L132 ssoRankerPreferences]: Filename of dumped script: recursified_nested_3.c_Iteration9_Lasso [2024-10-25 00:38:35,638 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:38:35,639 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:38:35,655 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:35,661 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:35,663 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:35,665 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:36,411 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:36,413 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:36,415 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:36,417 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:36,419 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:36,420 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:36,422 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:36,424 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:36,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:36,427 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:36,437 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:36,439 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:36,441 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:36,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:36,445 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:36,446 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:36,448 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:36,970 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:38:36,974 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-25 00:38:36,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:36,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:36,985 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-10-25 00:38:36,986 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-10-25 00:38:36,989 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:38:37,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:38:37,007 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:38:37,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:38:37,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:38:37,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:38:37,010 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:38:37,010 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:38:37,014 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:38:37,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-10-25 00:38:37,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:37,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:37,034 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-10-25 00:38:37,035 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-10-25 00:38:37,037 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:38:37,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:38:37,053 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:38:37,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:38:37,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:38:37,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:38:37,054 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:38:37,054 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:38:37,059 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:38:37,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-10-25 00:38:37,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:37,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:37,082 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-10-25 00:38:37,083 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-10-25 00:38:37,085 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:38:37,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:38:37,098 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:38:37,099 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:38:37,099 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:38:37,099 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:38:37,099 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:38:37,099 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:38:37,101 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:38:37,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-10-25 00:38:37,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:37,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:37,117 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-10-25 00:38:37,119 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-10-25 00:38:37,120 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:38:37,133 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:38:37,133 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:38:37,133 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:38:37,133 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:38:37,136 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:38:37,136 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:38:37,139 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:38:37,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-10-25 00:38:37,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:37,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:37,156 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-10-25 00:38:37,157 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-10-25 00:38:37,159 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:38:37,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:38:37,172 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:38:37,172 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:38:37,172 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:38:37,175 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:38:37,175 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:38:37,181 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-25 00:38:37,204 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2024-10-25 00:38:37,205 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2024-10-25 00:38:37,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:37,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:37,209 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-10-25 00:38:37,210 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-10-25 00:38:37,214 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-25 00:38:37,231 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-25 00:38:37,232 INFO L474 LassoAnalysis]: Proved termination. [2024-10-25 00:38:37,233 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-10-25 00:38:37,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-10-25 00:38:37,355 INFO L156 tatePredicateManager]: 18 out of 18 supporting invariants were superfluous and have been removed [2024-10-25 00:38:37,371 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#2 [2024-10-25 00:38:37,372 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#2,GLOBAL] [2024-10-25 00:38:37,373 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[#in~a!base,]]] [2024-10-25 00:38:37,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:38:37,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:37,423 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-25 00:38:37,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:38:38,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:38,270 INFO L255 TraceCheckSpWp]: Trace formula consists of 2940 conjuncts, 117 conjuncts are in the unsatisfiable core [2024-10-25 00:38:38,282 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:38:39,547 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-10-25 00:38:39,568 INFO L134 CoverageAnalysis]: Checked inductivity of 4203 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4203 trivial. 0 not checked. [2024-10-25 00:38:39,573 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-10-25 00:38:39,574 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-10-25 00:38:39,787 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-10-25 00:38:39,788 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-10-25 00:38:39,789 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-10-25 00:38:39,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2024-10-25 00:38:39,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 3 letters. Loop has 255 letters. [2024-10-25 00:38:39,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:38:39,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 258 letters. Loop has 255 letters. [2024-10-25 00:38:39,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:38:39,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 3 letters. Loop has 510 letters. [2024-10-25 00:38:39,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:38:39,813 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 131 states and 145 transitions. [2024-10-25 00:38:39,816 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-10-25 00:38:39,819 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 131 states to 87 states and 99 transitions. [2024-10-25 00:38:39,822 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2024-10-25 00:38:39,822 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2024-10-25 00:38:39,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 99 transitions. [2024-10-25 00:38:39,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:38:39,822 INFO L218 hiAutomatonCegarLoop]: Abstraction has 87 states and 99 transitions. [2024-10-25 00:38:39,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 99 transitions. [2024-10-25 00:38:39,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 74. [2024-10-25 00:38:39,832 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-10-25 00:38:39,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2024-10-25 00:38:39,833 INFO L240 hiAutomatonCegarLoop]: Abstraction has 74 states and 83 transitions. [2024-10-25 00:38:39,833 INFO L425 stractBuchiCegarLoop]: Abstraction has 74 states and 83 transitions. [2024-10-25 00:38:39,834 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2024-10-25 00:38:39,834 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 83 transitions. [2024-10-25 00:38:39,834 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2024-10-25 00:38:39,836 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:38:39,836 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:38:39,836 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-10-25 00:38:39,837 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:38:39,837 INFO L745 eck$LassoCheckResult]: Stem: 8029#$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); 8016#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#1(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#3(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); 7991#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);< 7993#$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); 8028#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~b.base, ~b.offset, 4); 8008#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 8014#$Ultimate##0 [2024-10-25 00:38:39,838 INFO L747 eck$LassoCheckResult]: Loop: 8014#$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#1(~b.base, ~b.offset, 4); 8007#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 8000#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7998#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 8001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 7999#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7998#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 8001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 7999#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7998#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 8001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 7999#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7998#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 8001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 7999#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7998#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 8001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 7999#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7998#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 8001#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 7999#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 7998#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 8001#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8021#L25-1 assume true; 8017#func_to_recursive_line_23_to_23_0EXIT >#62#return; 8018#L25-1 assume true; 8053#func_to_recursive_line_23_to_23_0EXIT >#62#return; 8052#L25-1 assume true; 8051#func_to_recursive_line_23_to_23_0EXIT >#62#return; 8050#L25-1 assume true; 8049#func_to_recursive_line_23_to_23_0EXIT >#62#return; 8048#L25-1 assume true; 8047#func_to_recursive_line_23_to_23_0EXIT >#62#return; 8046#L25-1 assume true; 8045#func_to_recursive_line_23_to_23_0EXIT >#62#return; 8044#L25-1 assume true; 8043#func_to_recursive_line_23_to_23_0EXIT >#64#return; 8012#L47-1 call #t~mem8 := read~int#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 8009#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 8014#$Ultimate##0 [2024-10-25 00:38:39,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:38:39,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1482449922, now seen corresponding path program 1 times [2024-10-25 00:38:39,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:38:39,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061890596] [2024-10-25 00:38:39,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:38:39,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:38:39,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:38:39,866 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:38:39,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:38:39,901 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:38:39,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:38:39,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1388529776, now seen corresponding path program 1 times [2024-10-25 00:38:39,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:38:39,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007017174] [2024-10-25 00:38:39,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:38:39,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:38:39,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:38:39,949 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:38:39,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:38:39,980 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:38:39,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:38:39,985 INFO L85 PathProgramCache]: Analyzing trace with hash -292174737, now seen corresponding path program 1 times [2024-10-25 00:38:39,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:38:39,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34047908] [2024-10-25 00:38:39,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:38:39,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:38:40,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:38:40,028 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:38:40,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:38:40,071 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:38:42,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-10-25 00:38:43,920 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:38:43,920 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:38:43,920 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:38:43,920 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:38:43,921 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-25 00:38:43,921 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:43,921 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:38:43,921 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:38:43,921 INFO L132 ssoRankerPreferences]: Filename of dumped script: recursified_nested_3.c_Iteration10_Lasso [2024-10-25 00:38:43,921 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:38:43,921 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:38:43,927 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:43,932 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:43,939 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:43,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:43,949 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:43,950 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:43,958 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:43,960 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:43,961 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:43,963 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:43,964 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:43,966 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:43,967 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:43,968 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:43,969 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:43,971 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:43,981 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:43,983 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:43,985 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:43,986 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:43,988 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:43,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:43,992 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:43,993 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:43,995 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:43,996 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:43,998 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:43,999 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:44,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:44,559 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:44,562 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:44,996 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:38:44,997 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-25 00:38:44,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:44,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:44,999 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-10-25 00:38:45,001 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-10-25 00:38:45,003 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:38:45,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:38:45,016 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:38:45,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:38:45,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:38:45,016 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:38:45,017 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:38:45,017 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:38:45,018 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:38:45,035 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-10-25 00:38:45,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:45,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:45,042 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-10-25 00:38:45,046 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-10-25 00:38:45,047 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:38:45,059 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:38:45,060 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:38:45,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:38:45,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:38:45,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:38:45,061 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:38:45,061 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:38:45,062 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:38:45,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-10-25 00:38:45,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:45,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:45,081 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-10-25 00:38:45,083 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-10-25 00:38:45,084 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:38:45,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:38:45,098 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:38:45,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:38:45,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:38:45,099 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:38:45,103 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:38:45,104 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:38:45,108 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:38:45,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2024-10-25 00:38:45,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:45,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:45,129 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-10-25 00:38:45,131 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-10-25 00:38:45,132 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:38:45,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:38:45,145 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:38:45,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:38:45,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:38:45,146 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:38:45,146 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:38:45,146 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:38:45,148 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:38:45,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-10-25 00:38:45,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:45,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:45,168 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-10-25 00:38:45,169 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-10-25 00:38:45,170 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:38:45,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:38:45,184 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:38:45,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:38:45,185 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:38:45,185 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:38:45,186 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:38:45,186 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:38:45,188 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:38:45,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-10-25 00:38:45,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:45,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:45,207 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-10-25 00:38:45,208 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-10-25 00:38:45,209 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:38:45,221 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:38:45,222 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:38:45,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:38:45,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:38:45,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:38:45,223 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:38:45,227 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:38:45,229 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:38:45,260 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-10-25 00:38:45,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:45,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:45,266 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-10-25 00:38:45,269 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-10-25 00:38:45,273 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:38:45,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:38:45,297 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:38:45,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:38:45,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:38:45,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:38:45,298 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:38:45,302 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:38:45,303 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:38:45,334 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-10-25 00:38:45,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:45,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:45,337 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-10-25 00:38:45,339 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-10-25 00:38:45,341 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:38:45,354 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:38:45,354 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:38:45,354 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:38:45,354 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:38:45,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:38:45,355 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:38:45,355 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:38:45,356 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:38:45,375 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-10-25 00:38:45,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:45,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:45,378 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-10-25 00:38:45,379 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-10-25 00:38:45,381 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:38:45,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:38:45,394 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:38:45,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:38:45,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:38:45,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:38:45,395 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:38:45,395 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:38:45,396 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:38:45,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-10-25 00:38:45,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:45,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:45,414 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-10-25 00:38:45,416 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-10-25 00:38:45,417 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:38:45,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:38:45,430 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:38:45,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:38:45,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:38:45,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:38:45,431 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:38:45,431 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:38:45,432 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:38:45,448 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-10-25 00:38:45,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:45,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:45,450 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-10-25 00:38:45,451 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-10-25 00:38:45,453 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:38:45,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:38:45,466 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:38:45,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:38:45,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:38:45,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:38:45,467 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:38:45,467 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:38:45,468 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:38:45,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2024-10-25 00:38:45,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:45,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:45,486 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-10-25 00:38:45,487 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-10-25 00:38:45,490 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:38:45,503 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:38:45,503 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:38:45,503 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:38:45,503 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:38:45,503 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:38:45,504 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:38:45,504 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:38:45,505 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:38:45,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2024-10-25 00:38:45,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:45,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:45,528 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-10-25 00:38:45,530 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-10-25 00:38:45,531 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:38:45,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:38:45,544 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:38:45,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:38:45,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:38:45,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:38:45,544 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:38:45,544 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:38:45,546 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:38:45,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2024-10-25 00:38:45,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:45,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:45,562 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-10-25 00:38:45,563 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-10-25 00:38:45,565 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:38:45,579 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:38:45,579 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:38:45,579 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:38:45,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:38:45,583 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:38:45,584 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:38:45,588 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:38:45,604 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-10-25 00:38:45,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:45,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:45,607 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-10-25 00:38:45,608 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-10-25 00:38:45,609 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:38:45,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:38:45,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:38:45,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:38:45,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:38:45,623 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:38:45,623 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:38:45,626 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:38:45,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2024-10-25 00:38:45,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:45,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:45,643 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-10-25 00:38:45,644 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-10-25 00:38:45,645 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:38:45,658 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:38:45,658 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:38:45,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:38:45,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:38:45,659 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:38:45,659 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:38:45,659 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:38:45,660 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:38:45,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2024-10-25 00:38:45,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:45,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:45,678 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-10-25 00:38:45,680 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-10-25 00:38:45,681 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:38:45,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:38:45,693 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:38:45,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:38:45,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:38:45,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:38:45,694 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:38:45,694 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:38:45,695 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:38:45,710 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-10-25 00:38:45,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:45,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:45,712 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-10-25 00:38:45,713 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-10-25 00:38:45,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-10-25 00:38:45,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:38:45,727 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:38:45,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:38:45,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:38:45,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:38:45,728 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:38:45,728 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:38:45,730 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:38:45,745 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-10-25 00:38:45,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:45,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:45,748 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-10-25 00:38:45,749 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-10-25 00:38:45,750 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:38:45,763 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:38:45,763 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:38:45,763 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:38:45,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:38:45,763 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:38:45,764 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:38:45,764 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:38:45,765 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:38:45,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2024-10-25 00:38:45,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:45,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:45,782 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-10-25 00:38:45,783 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-10-25 00:38:45,784 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:38:45,796 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:38:45,796 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:38:45,797 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:38:45,797 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:38:45,797 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:38:45,797 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:38:45,797 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:38:45,799 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:38:45,813 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-10-25 00:38:45,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:45,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:45,820 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-10-25 00:38:45,821 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-10-25 00:38:45,823 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:38:45,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:38:45,849 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:38:45,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:38:45,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:38:45,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:38:45,849 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:38:45,849 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:38:45,852 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:38:45,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2024-10-25 00:38:45,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:45,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:45,870 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-10-25 00:38:45,872 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-10-25 00:38:45,873 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:38:45,885 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:38:45,885 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:38:45,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:38:45,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:38:45,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:38:45,886 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:38:45,887 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:38:45,888 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:38:45,904 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-10-25 00:38:45,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:45,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:45,908 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-10-25 00:38:45,909 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-10-25 00:38:45,910 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:38:45,922 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:38:45,923 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:38:45,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:38:45,923 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:38:45,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:38:45,923 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:38:45,923 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:38:45,925 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:38:45,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2024-10-25 00:38:45,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:45,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:45,942 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-10-25 00:38:45,943 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-10-25 00:38:45,944 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:38:45,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:38:45,956 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:38:45,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:38:45,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:38:45,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:38:45,957 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:38:45,957 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:38:45,959 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:38:45,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2024-10-25 00:38:45,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:45,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:45,976 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-10-25 00:38:45,977 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-10-25 00:38:45,978 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:38:45,991 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:38:45,991 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:38:45,991 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:38:45,991 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:38:45,991 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:38:45,992 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:38:45,992 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:38:45,993 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:38:46,009 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-10-25 00:38:46,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:46,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:46,012 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-10-25 00:38:46,013 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-10-25 00:38:46,014 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:38:46,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:38:46,027 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:38:46,027 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:38:46,027 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:38:46,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:38:46,028 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:38:46,028 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:38:46,029 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:38:46,045 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-10-25 00:38:46,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:46,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:46,050 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-10-25 00:38:46,053 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-10-25 00:38:46,053 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:38:46,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:38:46,068 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:38:46,068 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:38:46,068 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:38:46,073 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:38:46,073 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:38:46,083 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-25 00:38:46,109 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2024-10-25 00:38:46,109 INFO L444 ModelExtractionUtils]: 3 out of 16 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-10-25 00:38:46,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:46,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:46,111 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-10-25 00:38:46,113 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-10-25 00:38:46,113 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-25 00:38:46,127 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-25 00:38:46,127 INFO L474 LassoAnalysis]: Proved termination. [2024-10-25 00:38:46,127 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 func_to_recursive_line_22_to_23_0_#in~b.base) 0)_1) = -2*v_rep(select (select #memory_int#1 func_to_recursive_line_22_to_23_0_#in~b.base) 0)_1 + 11 Supporting invariants [] [2024-10-25 00:38:46,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2024-10-25 00:38:46,178 INFO L156 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed [2024-10-25 00:38:46,180 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-25 00:38:46,181 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-25 00:38:46,181 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[#in~b!base,]]] [2024-10-25 00:38:46,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:38:46,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,232 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-25 00:38:46,233 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:38:46,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:46,429 INFO L255 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-25 00:38:46,432 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:38:46,960 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-10-25 00:38:47,029 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-10-25 00:38:47,030 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-10-25 00:38:47,030 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-10-25 00:38:47,725 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-10-25 00:38:47,728 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-10-25 00:38:47,728 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-10-25 00:38:47,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 20 transitions. [2024-10-25 00:38:47,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 20 transitions. Stem has 6 letters. Loop has 39 letters. [2024-10-25 00:38:47,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:38:47,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 20 transitions. Stem has 45 letters. Loop has 39 letters. [2024-10-25 00:38:47,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:38:47,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 20 transitions. Stem has 6 letters. Loop has 78 letters. [2024-10-25 00:38:47,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:38:47,730 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 254 states and 287 transitions. [2024-10-25 00:38:47,737 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2024-10-25 00:38:47,741 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 254 states to 155 states and 182 transitions. [2024-10-25 00:38:47,743 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2024-10-25 00:38:47,743 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2024-10-25 00:38:47,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 155 states and 182 transitions. [2024-10-25 00:38:47,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:38:47,743 INFO L218 hiAutomatonCegarLoop]: Abstraction has 155 states and 182 transitions. [2024-10-25 00:38:47,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states and 182 transitions. [2024-10-25 00:38:47,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 142. [2024-10-25 00:38:47,757 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-10-25 00:38:47,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 166 transitions. [2024-10-25 00:38:47,761 INFO L240 hiAutomatonCegarLoop]: Abstraction has 142 states and 166 transitions. [2024-10-25 00:38:47,761 INFO L425 stractBuchiCegarLoop]: Abstraction has 142 states and 166 transitions. [2024-10-25 00:38:47,761 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2024-10-25 00:38:47,761 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 142 states and 166 transitions. [2024-10-25 00:38:47,762 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2024-10-25 00:38:47,762 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:38:47,762 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:38:47,763 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:38:47,763 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-25 00:38:47,763 INFO L745 eck$LassoCheckResult]: Stem: 8614#$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); 8601#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#1(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#3(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); 8568#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);< 8570#$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); 8611#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~b.base, ~b.offset, 4); 8589#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 8604#$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#1(~b.base, ~b.offset, 4); 8587#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 8578#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 8575#$Ultimate##0 [2024-10-25 00:38:47,763 INFO L747 eck$LassoCheckResult]: Loop: 8575#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 8577#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 8576#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 8575#$Ultimate##0 [2024-10-25 00:38:47,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:38:47,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1483069382, now seen corresponding path program 1 times [2024-10-25 00:38:47,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:38:47,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716289300] [2024-10-25 00:38:47,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:38:47,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:38:47,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:38:47,779 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:38:47,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:38:47,790 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:38:47,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:38:47,791 INFO L85 PathProgramCache]: Analyzing trace with hash 29945, now seen corresponding path program 1 times [2024-10-25 00:38:47,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:38:47,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456635611] [2024-10-25 00:38:47,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:38:47,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:38:47,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:38:47,797 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:38:47,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:38:47,801 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:38:47,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:38:47,802 INFO L85 PathProgramCache]: Analyzing trace with hash 208614944, now seen corresponding path program 1 times [2024-10-25 00:38:47,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:38:47,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482682279] [2024-10-25 00:38:47,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:38:47,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:38:47,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:38:47,815 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:38:47,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:38:47,825 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:38:50,047 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:38:50,047 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:38:50,047 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:38:50,047 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:38:50,047 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-25 00:38:50,047 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:50,048 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:38:50,048 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:38:50,048 INFO L132 ssoRankerPreferences]: Filename of dumped script: recursified_nested_3.c_Iteration11_Lasso [2024-10-25 00:38:50,048 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:38:50,048 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:38:50,050 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:50,052 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:50,055 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:50,057 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:50,059 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:50,061 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:50,063 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:50,065 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:50,067 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:50,069 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:50,070 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:50,072 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:50,076 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:50,080 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:50,081 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:50,083 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:50,085 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:50,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:50,425 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:50,427 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:50,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:50,440 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:50,442 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:50,443 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:50,445 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:50,447 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:50,449 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:50,450 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:50,452 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:50,454 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:50,456 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:50,457 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:50,459 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:50,461 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:50,464 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:50,466 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:50,468 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:50,470 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:50,471 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:50,819 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:38:50,820 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-25 00:38:50,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:50,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:50,822 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-10-25 00:38:50,823 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-10-25 00:38:50,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-10-25 00:38:50,837 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:38:50,837 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:38:50,837 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:38:50,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:38:50,837 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:38:50,838 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:38:50,838 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:38:50,840 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:38:50,854 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-10-25 00:38:50,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:50,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:50,857 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-10-25 00:38:50,858 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-10-25 00:38:50,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-10-25 00:38:50,870 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:38:50,871 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:38:50,871 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:38:50,871 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:38:50,871 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:38:50,871 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:38:50,871 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:38:50,873 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:38:50,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2024-10-25 00:38:50,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:50,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:50,889 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-10-25 00:38:50,891 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-10-25 00:38:50,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-10-25 00:38:50,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:38:50,907 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:38:50,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:38:50,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:38:50,907 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:38:50,908 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:38:50,908 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:38:50,909 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:38:50,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2024-10-25 00:38:50,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:50,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:50,926 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-10-25 00:38:50,927 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-10-25 00:38:50,928 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:38:50,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:38:50,941 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:38:50,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:38:50,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:38:50,942 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:38:50,942 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:38:50,942 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:38:50,943 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:38:50,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2024-10-25 00:38:50,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:50,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:50,961 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-10-25 00:38:50,963 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-10-25 00:38:50,964 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:38:50,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:38:50,979 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:38:50,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:38:50,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:38:50,979 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:38:50,980 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:38:50,980 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:38:50,981 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:38:51,006 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-10-25 00:38:51,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:51,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:51,009 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-10-25 00:38:51,010 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-10-25 00:38:51,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-10-25 00:38:51,025 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:38:51,026 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:38:51,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:38:51,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:38:51,026 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:38:51,026 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:38:51,026 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:38:51,028 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:38:51,042 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-10-25 00:38:51,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:51,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:51,047 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-10-25 00:38:51,049 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-10-25 00:38:51,050 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:38:51,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:38:51,064 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:38:51,064 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:38:51,064 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:38:51,064 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:38:51,064 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:38:51,064 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:38:51,066 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:38:51,082 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-10-25 00:38:51,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:51,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:51,085 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-10-25 00:38:51,189 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-10-25 00:38:51,190 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:38:51,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2024-10-25 00:38:51,203 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:38:51,203 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:38:51,203 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:38:51,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:38:51,204 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:38:51,204 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:38:51,204 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:38:51,205 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:38:51,221 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-10-25 00:38:51,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:51,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:51,223 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-10-25 00:38:51,225 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-10-25 00:38:51,225 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:38:51,238 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:38:51,238 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:38:51,238 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:38:51,238 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:38:51,238 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:38:51,239 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:38:51,239 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:38:51,240 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:38:51,256 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-10-25 00:38:51,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:51,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:51,259 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-10-25 00:38:51,260 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-10-25 00:38:51,261 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:38:51,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:38:51,274 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:38:51,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:38:51,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:38:51,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:38:51,275 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:38:51,275 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:38:51,276 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:38:51,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2024-10-25 00:38:51,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:51,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:51,294 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-10-25 00:38:51,295 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-10-25 00:38:51,296 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:38:51,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:38:51,309 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:38:51,309 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:38:51,309 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:38:51,309 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:38:51,310 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:38:51,310 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:38:51,312 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:38:51,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2024-10-25 00:38:51,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:51,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:51,329 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-10-25 00:38:51,330 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-10-25 00:38:51,332 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:38:51,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:38:51,345 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:38:51,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:38:51,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:38:51,345 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:38:51,345 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:38:51,345 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:38:51,347 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:38:51,363 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-10-25 00:38:51,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:51,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:51,367 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-10-25 00:38:51,368 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-10-25 00:38:51,369 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:38:51,383 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:38:51,383 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:38:51,383 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:38:51,383 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:38:51,383 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:38:51,384 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:38:51,384 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:38:51,385 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:38:51,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2024-10-25 00:38:51,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:51,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:51,403 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-10-25 00:38:51,405 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-10-25 00:38:51,405 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:38:51,418 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:38:51,418 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:38:51,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:38:51,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:38:51,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:38:51,419 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:38:51,419 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:38:51,420 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:38:51,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2024-10-25 00:38:51,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:51,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:51,437 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-10-25 00:38:51,439 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-10-25 00:38:51,441 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:38:51,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:38:51,454 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:38:51,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:38:51,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:38:51,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:38:51,454 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:38:51,454 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:38:51,456 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:38:51,470 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-10-25 00:38:51,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:51,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:51,473 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-10-25 00:38:51,474 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-10-25 00:38:51,475 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:38:51,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:38:51,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:38:51,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:38:51,489 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:38:51,490 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:38:51,490 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:38:51,492 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:38:51,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2024-10-25 00:38:51,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:51,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:51,510 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-10-25 00:38:51,512 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-10-25 00:38:51,513 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:38:51,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:38:51,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:38:51,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:38:51,526 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:38:51,527 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:38:51,527 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:38:51,530 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:38:51,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2024-10-25 00:38:51,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:51,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:51,547 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-10-25 00:38:51,548 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-10-25 00:38:51,549 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:38:51,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:38:51,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:38:51,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:38:51,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:38:51,563 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:38:51,563 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:38:51,566 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:38:51,580 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-10-25 00:38:51,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:51,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:51,583 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-10-25 00:38:51,584 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-10-25 00:38:51,585 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:38:51,597 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:38:51,597 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:38:51,597 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:38:51,597 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:38:51,599 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:38:51,599 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:38:51,602 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:38:51,617 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-10-25 00:38:51,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:51,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:51,619 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-10-25 00:38:51,621 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-10-25 00:38:51,621 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:38:51,634 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:38:51,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:38:51,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:38:51,634 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:38:51,635 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:38:51,636 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:38:51,639 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:38:51,653 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-10-25 00:38:51,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:51,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:51,655 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-10-25 00:38:51,656 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-10-25 00:38:51,658 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:38:51,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:38:51,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:38:51,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:38:51,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:38:51,672 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:38:51,672 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:38:51,676 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:38:51,691 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-10-25 00:38:51,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:51,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:51,694 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-10-25 00:38:51,695 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-10-25 00:38:51,696 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:38:51,708 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:38:51,708 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:38:51,708 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:38:51,708 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:38:51,711 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:38:51,711 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:38:51,714 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:38:51,728 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-10-25 00:38:51,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:51,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:51,730 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-10-25 00:38:51,731 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-10-25 00:38:51,733 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:38:51,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:38:51,745 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:38:51,745 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:38:51,745 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:38:51,746 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:38:51,746 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:38:51,748 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:38:51,763 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-10-25 00:38:51,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:51,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:51,765 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-10-25 00:38:51,767 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-10-25 00:38:51,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-10-25 00:38:51,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:38:51,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:38:51,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:38:51,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:38:51,785 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:38:51,786 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:38:51,798 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-25 00:38:51,815 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-10-25 00:38:51,815 INFO L444 ModelExtractionUtils]: 3 out of 16 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-10-25 00:38:51,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:51,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:51,817 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-10-25 00:38:51,819 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-10-25 00:38:51,821 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-25 00:38:51,835 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-25 00:38:51,835 INFO L474 LassoAnalysis]: Proved termination. [2024-10-25 00:38:51,835 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#3 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#3 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-10-25 00:38:51,853 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-10-25 00:38:51,899 INFO L156 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2024-10-25 00:38:51,901 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-25 00:38:51,901 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-25 00:38:51,901 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[#in~c!base,]]] [2024-10-25 00:38:51,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:38:51,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:51,952 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-25 00:38:51,955 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:38:51,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:51,979 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-25 00:38:51,980 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:38:51,999 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-10-25 00:38:52,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:38:52,015 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-10-25 00:38:52,016 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-10-25 00:38:52,075 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-10-25 00:38:52,076 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-10-25 00:38:52,077 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-10-25 00:38:52,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2024-10-25 00:38:52,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 9 letters. Loop has 3 letters. [2024-10-25 00:38:52,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:38:52,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 12 letters. Loop has 3 letters. [2024-10-25 00:38:52,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:38:52,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 9 letters. Loop has 6 letters. [2024-10-25 00:38:52,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:38:52,078 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 184 states and 223 transitions. [2024-10-25 00:38:52,080 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2024-10-25 00:38:52,082 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 184 states to 162 states and 200 transitions. [2024-10-25 00:38:52,082 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2024-10-25 00:38:52,082 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2024-10-25 00:38:52,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 162 states and 200 transitions. [2024-10-25 00:38:52,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:38:52,083 INFO L218 hiAutomatonCegarLoop]: Abstraction has 162 states and 200 transitions. [2024-10-25 00:38:52,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states and 200 transitions. [2024-10-25 00:38:52,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2024-10-25 00:38:52,091 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-10-25 00:38:52,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 200 transitions. [2024-10-25 00:38:52,093 INFO L240 hiAutomatonCegarLoop]: Abstraction has 162 states and 200 transitions. [2024-10-25 00:38:52,093 INFO L425 stractBuchiCegarLoop]: Abstraction has 162 states and 200 transitions. [2024-10-25 00:38:52,093 INFO L332 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2024-10-25 00:38:52,093 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 162 states and 200 transitions. [2024-10-25 00:38:52,095 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2024-10-25 00:38:52,095 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:38:52,095 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:38:52,096 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-10-25 00:38:52,096 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-25 00:38:52,096 INFO L745 eck$LassoCheckResult]: Stem: 9040#$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); 9025#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#1(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#3(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); 8989#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);< 8991#$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); 9037#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~b.base, ~b.offset, 4); 9030#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 9029#$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#1(~b.base, ~b.offset, 4); 9031#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 9057#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9058#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 9093#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 9062#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9090#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 9080#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 9063#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9090#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 9080#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 9063#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9090#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 9080#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 9063#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9090#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 9080#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 9063#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9090#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 9080#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 9063#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 9090#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 9086#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 9087#L25-1 assume true; 9099#func_to_recursive_line_23_to_23_0EXIT >#62#return; 9081#L25-1 assume true; 9079#func_to_recursive_line_23_to_23_0EXIT >#62#return; 9076#L25-1 assume true; 9075#func_to_recursive_line_23_to_23_0EXIT >#62#return; 9074#L25-1 assume true; 9073#func_to_recursive_line_23_to_23_0EXIT >#62#return; 9072#L25-1 assume true; 9071#func_to_recursive_line_23_to_23_0EXIT >#62#return; 9066#L25-1 assume true; 9061#func_to_recursive_line_23_to_23_0EXIT >#62#return; 9059#L25-1 assume true; 9055#func_to_recursive_line_23_to_23_0EXIT >#64#return; 9053#L47-1 call #t~mem8 := read~int#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 9011#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 9050#$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#1(~b.base, ~b.offset, 4); 9010#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 8997#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 8996#$Ultimate##0 [2024-10-25 00:38:52,096 INFO L747 eck$LassoCheckResult]: Loop: 8996#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 8999#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 8998#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 8996#$Ultimate##0 [2024-10-25 00:38:52,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:38:52,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1721128109, now seen corresponding path program 2 times [2024-10-25 00:38:52,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:38:52,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568112019] [2024-10-25 00:38:52,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:38:52,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:38:52,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:38:52,116 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:38:52,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:38:52,134 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:38:52,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:38:52,135 INFO L85 PathProgramCache]: Analyzing trace with hash 29945, now seen corresponding path program 2 times [2024-10-25 00:38:52,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:38:52,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866203241] [2024-10-25 00:38:52,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:38:52,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:38:52,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:38:52,142 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:38:52,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:38:52,147 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:38:52,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:38:52,147 INFO L85 PathProgramCache]: Analyzing trace with hash 807915725, now seen corresponding path program 3 times [2024-10-25 00:38:52,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:38:52,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017356243] [2024-10-25 00:38:52,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:38:52,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:38:52,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:38:52,168 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:38:52,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:38:52,188 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:38:56,166 INFO L204 LassoAnalysis]: Preferences: [2024-10-25 00:38:56,167 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-25 00:38:56,167 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-25 00:38:56,167 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-25 00:38:56,167 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-25 00:38:56,167 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:56,167 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-25 00:38:56,167 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-25 00:38:56,167 INFO L132 ssoRankerPreferences]: Filename of dumped script: recursified_nested_3.c_Iteration12_Lasso [2024-10-25 00:38:56,167 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-25 00:38:56,167 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-25 00:38:56,169 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:56,172 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:56,174 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:56,586 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:56,588 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:56,590 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:56,592 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:56,593 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:56,595 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:56,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:56,598 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:56,600 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:56,602 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:56,613 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:56,615 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:56,617 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:56,618 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:56,620 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:56,622 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:56,623 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:56,625 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:56,626 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:56,628 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:56,629 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:56,631 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:56,632 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:56,634 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:56,636 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:56,637 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:56,639 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:56,640 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:56,642 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:56,646 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:56,648 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:56,650 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:56,651 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:56,653 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:56,658 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:56,660 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:56,662 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:56,663 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-25 00:38:57,004 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-25 00:38:57,005 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-25 00:38:57,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:57,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:57,007 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-10-25 00:38:57,008 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-10-25 00:38:57,009 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:38:57,022 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:38:57,022 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:38:57,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:38:57,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:38:57,023 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:38:57,023 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:38:57,023 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:38:57,024 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:38:57,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2024-10-25 00:38:57,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:57,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:57,042 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-10-25 00:38:57,043 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-10-25 00:38:57,044 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:38:57,056 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:38:57,056 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-25 00:38:57,056 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:38:57,056 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:38:57,056 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:38:57,057 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-25 00:38:57,057 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-25 00:38:57,058 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:38:57,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2024-10-25 00:38:57,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:57,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:57,077 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-10-25 00:38:57,079 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-10-25 00:38:57,080 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:38:57,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:38:57,094 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:38:57,094 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:38:57,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:38:57,095 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:38:57,096 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:38:57,100 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:38:57,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2024-10-25 00:38:57,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:57,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:57,124 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-10-25 00:38:57,125 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-10-25 00:38:57,126 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:38:57,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:38:57,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:38:57,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:38:57,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:38:57,142 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:38:57,142 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:38:57,146 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:38:57,162 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-10-25 00:38:57,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:57,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:57,165 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-10-25 00:38:57,166 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-10-25 00:38:57,168 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:38:57,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:38:57,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:38:57,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:38:57,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:38:57,183 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:38:57,184 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:38:57,188 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-25 00:38:57,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2024-10-25 00:38:57,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:57,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:57,205 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-10-25 00:38:57,206 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-10-25 00:38:57,209 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-10-25 00:38:57,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-25 00:38:57,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-25 00:38:57,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-25 00:38:57,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-25 00:38:57,240 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-25 00:38:57,240 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-25 00:38:57,260 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-25 00:38:57,312 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2024-10-25 00:38:57,313 INFO L444 ModelExtractionUtils]: 3 out of 16 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-10-25 00:38:57,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-25 00:38:57,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-25 00:38:57,319 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-10-25 00:38:57,321 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-10-25 00:38:57,321 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-25 00:38:57,336 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-25 00:38:57,336 INFO L474 LassoAnalysis]: Proved termination. [2024-10-25 00:38:57,337 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#3 func_to_recursive_line_23_to_23_0_#in~c.base) 0)_2) = -2*v_rep(select (select #memory_int#3 func_to_recursive_line_23_to_23_0_#in~c.base) 0)_2 + 11 Supporting invariants [] [2024-10-25 00:38:57,352 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-10-25 00:38:57,392 INFO L156 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2024-10-25 00:38:57,395 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#3 [2024-10-25 00:38:57,395 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#3,GLOBAL] [2024-10-25 00:38:57,395 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#3,GLOBAL],[IdentifierExpression[#in~c!base,]]] [2024-10-25 00:38:57,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:38:57,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:57,528 INFO L255 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-25 00:38:57,530 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:38:58,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:58,039 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-25 00:38:58,040 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:38:58,075 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-10-25 00:38:58,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:38:58,101 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.7 stem predicates 3 loop predicates [2024-10-25 00:38:58,101 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 162 states and 200 transitions. cyclomatic complexity: 50 Second operand has 10 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 5 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-25 00:38:58,372 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 162 states and 200 transitions. cyclomatic complexity: 50. Second operand has 10 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 5 states have call successors, (7), 4 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 19 states. [2024-10-25 00:38:58,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 6 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-25 00:38:58,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 5 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-25 00:38:58,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2024-10-25 00:38:58,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 14 transitions. Stem has 48 letters. Loop has 3 letters. [2024-10-25 00:38:58,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:38:58,374 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-25 00:38:58,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:38:58,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:58,504 INFO L255 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-25 00:38:58,506 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:38:58,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:58,952 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-25 00:38:58,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:38:58,986 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-10-25 00:38:59,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:38:59,014 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.8 stem predicates 3 loop predicates [2024-10-25 00:38:59,014 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 162 states and 200 transitions. cyclomatic complexity: 50 Second operand has 11 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 6 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-25 00:38:59,263 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-10-25 00:38:59,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2024-10-25 00:38:59,433 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 162 states and 200 transitions. cyclomatic complexity: 50. Second operand has 11 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 6 states have call successors, (7), 4 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 20 states. [2024-10-25 00:38:59,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 7 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-25 00:38:59,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 6 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-25 00:38:59,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2024-10-25 00:38:59,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. Stem has 48 letters. Loop has 3 letters. [2024-10-25 00:38:59,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:38:59,435 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-25 00:38:59,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:38:59,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:59,566 INFO L255 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-25 00:38:59,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:38:59,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 00:38:59,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-25 00:38:59,976 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 00:39:00,007 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-10-25 00:39:00,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-25 00:39:00,035 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.8 stem predicates 3 loop predicates [2024-10-25 00:39:00,035 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 162 states and 200 transitions. cyclomatic complexity: 50 Second operand has 11 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 6 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-25 00:39:00,440 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 162 states and 200 transitions. cyclomatic complexity: 50. Second operand has 11 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 6 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 254 states and 295 transitions. Complement of second has 28 states. [2024-10-25 00:39:00,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 8 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-25 00:39:00,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 6 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-25 00:39:00,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 32 transitions. [2024-10-25 00:39:00,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 32 transitions. Stem has 48 letters. Loop has 3 letters. [2024-10-25 00:39:00,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:39:00,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 32 transitions. Stem has 51 letters. Loop has 3 letters. [2024-10-25 00:39:00,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:39:00,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 32 transitions. Stem has 48 letters. Loop has 6 letters. [2024-10-25 00:39:00,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-25 00:39:00,445 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 254 states and 295 transitions. [2024-10-25 00:39:00,450 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-25 00:39:00,458 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 254 states to 138 states and 167 transitions. [2024-10-25 00:39:00,459 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2024-10-25 00:39:00,459 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2024-10-25 00:39:00,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 138 states and 167 transitions. [2024-10-25 00:39:00,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-25 00:39:00,459 INFO L218 hiAutomatonCegarLoop]: Abstraction has 138 states and 167 transitions. [2024-10-25 00:39:00,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states and 167 transitions. [2024-10-25 00:39:00,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 118. [2024-10-25 00:39:00,473 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, (42), 30 states have call predecessors, (42), 17 states have call successors, (42) [2024-10-25 00:39:00,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 137 transitions. [2024-10-25 00:39:00,475 INFO L240 hiAutomatonCegarLoop]: Abstraction has 118 states and 137 transitions. [2024-10-25 00:39:00,475 INFO L425 stractBuchiCegarLoop]: Abstraction has 118 states and 137 transitions. [2024-10-25 00:39:00,475 INFO L332 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2024-10-25 00:39:00,475 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 118 states and 137 transitions. [2024-10-25 00:39:00,475 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-25 00:39:00,476 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-25 00:39:00,476 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-25 00:39:00,481 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-10-25 00:39:00,482 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2024-10-25 00:39:00,482 INFO L745 eck$LassoCheckResult]: Stem: 10448#$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); 10434#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#1(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#3(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); 10399#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);< 10401#$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); 10444#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~b.base, ~b.offset, 4); 10418#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 10440#$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#1(~b.base, ~b.offset, 4); 10441#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 10442#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10443#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10508#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10410#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10409#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10412#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10411#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10409#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10412#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10411#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10409#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10412#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10411#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10409#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10412#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10411#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10409#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10412#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10411#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10409#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10413#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10500#L25-1 assume true; 10495#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10494#L25-1 assume true; 10493#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10492#L25-1 assume true; 10491#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10489#L25-1 assume true; 10488#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10487#L25-1 assume true; 10486#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10474#L25-1 assume true; 10473#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10470#L25-1 assume true; 10466#func_to_recursive_line_23_to_23_0EXIT >#64#return; 10417#L47-1 call #t~mem8 := read~int#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 10419#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 10425#$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#1(~b.base, ~b.offset, 4); 10421#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 10423#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10443#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10508#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10410#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10409#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10412#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10411#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10409#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10412#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10411#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10409#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10412#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10411#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10409#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10412#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10411#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10409#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10412#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10411#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10409#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10413#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10500#L25-1 assume true; 10495#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10494#L25-1 assume true; 10493#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10492#L25-1 assume true; 10491#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10489#L25-1 assume true; 10488#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10487#L25-1 assume true; 10486#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10474#L25-1 assume true; 10473#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10470#L25-1 assume true; 10466#func_to_recursive_line_23_to_23_0EXIT >#64#return; 10467#L47-1 call #t~mem8 := read~int#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 10422#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 10425#$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#1(~b.base, ~b.offset, 4); 10421#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 10423#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10443#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10508#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10410#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10409#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10412#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10411#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10409#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10412#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10411#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10409#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10412#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10411#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10409#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10412#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10411#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10409#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10412#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10411#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10409#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10413#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10500#L25-1 assume true; 10495#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10494#L25-1 assume true; 10493#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10492#L25-1 assume true; 10491#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10489#L25-1 assume true; 10488#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10487#L25-1 assume true; 10486#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10474#L25-1 assume true; 10473#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10470#L25-1 assume true; 10466#func_to_recursive_line_23_to_23_0EXIT >#64#return; 10467#L47-1 call #t~mem8 := read~int#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 10422#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 10425#$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#1(~b.base, ~b.offset, 4); 10421#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 10423#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10443#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10508#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10410#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10409#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10412#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10411#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10409#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10412#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10411#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10409#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10412#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10411#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10409#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10412#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10411#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10409#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10412#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10411#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10409#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10413#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10500#L25-1 assume true; 10495#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10494#L25-1 assume true; 10493#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10492#L25-1 assume true; 10491#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10489#L25-1 assume true; 10488#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10487#L25-1 assume true; 10486#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10474#L25-1 assume true; 10473#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10470#L25-1 assume true; 10466#func_to_recursive_line_23_to_23_0EXIT >#64#return; 10467#L47-1 call #t~mem8 := read~int#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 10422#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 10425#$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#1(~b.base, ~b.offset, 4); 10421#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 10423#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10443#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10508#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10410#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10409#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10412#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10411#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10409#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10412#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10411#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10409#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10412#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10411#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10409#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10412#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10411#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10409#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10412#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10411#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10409#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10413#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10500#L25-1 assume true; 10495#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10494#L25-1 assume true; 10493#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10492#L25-1 assume true; 10491#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10489#L25-1 assume true; 10488#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10487#L25-1 assume true; 10486#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10474#L25-1 assume true; 10473#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10470#L25-1 assume true; 10466#func_to_recursive_line_23_to_23_0EXIT >#64#return; 10467#L47-1 call #t~mem8 := read~int#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 10422#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 10425#$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#1(~b.base, ~b.offset, 4); 10421#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 10423#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10443#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10508#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10410#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10409#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10412#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10411#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10409#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10412#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10411#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10409#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10412#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10411#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10409#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10412#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10411#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10409#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10412#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10411#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10409#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10413#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10500#L25-1 assume true; 10495#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10494#L25-1 assume true; 10493#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10492#L25-1 assume true; 10491#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10489#L25-1 assume true; 10488#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10487#L25-1 assume true; 10486#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10474#L25-1 assume true; 10473#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10470#L25-1 assume true; 10466#func_to_recursive_line_23_to_23_0EXIT >#64#return; 10467#L47-1 call #t~mem8 := read~int#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 10422#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 10425#$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#1(~b.base, ~b.offset, 4); 10471#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 10472#L41-1 assume true; 10484#func_to_recursive_line_22_to_23_0EXIT >#66#return; 10439#L41-1 assume true; 10464#func_to_recursive_line_22_to_23_0EXIT >#66#return; 10463#L41-1 assume true; 10462#func_to_recursive_line_22_to_23_0EXIT >#66#return; 10461#L41-1 assume true; 10460#func_to_recursive_line_22_to_23_0EXIT >#66#return; 10459#L41-1 assume true; 10458#func_to_recursive_line_22_to_23_0EXIT >#66#return; 10457#L41-1 assume true; 10456#func_to_recursive_line_22_to_23_0EXIT >#66#return; 10455#L41-1 assume true; 10454#func_to_recursive_line_22_to_23_0EXIT >#70#return; 10451#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; 10398#L72 call func_to_recursive_line_21_to_22_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset);< 10400#$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); 10446#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#1(0, ~b.base, ~b.offset, 4); 10415#L67 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 10424#$Ultimate##0 [2024-10-25 00:39:00,482 INFO L747 eck$LassoCheckResult]: Loop: 10424#$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#1(~b.base, ~b.offset, 4); 10420#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~c.base, ~c.offset, 4); 10407#L47 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10406#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10408#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10428#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10452#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10453#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10427#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10452#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10453#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10427#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10452#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10453#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10427#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10452#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10453#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10427#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10452#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10453#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~c.base, ~c.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~c.base, ~c.offset, 4);havoc #t~mem5;havoc #t~pre6; 10427#L32 call func_to_recursive_line_23_to_23_0(~c.base, ~c.offset);< 10452#$Ultimate##0 ~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem4 := read~int#3(~c.base, ~c.offset, 4); 10437#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 10435#L25-1 assume true; 10426#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10429#L25-1 assume true; 10515#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10514#L25-1 assume true; 10513#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10512#L25-1 assume true; 10511#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10510#L25-1 assume true; 10509#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10499#L25-1 assume true; 10498#func_to_recursive_line_23_to_23_0EXIT >#62#return; 10497#L25-1 assume true; 10496#func_to_recursive_line_23_to_23_0EXIT >#64#return; 10414#L47-1 call #t~mem8 := read~int#1(~b.base, ~b.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#1(1 + #t~mem8, ~b.base, ~b.offset, 4);havoc #t~mem8;havoc #t~pre9; 10416#L52 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~c.base, ~c.offset);< 10424#$Ultimate##0 [2024-10-25 00:39:00,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:39:00,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1634781349, now seen corresponding path program 2 times [2024-10-25 00:39:00,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:39:00,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150642192] [2024-10-25 00:39:00,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:39:00,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:39:00,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:39:00,596 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:39:00,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:39:00,694 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:39:00,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:39:00,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1388529776, now seen corresponding path program 2 times [2024-10-25 00:39:00,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:39:00,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540016473] [2024-10-25 00:39:00,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:39:00,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:39:00,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:39:00,709 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:39:00,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:39:00,722 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 00:39:00,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 00:39:00,723 INFO L85 PathProgramCache]: Analyzing trace with hash -350990602, now seen corresponding path program 3 times [2024-10-25 00:39:00,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 00:39:00,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379779710] [2024-10-25 00:39:00,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 00:39:00,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 00:39:00,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:39:00,816 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 00:39:00,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 00:39:00,921 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace