./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_141f42e4-a531-42d9-9606-9f4c9a5d8c05/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_141f42e4-a531-42d9-9606-9f4c9a5d8c05/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_141f42e4-a531-42d9-9606-9f4c9a5d8c05/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_141f42e4-a531-42d9-9606-9f4c9a5d8c05/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_141f42e4-a531-42d9-9606-9f4c9a5d8c05/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_141f42e4-a531-42d9-9606-9f4c9a5d8c05/bin/uautomizer-verify-VRDe98Ueme --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 c9dfd2bf12e8d041fe6d1d6bf651e6b1ba93f167a26b0485680374a443f598c5 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:56:04,221 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:56:04,352 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_141f42e4-a531-42d9-9606-9f4c9a5d8c05/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-Termination-32bit-Automizer_Default.epf [2023-11-26 11:56:04,363 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:56:04,364 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:56:04,401 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:56:04,403 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:56:04,403 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:56:04,405 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 11:56:04,410 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 11:56:04,411 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:56:04,411 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:56:04,412 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:56:04,414 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-26 11:56:04,414 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-26 11:56:04,415 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-26 11:56:04,415 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-26 11:56:04,416 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-26 11:56:04,416 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-26 11:56:04,417 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:56:04,417 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-26 11:56:04,418 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:56:04,419 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 11:56:04,419 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:56:04,419 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:56:04,420 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-26 11:56:04,420 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-26 11:56:04,421 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-26 11:56:04,421 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 11:56:04,422 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:56:04,423 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-26 11:56:04,424 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-26 11:56:04,424 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:56:04,424 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:56:04,425 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:56:04,425 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:56:04,425 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 11:56:04,426 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-26 11:56:04,426 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_141f42e4-a531-42d9-9606-9f4c9a5d8c05/bin/uautomizer-verify-VRDe98Ueme/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_141f42e4-a531-42d9-9606-9f4c9a5d8c05/bin/uautomizer-verify-VRDe98Ueme 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 -> c9dfd2bf12e8d041fe6d1d6bf651e6b1ba93f167a26b0485680374a443f598c5 [2023-11-26 11:56:04,674 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:56:04,698 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:56:04,701 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:56:04,702 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:56:04,703 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:56:04,704 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_141f42e4-a531-42d9-9606-9f4c9a5d8c05/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c [2023-11-26 11:56:07,801 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:56:08,059 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:56:08,060 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_141f42e4-a531-42d9-9606-9f4c9a5d8c05/sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c [2023-11-26 11:56:08,069 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_141f42e4-a531-42d9-9606-9f4c9a5d8c05/bin/uautomizer-verify-VRDe98Ueme/data/296ea7608/fad53b7ff0f44aadaf81bf7f73cfa7e9/FLAG162428c32 [2023-11-26 11:56:08,083 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_141f42e4-a531-42d9-9606-9f4c9a5d8c05/bin/uautomizer-verify-VRDe98Ueme/data/296ea7608/fad53b7ff0f44aadaf81bf7f73cfa7e9 [2023-11-26 11:56:08,085 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:56:08,087 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:56:08,088 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:56:08,089 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:56:08,093 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:56:08,094 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:56:08" (1/1) ... [2023-11-26 11:56:08,095 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b79861b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:08, skipping insertion in model container [2023-11-26 11:56:08,095 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:56:08" (1/1) ... [2023-11-26 11:56:08,119 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:56:08,285 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:56:08,295 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:56:08,327 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:56:08,341 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:56:08,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:08 WrapperNode [2023-11-26 11:56:08,342 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:56:08,343 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:56:08,343 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:56:08,343 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:56:08,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:08" (1/1) ... [2023-11-26 11:56:08,361 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:08" (1/1) ... [2023-11-26 11:56:08,382 INFO L138 Inliner]: procedures = 16, calls = 63, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 81 [2023-11-26 11:56:08,383 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:56:08,384 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:56:08,384 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:56:08,384 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:56:08,397 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:08" (1/1) ... [2023-11-26 11:56:08,399 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:08" (1/1) ... [2023-11-26 11:56:08,403 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:08" (1/1) ... [2023-11-26 11:56:08,428 INFO L175 MemorySlicer]: Split 32 memory accesses to 6 slices as follows [2, 6, 6, 6, 6, 6]. 19 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 1, 1, 1, 1, 1]. The 10 writes are split as follows [0, 2, 2, 2, 2, 2]. [2023-11-26 11:56:08,428 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:08" (1/1) ... [2023-11-26 11:56:08,429 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:08" (1/1) ... [2023-11-26 11:56:08,440 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:08" (1/1) ... [2023-11-26 11:56:08,442 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:08" (1/1) ... [2023-11-26 11:56:08,444 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:08" (1/1) ... [2023-11-26 11:56:08,451 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:08" (1/1) ... [2023-11-26 11:56:08,456 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:56:08,457 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:56:08,457 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:56:08,457 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:56:08,458 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:08" (1/1) ... [2023-11-26 11:56:08,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-26 11:56:08,477 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_141f42e4-a531-42d9-9606-9f4c9a5d8c05/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:56:08,488 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_141f42e4-a531-42d9-9606-9f4c9a5d8c05/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-26 11:56:08,491 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_141f42e4-a531-42d9-9606-9f4c9a5d8c05/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-26 11:56:08,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:56:08,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 11:56:08,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-26 11:56:08,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-26 11:56:08,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-26 11:56:08,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-26 11:56:08,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-11-26 11:56:08,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 11:56:08,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-26 11:56:08,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-26 11:56:08,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-26 11:56:08,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-26 11:56:08,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-26 11:56:08,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-11-26 11:56:08,522 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_24_to_25_0 [2023-11-26 11:56:08,522 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_24_to_25_0 [2023-11-26 11:56:08,522 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_24_0 [2023-11-26 11:56:08,522 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_24_0 [2023-11-26 11:56:08,522 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_26_0 [2023-11-26 11:56:08,523 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_26_0 [2023-11-26 11:56:08,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:56:08,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:56:08,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-26 11:56:08,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-26 11:56:08,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-26 11:56:08,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-26 11:56:08,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-26 11:56:08,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-11-26 11:56:08,524 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_27_to_27_0 [2023-11-26 11:56:08,524 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_27_to_27_0 [2023-11-26 11:56:08,524 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_26_to_27_0 [2023-11-26 11:56:08,524 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_26_to_27_0 [2023-11-26 11:56:08,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 11:56:08,655 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:56:08,658 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:56:09,038 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:56:09,049 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:56:09,049 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-26 11:56:09,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:56:09 BoogieIcfgContainer [2023-11-26 11:56:09,052 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:56:09,053 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-26 11:56:09,053 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-26 11:56:09,057 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-26 11:56:09,058 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-26 11:56:09,059 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.11 11:56:08" (1/3) ... [2023-11-26 11:56:09,060 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@24de8dbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.11 11:56:09, skipping insertion in model container [2023-11-26 11:56:09,060 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-26 11:56:09,060 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:56:08" (2/3) ... [2023-11-26 11:56:09,061 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@24de8dbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.11 11:56:09, skipping insertion in model container [2023-11-26 11:56:09,061 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-26 11:56:09,061 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:56:09" (3/3) ... [2023-11-26 11:56:09,063 INFO L332 chiAutomizerObserver]: Analyzing ICFG recursified_nested_5.c [2023-11-26 11:56:09,123 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-26 11:56:09,123 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-26 11:56:09,123 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-26 11:56:09,123 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-26 11:56:09,123 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-26 11:56:09,123 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-26 11:56:09,124 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-26 11:56:09,124 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-26 11:56:09,128 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 50 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 39 states have internal predecessors, (44), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-26 11:56:09,151 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2023-11-26 11:56:09,152 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 11:56:09,152 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 11:56:09,158 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-26 11:56:09,158 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:56:09,159 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-26 11:56:09,159 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 50 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 39 states have internal predecessors, (44), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-26 11:56:09,165 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2023-11-26 11:56:09,165 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 11:56:09,165 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 11:56:09,166 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-26 11:56:09,166 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:56:09,173 INFO L748 eck$LassoCheckResult]: Stem: 19#$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); 26#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#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, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(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 main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 39#L128true call func_to_recursive_line_23_to_24_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, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 29#$Ultimate##0true [2023-11-26 11:56:09,173 INFO L750 eck$LassoCheckResult]: Loop: 29#$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;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#5(~a.base, ~a.offset, 4); 5#L101true assume #t~mem16 < 6;havoc #t~mem16;call write~int#1(0, ~b.base, ~b.offset, 4); 6#L107true call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 42#$Ultimate##0true ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#1(~b.base, ~b.offset, 4); 25#L81true assume !(#t~mem13 < 6);havoc #t~mem13; 21#L81-1true assume true; 20#func_to_recursive_line_24_to_25_0EXITtrue >#112#return; 3#L107-1true call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 34#L112true call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 29#$Ultimate##0true [2023-11-26 11:56:09,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:56:09,179 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 1 times [2023-11-26 11:56:09,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:56:09,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123365807] [2023-11-26 11:56:09,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:56:09,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:56:09,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:56:09,396 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:56:09,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:56:09,489 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:56:09,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:56:09,492 INFO L85 PathProgramCache]: Analyzing trace with hash 2053320187, now seen corresponding path program 1 times [2023-11-26 11:56:09,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:56:09,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337101804] [2023-11-26 11:56:09,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:56:09,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:56:09,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:09,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:09,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:10,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:56:10,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:56:10,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337101804] [2023-11-26 11:56:10,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337101804] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:56:10,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:56:10,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 11:56:10,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611486800] [2023-11-26 11:56:10,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:56:10,029 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-26 11:56:10,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:56:10,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:56:10,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:56:10,090 INFO L87 Difference]: Start difference. First operand has 50 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 39 states have internal predecessors, (44), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) 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) [2023-11-26 11:56:10,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:56:10,449 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2023-11-26 11:56:10,450 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 76 transitions. [2023-11-26 11:56:10,467 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2023-11-26 11:56:10,482 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 42 states and 53 transitions. [2023-11-26 11:56:10,484 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2023-11-26 11:56:10,484 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2023-11-26 11:56:10,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 53 transitions. [2023-11-26 11:56:10,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:56:10,488 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 53 transitions. [2023-11-26 11:56:10,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 53 transitions. [2023-11-26 11:56:10,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2023-11-26 11:56:10,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 25 states have internal predecessors, (25), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2023-11-26 11:56:10,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2023-11-26 11:56:10,521 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 44 transitions. [2023-11-26 11:56:10,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 11:56:10,526 INFO L428 stractBuchiCegarLoop]: Abstraction has 36 states and 44 transitions. [2023-11-26 11:56:10,526 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-26 11:56:10,526 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 44 transitions. [2023-11-26 11:56:10,527 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2023-11-26 11:56:10,528 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 11:56:10,528 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 11:56:10,529 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-26 11:56:10,529 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:56:10,529 INFO L748 eck$LassoCheckResult]: Stem: 161#$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); 145#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#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, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(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 main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 134#L128 call func_to_recursive_line_23_to_24_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, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 158#$Ultimate##0 [2023-11-26 11:56:10,529 INFO L750 eck$LassoCheckResult]: Loop: 158#$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;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#5(~a.base, ~a.offset, 4); 143#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#1(0, ~b.base, ~b.offset, 4); 139#L107 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 144#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#1(~b.base, ~b.offset, 4); 138#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~c.base, ~c.offset, 4); 141#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 159#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 160#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 149#L61-1 assume true; 146#func_to_recursive_line_25_to_26_0EXIT >#98#return; 148#L87-1 call #t~mem14 := read~int#1(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 140#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 144#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#1(~b.base, ~b.offset, 4); 138#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 142#L81-1 assume true; 162#func_to_recursive_line_24_to_25_0EXIT >#100#return; 163#L81-1 assume true; 164#func_to_recursive_line_24_to_25_0EXIT >#112#return; 133#L107-1 call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 135#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 158#$Ultimate##0 [2023-11-26 11:56:10,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:56:10,530 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 2 times [2023-11-26 11:56:10,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:56:10,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173817526] [2023-11-26 11:56:10,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:56:10,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:56:10,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:56:10,558 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:56:10,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:56:10,580 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:56:10,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:56:10,581 INFO L85 PathProgramCache]: Analyzing trace with hash 54735792, now seen corresponding path program 1 times [2023-11-26 11:56:10,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:56:10,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727872173] [2023-11-26 11:56:10,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:56:10,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:56:10,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:10,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:10,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:11,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:11,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:11,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:56:11,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:11,197 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-26 11:56:11,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:56:11,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727872173] [2023-11-26 11:56:11,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727872173] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:56:11,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:56:11,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-26 11:56:11,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350349226] [2023-11-26 11:56:11,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:56:11,206 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-26 11:56:11,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:56:11,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 11:56:11,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-26 11:56:11,208 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. cyclomatic complexity: 13 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) [2023-11-26 11:56:11,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:56:11,463 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2023-11-26 11:56:11,463 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 52 transitions. [2023-11-26 11:56:11,470 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2023-11-26 11:56:11,473 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 52 transitions. [2023-11-26 11:56:11,473 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2023-11-26 11:56:11,475 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2023-11-26 11:56:11,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 52 transitions. [2023-11-26 11:56:11,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:56:11,477 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 52 transitions. [2023-11-26 11:56:11,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 52 transitions. [2023-11-26 11:56:11,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 38. [2023-11-26 11:56:11,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 26 states have internal predecessors, (26), 10 states have call successors, (10), 5 states have call predecessors, (10), 6 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2023-11-26 11:56:11,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2023-11-26 11:56:11,488 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 46 transitions. [2023-11-26 11:56:11,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 11:56:11,490 INFO L428 stractBuchiCegarLoop]: Abstraction has 38 states and 46 transitions. [2023-11-26 11:56:11,491 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-26 11:56:11,491 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 46 transitions. [2023-11-26 11:56:11,497 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2023-11-26 11:56:11,498 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 11:56:11,498 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 11:56:11,501 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-26 11:56:11,501 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, 1, 1, 1, 1, 1, 1] [2023-11-26 11:56:11,502 INFO L748 eck$LassoCheckResult]: Stem: 278#$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); 260#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#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, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(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 main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 249#L128 call func_to_recursive_line_23_to_24_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, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 272#$Ultimate##0 [2023-11-26 11:56:11,502 INFO L750 eck$LassoCheckResult]: Loop: 272#$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;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#5(~a.base, ~a.offset, 4); 258#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#1(0, ~b.base, ~b.offset, 4); 255#L107 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 259#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#1(~b.base, ~b.offset, 4); 253#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~c.base, ~c.offset, 4); 256#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 273#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 276#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4); 267#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 265#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 268#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 270#L41-1 assume true; 269#func_to_recursive_line_26_to_27_0EXIT >#102#return; 271#L67-1 call #t~mem11 := read~int#3(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 262#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 273#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 276#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 277#L61-1 assume true; 261#func_to_recursive_line_25_to_26_0EXIT >#104#return; 263#L61-1 assume true; 275#func_to_recursive_line_25_to_26_0EXIT >#98#return; 274#L87-1 call #t~mem14 := read~int#1(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 254#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 259#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#1(~b.base, ~b.offset, 4); 253#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 257#L81-1 assume true; 279#func_to_recursive_line_24_to_25_0EXIT >#100#return; 280#L81-1 assume true; 281#func_to_recursive_line_24_to_25_0EXIT >#112#return; 248#L107-1 call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 250#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 272#$Ultimate##0 [2023-11-26 11:56:11,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:56:11,503 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 3 times [2023-11-26 11:56:11,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:56:11,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908035367] [2023-11-26 11:56:11,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:56:11,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:56:11,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:56:11,536 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:56:11,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:56:11,551 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:56:11,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:56:11,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1525796123, now seen corresponding path program 1 times [2023-11-26 11:56:11,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:56:11,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006082171] [2023-11-26 11:56:11,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:56:11,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:56:11,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:11,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:11,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:11,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:11,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:12,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:12,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:12,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:56:12,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:12,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-26 11:56:12,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:12,071 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-26 11:56:12,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:56:12,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006082171] [2023-11-26 11:56:12,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006082171] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:56:12,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:56:12,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-26 11:56:12,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919350424] [2023-11-26 11:56:12,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:56:12,074 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-26 11:56:12,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:56:12,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-26 11:56:12,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-26 11:56:12,075 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. cyclomatic complexity: 13 Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-26 11:56:12,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:56:12,334 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2023-11-26 11:56:12,334 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 51 transitions. [2023-11-26 11:56:12,336 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2023-11-26 11:56:12,338 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 51 transitions. [2023-11-26 11:56:12,338 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2023-11-26 11:56:12,339 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2023-11-26 11:56:12,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 51 transitions. [2023-11-26 11:56:12,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:56:12,340 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 51 transitions. [2023-11-26 11:56:12,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 51 transitions. [2023-11-26 11:56:12,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2023-11-26 11:56:12,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 23 states have (on average 1.173913043478261) internal successors, (27), 27 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 7 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2023-11-26 11:56:12,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2023-11-26 11:56:12,354 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 48 transitions. [2023-11-26 11:56:12,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 11:56:12,356 INFO L428 stractBuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2023-11-26 11:56:12,356 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-26 11:56:12,357 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 48 transitions. [2023-11-26 11:56:12,357 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2023-11-26 11:56:12,358 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 11:56:12,358 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 11:56:12,361 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-26 11:56:12,361 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:56:12,361 INFO L748 eck$LassoCheckResult]: Stem: 429#$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); 408#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#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, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(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 main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 393#L128 call func_to_recursive_line_23_to_24_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, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 419#$Ultimate##0 [2023-11-26 11:56:12,362 INFO L750 eck$LassoCheckResult]: Loop: 419#$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;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#5(~a.base, ~a.offset, 4); 406#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#1(0, ~b.base, ~b.offset, 4); 402#L107 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 407#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#1(~b.base, ~b.offset, 4); 401#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~c.base, ~c.offset, 4); 404#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 421#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 425#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4); 414#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 413#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 416#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 397#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 399#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 400#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 395#L25-1 assume true; 398#func_to_recursive_line_27_to_27_0EXIT >#108#return; 412#L47-1 call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 415#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 413#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 416#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 420#L41-1 assume true; 417#func_to_recursive_line_26_to_27_0EXIT >#110#return; 418#L41-1 assume true; 431#func_to_recursive_line_26_to_27_0EXIT >#102#return; 423#L67-1 call #t~mem11 := read~int#3(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 410#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 421#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 425#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 426#L61-1 assume true; 409#func_to_recursive_line_25_to_26_0EXIT >#104#return; 411#L61-1 assume true; 424#func_to_recursive_line_25_to_26_0EXIT >#98#return; 422#L87-1 call #t~mem14 := read~int#1(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 403#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 407#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#1(~b.base, ~b.offset, 4); 401#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 405#L81-1 assume true; 427#func_to_recursive_line_24_to_25_0EXIT >#100#return; 428#L81-1 assume true; 430#func_to_recursive_line_24_to_25_0EXIT >#112#return; 392#L107-1 call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 394#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 419#$Ultimate##0 [2023-11-26 11:56:12,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:56:12,362 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 4 times [2023-11-26 11:56:12,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:56:12,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232699858] [2023-11-26 11:56:12,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:56:12,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:56:12,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:56:12,385 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:56:12,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:56:12,408 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:56:12,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:56:12,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1439872263, now seen corresponding path program 1 times [2023-11-26 11:56:12,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:56:12,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901546169] [2023-11-26 11:56:12,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:56:12,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:56:12,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:12,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:12,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:12,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:12,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:12,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:12,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:13,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:13,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:13,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-26 11:56:13,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:13,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-26 11:56:13,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:13,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-26 11:56:13,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:13,116 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-26 11:56:13,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:56:13,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901546169] [2023-11-26 11:56:13,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901546169] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:56:13,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:56:13,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-26 11:56:13,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132846411] [2023-11-26 11:56:13,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:56:13,119 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-26 11:56:13,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:56:13,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-26 11:56:13,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-26 11:56:13,120 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. cyclomatic complexity: 13 Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 1 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-26 11:56:13,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:56:13,348 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2023-11-26 11:56:13,348 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 50 transitions. [2023-11-26 11:56:13,351 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2023-11-26 11:56:13,355 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 42 states and 50 transitions. [2023-11-26 11:56:13,355 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2023-11-26 11:56:13,356 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2023-11-26 11:56:13,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 50 transitions. [2023-11-26 11:56:13,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:56:13,361 INFO L218 hiAutomatonCegarLoop]: Abstraction has 42 states and 50 transitions. [2023-11-26 11:56:13,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 50 transitions. [2023-11-26 11:56:13,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2023-11-26 11:56:13,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 28 states have internal predecessors, (28), 10 states have call successors, (10), 5 states have call predecessors, (10), 8 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2023-11-26 11:56:13,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2023-11-26 11:56:13,370 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 50 transitions. [2023-11-26 11:56:13,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 11:56:13,372 INFO L428 stractBuchiCegarLoop]: Abstraction has 42 states and 50 transitions. [2023-11-26 11:56:13,373 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-26 11:56:13,373 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 50 transitions. [2023-11-26 11:56:13,375 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2023-11-26 11:56:13,375 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 11:56:13,375 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 11:56:13,377 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-26 11:56:13,377 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:56:13,377 INFO L748 eck$LassoCheckResult]: Stem: 621#$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); 600#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#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, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(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 main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 585#L128 call func_to_recursive_line_23_to_24_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, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 611#$Ultimate##0 [2023-11-26 11:56:13,383 INFO L750 eck$LassoCheckResult]: Loop: 611#$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;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#5(~a.base, ~a.offset, 4); 598#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#1(0, ~b.base, ~b.offset, 4); 594#L107 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 599#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#1(~b.base, ~b.offset, 4); 593#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~c.base, ~c.offset, 4); 596#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 613#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 617#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4); 606#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 605#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 608#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 588#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 591#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 592#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 589#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 591#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 592#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 587#L25-1 assume true; 590#func_to_recursive_line_27_to_27_0EXIT >#106#return; 604#L25-1 assume true; 624#func_to_recursive_line_27_to_27_0EXIT >#108#return; 622#L47-1 call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 607#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 605#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 608#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 612#L41-1 assume true; 609#func_to_recursive_line_26_to_27_0EXIT >#110#return; 610#L41-1 assume true; 625#func_to_recursive_line_26_to_27_0EXIT >#102#return; 615#L67-1 call #t~mem11 := read~int#3(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 602#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 613#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 617#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 618#L61-1 assume true; 601#func_to_recursive_line_25_to_26_0EXIT >#104#return; 603#L61-1 assume true; 616#func_to_recursive_line_25_to_26_0EXIT >#98#return; 614#L87-1 call #t~mem14 := read~int#1(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 595#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 599#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#1(~b.base, ~b.offset, 4); 593#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 597#L81-1 assume true; 619#func_to_recursive_line_24_to_25_0EXIT >#100#return; 620#L81-1 assume true; 623#func_to_recursive_line_24_to_25_0EXIT >#112#return; 584#L107-1 call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 586#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 611#$Ultimate##0 [2023-11-26 11:56:13,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:56:13,384 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 5 times [2023-11-26 11:56:13,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:56:13,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675587473] [2023-11-26 11:56:13,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:56:13,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:56:13,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:56:13,411 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:56:13,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:56:13,435 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:56:13,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:56:13,436 INFO L85 PathProgramCache]: Analyzing trace with hash 405682375, now seen corresponding path program 1 times [2023-11-26 11:56:13,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:56:13,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164460386] [2023-11-26 11:56:13,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:56:13,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:56:13,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:13,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:13,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:14,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:14,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:14,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:14,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:14,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:14,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:14,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:14,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:14,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-26 11:56:14,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:14,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-26 11:56:14,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:14,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-26 11:56:14,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:14,766 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-26 11:56:14,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:56:14,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164460386] [2023-11-26 11:56:14,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164460386] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:56:14,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078810816] [2023-11-26 11:56:14,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:56:14,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:56:14,772 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_141f42e4-a531-42d9-9606-9f4c9a5d8c05/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:56:14,776 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_141f42e4-a531-42d9-9606-9f4c9a5d8c05/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:56:14,791 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_141f42e4-a531-42d9-9606-9f4c9a5d8c05/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-26 11:56:14,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:14,996 INFO L262 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-26 11:56:15,017 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:56:15,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-26 11:56:15,384 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-26 11:56:15,384 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:56:16,007 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-26 11:56:16,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078810816] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 11:56:16,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 11:56:16,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 10] total 27 [2023-11-26 11:56:16,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501133792] [2023-11-26 11:56:16,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 11:56:16,010 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-26 11:56:16,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:56:16,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-26 11:56:16,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702 [2023-11-26 11:56:16,013 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. cyclomatic complexity: 13 Second operand has 27 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 20 states have internal predecessors, (52), 10 states have call successors, (20), 9 states have call predecessors, (20), 8 states have return successors, (19), 7 states have call predecessors, (19), 10 states have call successors, (19) [2023-11-26 11:56:16,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:56:16,942 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2023-11-26 11:56:16,942 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 54 transitions. [2023-11-26 11:56:16,944 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2023-11-26 11:56:16,946 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 54 transitions. [2023-11-26 11:56:16,946 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2023-11-26 11:56:16,946 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2023-11-26 11:56:16,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 54 transitions. [2023-11-26 11:56:16,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:56:16,947 INFO L218 hiAutomatonCegarLoop]: Abstraction has 46 states and 54 transitions. [2023-11-26 11:56:16,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 54 transitions. [2023-11-26 11:56:16,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2023-11-26 11:56:16,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 30 states have internal predecessors, (30), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (14), 10 states have call predecessors, (14), 8 states have call successors, (14) [2023-11-26 11:56:16,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2023-11-26 11:56:16,953 INFO L240 hiAutomatonCegarLoop]: Abstraction has 46 states and 54 transitions. [2023-11-26 11:56:16,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-26 11:56:16,954 INFO L428 stractBuchiCegarLoop]: Abstraction has 46 states and 54 transitions. [2023-11-26 11:56:16,954 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-11-26 11:56:16,955 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 54 transitions. [2023-11-26 11:56:16,956 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2023-11-26 11:56:16,956 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 11:56:16,956 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 11:56:16,959 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-26 11:56:16,959 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:56:16,959 INFO L748 eck$LassoCheckResult]: Stem: 1153#$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); 1135#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#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, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(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 main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 1124#L128 call func_to_recursive_line_23_to_24_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, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 1146#$Ultimate##0 [2023-11-26 11:56:16,960 INFO L750 eck$LassoCheckResult]: Loop: 1146#$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;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#5(~a.base, ~a.offset, 4); 1133#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#1(0, ~b.base, ~b.offset, 4); 1129#L107 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1134#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#1(~b.base, ~b.offset, 4); 1128#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~c.base, ~c.offset, 4); 1131#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 1152#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4); 1141#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 1140#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 1143#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 1120#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1126#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 1127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1121#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1126#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 1127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1121#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1126#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 1127#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1119#L25-1 assume true; 1122#func_to_recursive_line_27_to_27_0EXIT >#106#return; 1136#L25-1 assume true; 1163#func_to_recursive_line_27_to_27_0EXIT >#106#return; 1162#L25-1 assume true; 1161#func_to_recursive_line_27_to_27_0EXIT >#108#return; 1156#L47-1 call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 1142#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 1140#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 1143#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1147#L41-1 assume true; 1144#func_to_recursive_line_26_to_27_0EXIT >#110#return; 1145#L41-1 assume true; 1164#func_to_recursive_line_26_to_27_0EXIT >#102#return; 1150#L67-1 call #t~mem11 := read~int#3(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 1138#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 1152#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 1151#L61-1 assume true; 1137#func_to_recursive_line_25_to_26_0EXIT >#104#return; 1139#L61-1 assume true; 1160#func_to_recursive_line_25_to_26_0EXIT >#98#return; 1149#L87-1 call #t~mem14 := read~int#1(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 1130#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1134#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#1(~b.base, ~b.offset, 4); 1128#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~c.base, ~c.offset, 4); 1131#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 1152#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4); 1141#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 1140#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 1143#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 1120#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1126#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 1127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1121#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1126#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 1127#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 1121#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 1126#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 1127#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1119#L25-1 assume true; 1122#func_to_recursive_line_27_to_27_0EXIT >#106#return; 1136#L25-1 assume true; 1163#func_to_recursive_line_27_to_27_0EXIT >#106#return; 1162#L25-1 assume true; 1161#func_to_recursive_line_27_to_27_0EXIT >#108#return; 1156#L47-1 call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 1142#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 1140#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 1143#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1147#L41-1 assume true; 1144#func_to_recursive_line_26_to_27_0EXIT >#110#return; 1145#L41-1 assume true; 1164#func_to_recursive_line_26_to_27_0EXIT >#102#return; 1150#L67-1 call #t~mem11 := read~int#3(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 1138#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1148#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 1152#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 1151#L61-1 assume true; 1137#func_to_recursive_line_25_to_26_0EXIT >#104#return; 1139#L61-1 assume true; 1160#func_to_recursive_line_25_to_26_0EXIT >#98#return; 1149#L87-1 call #t~mem14 := read~int#1(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 1130#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1134#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#1(~b.base, ~b.offset, 4); 1128#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 1132#L81-1 assume true; 1154#func_to_recursive_line_24_to_25_0EXIT >#100#return; 1155#L81-1 assume true; 1157#func_to_recursive_line_24_to_25_0EXIT >#100#return; 1159#L81-1 assume true; 1158#func_to_recursive_line_24_to_25_0EXIT >#112#return; 1123#L107-1 call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 1125#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 1146#$Ultimate##0 [2023-11-26 11:56:16,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:56:16,961 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 6 times [2023-11-26 11:56:16,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:56:16,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177824347] [2023-11-26 11:56:16,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:56:16,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:56:16,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:56:16,979 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:56:16,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:56:16,991 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:56:16,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:56:16,992 INFO L85 PathProgramCache]: Analyzing trace with hash 41890415, now seen corresponding path program 2 times [2023-11-26 11:56:16,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:56:16,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952378165] [2023-11-26 11:56:16,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:56:16,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:56:17,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:17,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:17,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:18,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:18,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:18,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:18,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:18,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:18,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:18,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:18,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:18,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:18,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:18,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-26 11:56:18,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:18,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-26 11:56:18,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:18,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-26 11:56:18,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:18,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:18,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:19,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:19,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:19,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:19,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:19,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:19,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:19,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:19,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:19,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-26 11:56:19,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:19,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-26 11:56:19,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:19,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-26 11:56:19,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:19,623 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 56 proven. 8 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2023-11-26 11:56:19,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:56:19,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952378165] [2023-11-26 11:56:19,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952378165] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:56:19,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3728033] [2023-11-26 11:56:19,624 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-26 11:56:19,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:56:19,624 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_141f42e4-a531-42d9-9606-9f4c9a5d8c05/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:56:19,657 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_141f42e4-a531-42d9-9606-9f4c9a5d8c05/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:56:19,665 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_141f42e4-a531-42d9-9606-9f4c9a5d8c05/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-26 11:56:19,917 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-26 11:56:19,917 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-26 11:56:19,922 INFO L262 TraceCheckSpWp]: Trace formula consists of 736 conjuncts, 39 conjunts are in the unsatisfiable core [2023-11-26 11:56:19,934 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:56:19,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-26 11:56:20,285 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2023-11-26 11:56:20,286 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:56:21,413 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-11-26 11:56:21,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3728033] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 11:56:21,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 11:56:21,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 14] total 35 [2023-11-26 11:56:21,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334584182] [2023-11-26 11:56:21,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 11:56:21,418 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-26 11:56:21,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:56:21,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-11-26 11:56:21,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1037, Unknown=0, NotChecked=0, Total=1190 [2023-11-26 11:56:21,420 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. cyclomatic complexity: 13 Second operand has 35 states, 27 states have (on average 2.2962962962962963) internal successors, (62), 27 states have internal predecessors, (62), 13 states have call successors, (28), 10 states have call predecessors, (28), 11 states have return successors, (25), 11 states have call predecessors, (25), 13 states have call successors, (25) [2023-11-26 11:56:22,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:56:22,355 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2023-11-26 11:56:22,355 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 58 transitions. [2023-11-26 11:56:22,356 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2023-11-26 11:56:22,358 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 50 states and 58 transitions. [2023-11-26 11:56:22,358 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2023-11-26 11:56:22,358 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2023-11-26 11:56:22,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 58 transitions. [2023-11-26 11:56:22,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:56:22,359 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50 states and 58 transitions. [2023-11-26 11:56:22,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 58 transitions. [2023-11-26 11:56:22,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2023-11-26 11:56:22,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 32 states have internal predecessors, (32), 10 states have call successors, (10), 5 states have call predecessors, (10), 12 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2023-11-26 11:56:22,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2023-11-26 11:56:22,363 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 58 transitions. [2023-11-26 11:56:22,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-26 11:56:22,365 INFO L428 stractBuchiCegarLoop]: Abstraction has 50 states and 58 transitions. [2023-11-26 11:56:22,365 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-11-26 11:56:22,365 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 58 transitions. [2023-11-26 11:56:22,366 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2023-11-26 11:56:22,366 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 11:56:22,366 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 11:56:22,370 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-26 11:56:22,370 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [12, 12, 9, 9, 9, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:56:22,371 INFO L748 eck$LassoCheckResult]: Stem: 2209#$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); 2191#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#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, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(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 main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 2180#L128 call func_to_recursive_line_23_to_24_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, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 2202#$Ultimate##0 [2023-11-26 11:56:22,371 INFO L750 eck$LassoCheckResult]: Loop: 2202#$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;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#5(~a.base, ~a.offset, 4); 2189#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#1(0, ~b.base, ~b.offset, 4); 2185#L107 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 2190#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#1(~b.base, ~b.offset, 4); 2184#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~c.base, ~c.offset, 4); 2187#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 2204#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 2208#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4); 2198#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 2196#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 2199#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 2176#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2182#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2183#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2177#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2182#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2183#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2177#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2182#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2183#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2177#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2182#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2183#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2175#L25-1 assume true; 2178#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2195#L25-1 assume true; 2223#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2222#L25-1 assume true; 2220#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2217#L25-1 assume true; 2216#func_to_recursive_line_27_to_27_0EXIT >#108#return; 2212#L47-1 call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 2197#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 2196#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 2199#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 2203#L41-1 assume true; 2200#func_to_recursive_line_26_to_27_0EXIT >#110#return; 2201#L41-1 assume true; 2224#func_to_recursive_line_26_to_27_0EXIT >#102#return; 2206#L67-1 call #t~mem11 := read~int#3(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 2193#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 2204#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 2208#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 2207#L61-1 assume true; 2192#func_to_recursive_line_25_to_26_0EXIT >#104#return; 2194#L61-1 assume true; 2215#func_to_recursive_line_25_to_26_0EXIT >#98#return; 2205#L87-1 call #t~mem14 := read~int#1(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 2186#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 2190#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#1(~b.base, ~b.offset, 4); 2184#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~c.base, ~c.offset, 4); 2187#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 2204#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 2208#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4); 2198#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 2196#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 2199#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 2176#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2182#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2183#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2177#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2182#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2183#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2177#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2182#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2183#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2177#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2182#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2183#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2175#L25-1 assume true; 2178#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2195#L25-1 assume true; 2223#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2222#L25-1 assume true; 2220#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2217#L25-1 assume true; 2216#func_to_recursive_line_27_to_27_0EXIT >#108#return; 2212#L47-1 call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 2197#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 2196#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 2199#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 2203#L41-1 assume true; 2200#func_to_recursive_line_26_to_27_0EXIT >#110#return; 2201#L41-1 assume true; 2224#func_to_recursive_line_26_to_27_0EXIT >#102#return; 2206#L67-1 call #t~mem11 := read~int#3(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 2193#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 2204#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 2208#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 2207#L61-1 assume true; 2192#func_to_recursive_line_25_to_26_0EXIT >#104#return; 2194#L61-1 assume true; 2215#func_to_recursive_line_25_to_26_0EXIT >#98#return; 2205#L87-1 call #t~mem14 := read~int#1(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 2186#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 2190#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#1(~b.base, ~b.offset, 4); 2184#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~c.base, ~c.offset, 4); 2187#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 2204#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 2208#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4); 2198#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 2196#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 2199#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 2176#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2182#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2183#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2177#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2182#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2183#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2177#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2182#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2183#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 2177#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 2182#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 2183#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2175#L25-1 assume true; 2178#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2195#L25-1 assume true; 2223#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2222#L25-1 assume true; 2220#func_to_recursive_line_27_to_27_0EXIT >#106#return; 2217#L25-1 assume true; 2216#func_to_recursive_line_27_to_27_0EXIT >#108#return; 2212#L47-1 call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 2197#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 2196#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 2199#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 2203#L41-1 assume true; 2200#func_to_recursive_line_26_to_27_0EXIT >#110#return; 2201#L41-1 assume true; 2224#func_to_recursive_line_26_to_27_0EXIT >#102#return; 2206#L67-1 call #t~mem11 := read~int#3(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 2193#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 2204#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 2208#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 2207#L61-1 assume true; 2192#func_to_recursive_line_25_to_26_0EXIT >#104#return; 2194#L61-1 assume true; 2215#func_to_recursive_line_25_to_26_0EXIT >#98#return; 2205#L87-1 call #t~mem14 := read~int#1(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 2186#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 2190#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#1(~b.base, ~b.offset, 4); 2184#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 2188#L81-1 assume true; 2210#func_to_recursive_line_24_to_25_0EXIT >#100#return; 2211#L81-1 assume true; 2221#func_to_recursive_line_24_to_25_0EXIT >#100#return; 2219#L81-1 assume true; 2218#func_to_recursive_line_24_to_25_0EXIT >#100#return; 2214#L81-1 assume true; 2213#func_to_recursive_line_24_to_25_0EXIT >#112#return; 2179#L107-1 call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 2181#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 2202#$Ultimate##0 [2023-11-26 11:56:22,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:56:22,372 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 7 times [2023-11-26 11:56:22,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:56:22,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078360219] [2023-11-26 11:56:22,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:56:22,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:56:22,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:56:22,387 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:56:22,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:56:22,398 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:56:22,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:56:22,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1894971815, now seen corresponding path program 3 times [2023-11-26 11:56:22,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:56:22,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410927463] [2023-11-26 11:56:22,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:56:22,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:56:22,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:23,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:23,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:24,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:24,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:24,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:24,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:24,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:24,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:24,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:24,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:24,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:24,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:24,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:24,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:24,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-26 11:56:24,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:24,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-26 11:56:24,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:24,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-26 11:56:24,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:24,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:24,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:24,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:24,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:24,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:24,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:24,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:25,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:25,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:25,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:25,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:25,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:25,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-26 11:56:25,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:25,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-26 11:56:25,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:25,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-26 11:56:25,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:25,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:25,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:25,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:25,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:25,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:25,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:25,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:25,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:25,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:25,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:25,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:25,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:25,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-26 11:56:25,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:25,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-26 11:56:25,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:25,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-26 11:56:25,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:25,253 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 26 proven. 21 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2023-11-26 11:56:25,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:56:25,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410927463] [2023-11-26 11:56:25,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410927463] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:56:25,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442626627] [2023-11-26 11:56:25,254 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-26 11:56:25,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:56:25,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_141f42e4-a531-42d9-9606-9f4c9a5d8c05/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:56:25,261 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_141f42e4-a531-42d9-9606-9f4c9a5d8c05/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:56:25,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_141f42e4-a531-42d9-9606-9f4c9a5d8c05/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-26 11:56:25,542 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-26 11:56:25,542 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-26 11:56:25,546 INFO L262 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-26 11:56:25,564 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:56:25,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-26 11:56:25,797 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2023-11-26 11:56:25,798 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:56:27,067 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 50 proven. 4 refuted. 0 times theorem prover too weak. 417 trivial. 0 not checked. [2023-11-26 11:56:27,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442626627] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 11:56:27,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 11:56:27,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 10] total 26 [2023-11-26 11:56:27,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947950085] [2023-11-26 11:56:27,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 11:56:27,070 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-26 11:56:27,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:56:27,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-26 11:56:27,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=541, Unknown=0, NotChecked=0, Total=650 [2023-11-26 11:56:27,071 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. cyclomatic complexity: 13 Second operand has 26 states, 20 states have (on average 2.65) internal successors, (53), 19 states have internal predecessors, (53), 11 states have call successors, (29), 9 states have call predecessors, (29), 7 states have return successors, (20), 8 states have call predecessors, (20), 11 states have call successors, (20) [2023-11-26 11:56:27,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:56:27,733 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2023-11-26 11:56:27,733 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 62 transitions. [2023-11-26 11:56:27,735 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2023-11-26 11:56:27,736 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 54 states and 62 transitions. [2023-11-26 11:56:27,736 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2023-11-26 11:56:27,737 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2023-11-26 11:56:27,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 62 transitions. [2023-11-26 11:56:27,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:56:27,737 INFO L218 hiAutomatonCegarLoop]: Abstraction has 54 states and 62 transitions. [2023-11-26 11:56:27,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 62 transitions. [2023-11-26 11:56:27,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2023-11-26 11:56:27,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 34 states have internal predecessors, (34), 10 states have call successors, (10), 5 states have call predecessors, (10), 14 states have return successors, (18), 14 states have call predecessors, (18), 8 states have call successors, (18) [2023-11-26 11:56:27,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2023-11-26 11:56:27,742 INFO L240 hiAutomatonCegarLoop]: Abstraction has 54 states and 62 transitions. [2023-11-26 11:56:27,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-26 11:56:27,748 INFO L428 stractBuchiCegarLoop]: Abstraction has 54 states and 62 transitions. [2023-11-26 11:56:27,748 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-11-26 11:56:27,748 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 62 transitions. [2023-11-26 11:56:27,749 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2023-11-26 11:56:27,749 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 11:56:27,749 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 11:56:27,762 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-26 11:56:27,762 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [36, 36, 27, 27, 27, 18, 18, 12, 12, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:56:27,762 INFO L748 eck$LassoCheckResult]: Stem: 3945#$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); 3927#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#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, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(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 main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 3917#L128 call func_to_recursive_line_23_to_24_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, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 3938#$Ultimate##0 [2023-11-26 11:56:27,763 INFO L750 eck$LassoCheckResult]: Loop: 3938#$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;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#5(~a.base, ~a.offset, 4); 3925#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#1(0, ~b.base, ~b.offset, 4); 3921#L107 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3926#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#1(~b.base, ~b.offset, 4); 3920#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~c.base, ~c.offset, 4); 3923#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3940#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 3944#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4); 3933#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 3932#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 3935#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 3913#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3918#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 3919#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3912#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3918#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 3919#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3912#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3918#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 3919#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3912#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3918#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 3919#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3911#L25-1 assume true; 3914#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3931#L25-1 assume true; 3963#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3962#L25-1 assume true; 3957#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3954#L25-1 assume true; 3953#func_to_recursive_line_27_to_27_0EXIT >#108#return; 3948#L47-1 call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 3934#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 3932#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 3935#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 3939#L41-1 assume true; 3936#func_to_recursive_line_26_to_27_0EXIT >#110#return; 3937#L41-1 assume true; 3964#func_to_recursive_line_26_to_27_0EXIT >#102#return; 3942#L67-1 call #t~mem11 := read~int#3(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 3929#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3940#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 3944#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4); 3933#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 3932#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 3935#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 3913#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3918#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 3919#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3912#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3918#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 3919#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3912#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3918#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 3919#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3912#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3918#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 3919#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3911#L25-1 assume true; 3914#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3931#L25-1 assume true; 3963#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3962#L25-1 assume true; 3957#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3954#L25-1 assume true; 3953#func_to_recursive_line_27_to_27_0EXIT >#108#return; 3948#L47-1 call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 3934#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 3932#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 3935#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 3939#L41-1 assume true; 3936#func_to_recursive_line_26_to_27_0EXIT >#110#return; 3937#L41-1 assume true; 3964#func_to_recursive_line_26_to_27_0EXIT >#102#return; 3942#L67-1 call #t~mem11 := read~int#3(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 3929#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3940#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 3944#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4); 3933#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 3932#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 3935#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 3913#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3918#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 3919#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3912#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3918#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 3919#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3912#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3918#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 3919#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3912#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3918#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 3919#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3911#L25-1 assume true; 3914#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3931#L25-1 assume true; 3963#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3962#L25-1 assume true; 3957#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3954#L25-1 assume true; 3953#func_to_recursive_line_27_to_27_0EXIT >#108#return; 3948#L47-1 call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 3934#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 3932#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 3935#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 3939#L41-1 assume true; 3936#func_to_recursive_line_26_to_27_0EXIT >#110#return; 3937#L41-1 assume true; 3964#func_to_recursive_line_26_to_27_0EXIT >#102#return; 3942#L67-1 call #t~mem11 := read~int#3(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 3929#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3940#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 3944#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 3943#L61-1 assume true; 3928#func_to_recursive_line_25_to_26_0EXIT >#104#return; 3930#L61-1 assume true; 3961#func_to_recursive_line_25_to_26_0EXIT >#104#return; 3960#L61-1 assume true; 3956#func_to_recursive_line_25_to_26_0EXIT >#104#return; 3952#L61-1 assume true; 3951#func_to_recursive_line_25_to_26_0EXIT >#98#return; 3941#L87-1 call #t~mem14 := read~int#1(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 3922#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3926#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#1(~b.base, ~b.offset, 4); 3920#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~c.base, ~c.offset, 4); 3923#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3940#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 3944#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4); 3933#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 3932#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 3935#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 3913#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3918#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 3919#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3912#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3918#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 3919#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3912#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3918#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 3919#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3912#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3918#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 3919#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3911#L25-1 assume true; 3914#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3931#L25-1 assume true; 3963#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3962#L25-1 assume true; 3957#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3954#L25-1 assume true; 3953#func_to_recursive_line_27_to_27_0EXIT >#108#return; 3948#L47-1 call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 3934#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 3932#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 3935#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 3939#L41-1 assume true; 3936#func_to_recursive_line_26_to_27_0EXIT >#110#return; 3937#L41-1 assume true; 3964#func_to_recursive_line_26_to_27_0EXIT >#102#return; 3942#L67-1 call #t~mem11 := read~int#3(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 3929#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3940#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 3944#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4); 3933#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 3932#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 3935#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 3913#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3918#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 3919#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3912#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3918#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 3919#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3912#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3918#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 3919#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3912#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3918#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 3919#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3911#L25-1 assume true; 3914#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3931#L25-1 assume true; 3963#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3962#L25-1 assume true; 3957#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3954#L25-1 assume true; 3953#func_to_recursive_line_27_to_27_0EXIT >#108#return; 3948#L47-1 call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 3934#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 3932#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 3935#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 3939#L41-1 assume true; 3936#func_to_recursive_line_26_to_27_0EXIT >#110#return; 3937#L41-1 assume true; 3964#func_to_recursive_line_26_to_27_0EXIT >#102#return; 3942#L67-1 call #t~mem11 := read~int#3(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 3929#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3940#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 3944#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4); 3933#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 3932#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 3935#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 3913#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3918#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 3919#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3912#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3918#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 3919#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3912#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3918#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 3919#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3912#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3918#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 3919#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3911#L25-1 assume true; 3914#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3931#L25-1 assume true; 3963#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3962#L25-1 assume true; 3957#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3954#L25-1 assume true; 3953#func_to_recursive_line_27_to_27_0EXIT >#108#return; 3948#L47-1 call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 3934#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 3932#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 3935#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 3939#L41-1 assume true; 3936#func_to_recursive_line_26_to_27_0EXIT >#110#return; 3937#L41-1 assume true; 3964#func_to_recursive_line_26_to_27_0EXIT >#102#return; 3942#L67-1 call #t~mem11 := read~int#3(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 3929#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3940#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 3944#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 3943#L61-1 assume true; 3928#func_to_recursive_line_25_to_26_0EXIT >#104#return; 3930#L61-1 assume true; 3961#func_to_recursive_line_25_to_26_0EXIT >#104#return; 3960#L61-1 assume true; 3956#func_to_recursive_line_25_to_26_0EXIT >#104#return; 3952#L61-1 assume true; 3951#func_to_recursive_line_25_to_26_0EXIT >#98#return; 3941#L87-1 call #t~mem14 := read~int#1(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 3922#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3926#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#1(~b.base, ~b.offset, 4); 3920#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~c.base, ~c.offset, 4); 3923#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3940#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 3944#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4); 3933#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 3932#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 3935#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 3913#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3918#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 3919#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3912#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3918#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 3919#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3912#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3918#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 3919#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3912#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3918#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 3919#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3911#L25-1 assume true; 3914#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3931#L25-1 assume true; 3963#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3962#L25-1 assume true; 3957#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3954#L25-1 assume true; 3953#func_to_recursive_line_27_to_27_0EXIT >#108#return; 3948#L47-1 call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 3934#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 3932#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 3935#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 3939#L41-1 assume true; 3936#func_to_recursive_line_26_to_27_0EXIT >#110#return; 3937#L41-1 assume true; 3964#func_to_recursive_line_26_to_27_0EXIT >#102#return; 3942#L67-1 call #t~mem11 := read~int#3(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 3929#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3940#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 3944#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4); 3933#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 3932#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 3935#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 3913#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3918#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 3919#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3912#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3918#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 3919#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3912#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3918#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 3919#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3912#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3918#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 3919#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3911#L25-1 assume true; 3914#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3931#L25-1 assume true; 3963#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3962#L25-1 assume true; 3957#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3954#L25-1 assume true; 3953#func_to_recursive_line_27_to_27_0EXIT >#108#return; 3948#L47-1 call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 3934#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 3932#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 3935#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 3939#L41-1 assume true; 3936#func_to_recursive_line_26_to_27_0EXIT >#110#return; 3937#L41-1 assume true; 3964#func_to_recursive_line_26_to_27_0EXIT >#102#return; 3942#L67-1 call #t~mem11 := read~int#3(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 3929#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3940#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 3944#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4); 3933#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 3932#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 3935#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 3913#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3918#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 3919#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3912#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3918#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 3919#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3912#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3918#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 3919#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 3912#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 3918#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 3919#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3911#L25-1 assume true; 3914#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3931#L25-1 assume true; 3963#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3962#L25-1 assume true; 3957#func_to_recursive_line_27_to_27_0EXIT >#106#return; 3954#L25-1 assume true; 3953#func_to_recursive_line_27_to_27_0EXIT >#108#return; 3948#L47-1 call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 3934#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 3932#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 3935#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 3939#L41-1 assume true; 3936#func_to_recursive_line_26_to_27_0EXIT >#110#return; 3937#L41-1 assume true; 3964#func_to_recursive_line_26_to_27_0EXIT >#102#return; 3942#L67-1 call #t~mem11 := read~int#3(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 3929#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3940#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 3944#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 3943#L61-1 assume true; 3928#func_to_recursive_line_25_to_26_0EXIT >#104#return; 3930#L61-1 assume true; 3961#func_to_recursive_line_25_to_26_0EXIT >#104#return; 3960#L61-1 assume true; 3956#func_to_recursive_line_25_to_26_0EXIT >#104#return; 3952#L61-1 assume true; 3951#func_to_recursive_line_25_to_26_0EXIT >#98#return; 3941#L87-1 call #t~mem14 := read~int#1(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 3922#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3926#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#1(~b.base, ~b.offset, 4); 3920#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 3924#L81-1 assume true; 3946#func_to_recursive_line_24_to_25_0EXIT >#100#return; 3947#L81-1 assume true; 3959#func_to_recursive_line_24_to_25_0EXIT >#100#return; 3958#L81-1 assume true; 3955#func_to_recursive_line_24_to_25_0EXIT >#100#return; 3950#L81-1 assume true; 3949#func_to_recursive_line_24_to_25_0EXIT >#112#return; 3915#L107-1 call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 3916#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 3938#$Ultimate##0 [2023-11-26 11:56:27,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:56:27,765 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 8 times [2023-11-26 11:56:27,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:56:27,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780256312] [2023-11-26 11:56:27,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:56:27,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:56:27,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:56:27,784 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:56:27,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:56:27,797 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:56:27,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:56:27,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1764364519, now seen corresponding path program 4 times [2023-11-26 11:56:27,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:56:27,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024982383] [2023-11-26 11:56:27,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:56:27,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:56:27,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:31,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:31,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:34,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:34,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:35,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:35,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:35,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:35,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:35,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:35,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:35,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:35,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:35,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:35,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:35,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-26 11:56:35,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:35,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-26 11:56:35,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:35,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:35,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:36,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:36,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:36,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:36,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:36,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:36,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:36,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:36,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:36,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-26 11:56:36,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:36,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-26 11:56:36,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:36,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:36,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:36,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:36,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:36,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:36,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:36,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:36,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:36,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:36,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:36,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-26 11:56:36,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:36,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-26 11:56:36,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:36,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-26 11:56:36,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:36,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:36,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:36,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:36,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:36,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:36,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:36,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:36,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:36,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:36,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:36,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:36,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:36,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-26 11:56:36,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:36,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-26 11:56:36,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:37,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:37,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:37,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:37,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:37,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:37,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:37,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:37,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:37,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:37,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:37,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-26 11:56:37,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:37,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-26 11:56:37,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:37,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:37,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:37,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:37,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:37,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:37,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:37,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:37,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:37,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:37,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:37,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-26 11:56:37,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:37,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-26 11:56:37,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:37,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-26 11:56:37,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:37,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:37,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:37,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:37,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:37,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:37,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:37,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:37,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:37,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:37,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:37,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:37,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:37,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-26 11:56:37,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:37,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-26 11:56:37,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:37,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:37,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:37,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:37,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:37,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:37,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:37,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:37,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:37,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:37,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:37,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-26 11:56:37,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:37,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-26 11:56:37,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:37,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:37,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:37,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:37,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:37,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:37,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:37,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:37,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:37,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:37,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:37,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-26 11:56:37,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:37,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-26 11:56:37,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:37,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-26 11:56:37,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:37,435 INFO L134 CoverageAnalysis]: Checked inductivity of 3996 backedges. 86 proven. 550 refuted. 0 times theorem prover too weak. 3360 trivial. 0 not checked. [2023-11-26 11:56:37,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:56:37,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024982383] [2023-11-26 11:56:37,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024982383] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-26 11:56:37,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792799411] [2023-11-26 11:56:37,436 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-26 11:56:37,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-26 11:56:37,437 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_141f42e4-a531-42d9-9606-9f4c9a5d8c05/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:56:37,442 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_141f42e4-a531-42d9-9606-9f4c9a5d8c05/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-26 11:56:37,465 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_141f42e4-a531-42d9-9606-9f4c9a5d8c05/bin/uautomizer-verify-VRDe98Ueme/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-26 11:56:38,135 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-26 11:56:38,135 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-26 11:56:38,150 INFO L262 TraceCheckSpWp]: Trace formula consists of 2497 conjuncts, 51 conjunts are in the unsatisfiable core [2023-11-26 11:56:38,167 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:56:38,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-26 11:56:38,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3996 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3981 trivial. 0 not checked. [2023-11-26 11:56:38,598 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-26 11:56:41,272 INFO L134 CoverageAnalysis]: Checked inductivity of 3996 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 3963 trivial. 0 not checked. [2023-11-26 11:56:41,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792799411] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-26 11:56:41,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-26 11:56:41,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 11, 18] total 45 [2023-11-26 11:56:41,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506241540] [2023-11-26 11:56:41,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-26 11:56:41,278 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-26 11:56:41,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:56:41,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-11-26 11:56:41,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=1763, Unknown=0, NotChecked=0, Total=1980 [2023-11-26 11:56:41,281 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. cyclomatic complexity: 13 Second operand has 45 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 36 states have internal predecessors, (73), 18 states have call successors, (33), 11 states have call predecessors, (33), 15 states have return successors, (31), 17 states have call predecessors, (31), 18 states have call successors, (31) [2023-11-26 11:56:42,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-26 11:56:42,687 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2023-11-26 11:56:42,687 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 66 transitions. [2023-11-26 11:56:42,688 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2023-11-26 11:56:42,690 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 58 states and 66 transitions. [2023-11-26 11:56:42,690 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2023-11-26 11:56:42,691 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2023-11-26 11:56:42,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 66 transitions. [2023-11-26 11:56:42,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:56:42,691 INFO L218 hiAutomatonCegarLoop]: Abstraction has 58 states and 66 transitions. [2023-11-26 11:56:42,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states and 66 transitions. [2023-11-26 11:56:42,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2023-11-26 11:56:42,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 32 states have (on average 1.125) internal successors, (36), 36 states have internal predecessors, (36), 10 states have call successors, (10), 5 states have call predecessors, (10), 16 states have return successors, (20), 16 states have call predecessors, (20), 8 states have call successors, (20) [2023-11-26 11:56:42,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2023-11-26 11:56:42,697 INFO L240 hiAutomatonCegarLoop]: Abstraction has 58 states and 66 transitions. [2023-11-26 11:56:42,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-26 11:56:42,698 INFO L428 stractBuchiCegarLoop]: Abstraction has 58 states and 66 transitions. [2023-11-26 11:56:42,699 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-11-26 11:56:42,699 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 66 transitions. [2023-11-26 11:56:42,700 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 23 [2023-11-26 11:56:42,700 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-26 11:56:42,700 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-26 11:56:42,705 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-26 11:56:42,705 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [60, 60, 48, 48, 48, 24, 24, 16, 16, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:56:42,705 INFO L748 eck$LassoCheckResult]: Stem: 8566#$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); 8545#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem19#1, main_#t~mem20#1, main_#t~short21#1, main_#t~mem22#1, main_#t~short23#1, main_#t~mem24#1, main_#t~short25#1, main_#t~mem26#1, main_#t~short27#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, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#5(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 main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#e~0#1.base, main_~#e~0#1.offset, 4);call write~int#5(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 8535#L128 call func_to_recursive_line_23_to_24_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, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 8557#$Ultimate##0 [2023-11-26 11:56:42,706 INFO L750 eck$LassoCheckResult]: Loop: 8557#$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;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem16 := read~int#5(~a.base, ~a.offset, 4); 8543#L101 assume #t~mem16 < 6;havoc #t~mem16;call write~int#1(0, ~b.base, ~b.offset, 4); 8540#L107 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 8544#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#1(~b.base, ~b.offset, 4); 8538#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~c.base, ~c.offset, 4); 8541#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 8558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 8562#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4); 8551#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 8550#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 8553#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 8531#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8536#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8537#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8530#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8536#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8537#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8530#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8536#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8537#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8530#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8536#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8537#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8530#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8536#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8537#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8529#L25-1 assume true; 8532#func_to_recursive_line_27_to_27_0EXIT >#106#return; 8549#L25-1 assume true; 8585#func_to_recursive_line_27_to_27_0EXIT >#106#return; 8584#L25-1 assume true; 8582#func_to_recursive_line_27_to_27_0EXIT >#106#return; 8581#L25-1 assume true; 8577#func_to_recursive_line_27_to_27_0EXIT >#106#return; 8574#L25-1 assume true; 8573#func_to_recursive_line_27_to_27_0EXIT >#108#return; 8567#L47-1 call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 8552#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 8550#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 8553#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 8556#L41-1 assume true; 8554#func_to_recursive_line_26_to_27_0EXIT >#110#return; 8555#L41-1 assume true; 8586#func_to_recursive_line_26_to_27_0EXIT >#102#return; 8560#L67-1 call #t~mem11 := read~int#3(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 8547#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 8558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 8562#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4); 8551#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 8550#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 8553#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 8531#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8536#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8537#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8530#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8536#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8537#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8530#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8536#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8537#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8530#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8536#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8537#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8530#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8536#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8537#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8529#L25-1 assume true; 8532#func_to_recursive_line_27_to_27_0EXIT >#106#return; 8549#L25-1 assume true; 8585#func_to_recursive_line_27_to_27_0EXIT >#106#return; 8584#L25-1 assume true; 8582#func_to_recursive_line_27_to_27_0EXIT >#106#return; 8581#L25-1 assume true; 8577#func_to_recursive_line_27_to_27_0EXIT >#106#return; 8574#L25-1 assume true; 8573#func_to_recursive_line_27_to_27_0EXIT >#108#return; 8567#L47-1 call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 8552#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 8550#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 8553#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 8556#L41-1 assume true; 8554#func_to_recursive_line_26_to_27_0EXIT >#110#return; 8555#L41-1 assume true; 8586#func_to_recursive_line_26_to_27_0EXIT >#102#return; 8560#L67-1 call #t~mem11 := read~int#3(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 8547#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 8558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 8562#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4); 8551#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 8550#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 8553#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 8531#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8536#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8537#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8530#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8536#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8537#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8530#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8536#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8537#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8530#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8536#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8537#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8530#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8536#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8537#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8529#L25-1 assume true; 8532#func_to_recursive_line_27_to_27_0EXIT >#106#return; 8549#L25-1 assume true; 8585#func_to_recursive_line_27_to_27_0EXIT >#106#return; 8584#L25-1 assume true; 8582#func_to_recursive_line_27_to_27_0EXIT >#106#return; 8581#L25-1 assume true; 8577#func_to_recursive_line_27_to_27_0EXIT >#106#return; 8574#L25-1 assume true; 8573#func_to_recursive_line_27_to_27_0EXIT >#108#return; 8567#L47-1 call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 8552#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 8550#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 8553#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 8556#L41-1 assume true; 8554#func_to_recursive_line_26_to_27_0EXIT >#110#return; 8555#L41-1 assume true; 8586#func_to_recursive_line_26_to_27_0EXIT >#102#return; 8560#L67-1 call #t~mem11 := read~int#3(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 8547#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 8558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 8562#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 8563#L61-1 assume true; 8546#func_to_recursive_line_25_to_26_0EXIT >#104#return; 8548#L61-1 assume true; 8561#func_to_recursive_line_25_to_26_0EXIT >#104#return; 8580#L61-1 assume true; 8576#func_to_recursive_line_25_to_26_0EXIT >#104#return; 8572#L61-1 assume true; 8571#func_to_recursive_line_25_to_26_0EXIT >#98#return; 8559#L87-1 call #t~mem14 := read~int#1(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 8539#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 8544#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#1(~b.base, ~b.offset, 4); 8538#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~c.base, ~c.offset, 4); 8541#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 8558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 8562#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4); 8551#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 8550#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 8553#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 8531#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8536#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8537#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8530#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8536#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8537#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8530#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8536#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8537#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8530#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8536#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8537#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8530#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8536#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8537#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8529#L25-1 assume true; 8532#func_to_recursive_line_27_to_27_0EXIT >#106#return; 8549#L25-1 assume true; 8585#func_to_recursive_line_27_to_27_0EXIT >#106#return; 8584#L25-1 assume true; 8582#func_to_recursive_line_27_to_27_0EXIT >#106#return; 8581#L25-1 assume true; 8577#func_to_recursive_line_27_to_27_0EXIT >#106#return; 8574#L25-1 assume true; 8573#func_to_recursive_line_27_to_27_0EXIT >#108#return; 8567#L47-1 call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 8552#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 8550#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 8553#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 8556#L41-1 assume true; 8554#func_to_recursive_line_26_to_27_0EXIT >#110#return; 8555#L41-1 assume true; 8586#func_to_recursive_line_26_to_27_0EXIT >#102#return; 8560#L67-1 call #t~mem11 := read~int#3(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 8547#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 8558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 8562#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4); 8551#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 8550#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 8553#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 8531#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8536#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8537#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8530#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8536#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8537#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8530#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8536#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8537#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8530#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8536#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8537#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8530#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8536#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8537#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8529#L25-1 assume true; 8532#func_to_recursive_line_27_to_27_0EXIT >#106#return; 8549#L25-1 assume true; 8585#func_to_recursive_line_27_to_27_0EXIT >#106#return; 8584#L25-1 assume true; 8582#func_to_recursive_line_27_to_27_0EXIT >#106#return; 8581#L25-1 assume true; 8577#func_to_recursive_line_27_to_27_0EXIT >#106#return; 8574#L25-1 assume true; 8573#func_to_recursive_line_27_to_27_0EXIT >#108#return; 8567#L47-1 call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 8552#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 8550#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 8553#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 8556#L41-1 assume true; 8554#func_to_recursive_line_26_to_27_0EXIT >#110#return; 8555#L41-1 assume true; 8586#func_to_recursive_line_26_to_27_0EXIT >#102#return; 8560#L67-1 call #t~mem11 := read~int#3(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 8547#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 8558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 8562#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4); 8551#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 8550#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 8553#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 8531#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8536#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8537#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8530#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8536#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8537#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8530#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8536#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8537#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8530#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8536#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8537#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8530#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8536#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8537#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8529#L25-1 assume true; 8532#func_to_recursive_line_27_to_27_0EXIT >#106#return; 8549#L25-1 assume true; 8585#func_to_recursive_line_27_to_27_0EXIT >#106#return; 8584#L25-1 assume true; 8582#func_to_recursive_line_27_to_27_0EXIT >#106#return; 8581#L25-1 assume true; 8577#func_to_recursive_line_27_to_27_0EXIT >#106#return; 8574#L25-1 assume true; 8573#func_to_recursive_line_27_to_27_0EXIT >#108#return; 8567#L47-1 call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 8552#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 8550#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 8553#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 8556#L41-1 assume true; 8554#func_to_recursive_line_26_to_27_0EXIT >#110#return; 8555#L41-1 assume true; 8586#func_to_recursive_line_26_to_27_0EXIT >#102#return; 8560#L67-1 call #t~mem11 := read~int#3(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 8547#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 8558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 8562#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 8563#L61-1 assume true; 8546#func_to_recursive_line_25_to_26_0EXIT >#104#return; 8548#L61-1 assume true; 8561#func_to_recursive_line_25_to_26_0EXIT >#104#return; 8580#L61-1 assume true; 8576#func_to_recursive_line_25_to_26_0EXIT >#104#return; 8572#L61-1 assume true; 8571#func_to_recursive_line_25_to_26_0EXIT >#98#return; 8559#L87-1 call #t~mem14 := read~int#1(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 8539#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 8544#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#1(~b.base, ~b.offset, 4); 8538#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~c.base, ~c.offset, 4); 8541#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 8558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 8562#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4); 8551#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 8550#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 8553#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 8531#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8536#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8537#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8530#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8536#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8537#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8530#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8536#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8537#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8530#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8536#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8537#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8530#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8536#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8537#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8529#L25-1 assume true; 8532#func_to_recursive_line_27_to_27_0EXIT >#106#return; 8549#L25-1 assume true; 8585#func_to_recursive_line_27_to_27_0EXIT >#106#return; 8584#L25-1 assume true; 8582#func_to_recursive_line_27_to_27_0EXIT >#106#return; 8581#L25-1 assume true; 8577#func_to_recursive_line_27_to_27_0EXIT >#106#return; 8574#L25-1 assume true; 8573#func_to_recursive_line_27_to_27_0EXIT >#108#return; 8567#L47-1 call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 8552#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 8550#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 8553#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 8556#L41-1 assume true; 8554#func_to_recursive_line_26_to_27_0EXIT >#110#return; 8555#L41-1 assume true; 8586#func_to_recursive_line_26_to_27_0EXIT >#102#return; 8560#L67-1 call #t~mem11 := read~int#3(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 8547#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 8558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 8562#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4); 8551#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 8550#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 8553#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 8531#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8536#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8537#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8530#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8536#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8537#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8530#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8536#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8537#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8530#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8536#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8537#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8530#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8536#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8537#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8529#L25-1 assume true; 8532#func_to_recursive_line_27_to_27_0EXIT >#106#return; 8549#L25-1 assume true; 8585#func_to_recursive_line_27_to_27_0EXIT >#106#return; 8584#L25-1 assume true; 8582#func_to_recursive_line_27_to_27_0EXIT >#106#return; 8581#L25-1 assume true; 8577#func_to_recursive_line_27_to_27_0EXIT >#106#return; 8574#L25-1 assume true; 8573#func_to_recursive_line_27_to_27_0EXIT >#108#return; 8567#L47-1 call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 8552#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 8550#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 8553#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 8556#L41-1 assume true; 8554#func_to_recursive_line_26_to_27_0EXIT >#110#return; 8555#L41-1 assume true; 8586#func_to_recursive_line_26_to_27_0EXIT >#102#return; 8560#L67-1 call #t~mem11 := read~int#3(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 8547#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 8558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 8562#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4); 8551#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 8550#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 8553#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 8531#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8536#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8537#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8530#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8536#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8537#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8530#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8536#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8537#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8530#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8536#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8537#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8530#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8536#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8537#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8529#L25-1 assume true; 8532#func_to_recursive_line_27_to_27_0EXIT >#106#return; 8549#L25-1 assume true; 8585#func_to_recursive_line_27_to_27_0EXIT >#106#return; 8584#L25-1 assume true; 8582#func_to_recursive_line_27_to_27_0EXIT >#106#return; 8581#L25-1 assume true; 8577#func_to_recursive_line_27_to_27_0EXIT >#106#return; 8574#L25-1 assume true; 8573#func_to_recursive_line_27_to_27_0EXIT >#108#return; 8567#L47-1 call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 8552#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 8550#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 8553#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 8556#L41-1 assume true; 8554#func_to_recursive_line_26_to_27_0EXIT >#110#return; 8555#L41-1 assume true; 8586#func_to_recursive_line_26_to_27_0EXIT >#102#return; 8560#L67-1 call #t~mem11 := read~int#3(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 8547#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 8558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 8562#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 8563#L61-1 assume true; 8546#func_to_recursive_line_25_to_26_0EXIT >#104#return; 8548#L61-1 assume true; 8561#func_to_recursive_line_25_to_26_0EXIT >#104#return; 8580#L61-1 assume true; 8576#func_to_recursive_line_25_to_26_0EXIT >#104#return; 8572#L61-1 assume true; 8571#func_to_recursive_line_25_to_26_0EXIT >#98#return; 8559#L87-1 call #t~mem14 := read~int#1(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 8539#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 8544#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#1(~b.base, ~b.offset, 4); 8538#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#3(0, ~c.base, ~c.offset, 4); 8541#L87 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 8558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 8562#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4); 8551#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 8550#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 8553#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 8531#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8536#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8537#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8530#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8536#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8537#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8530#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8536#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8537#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8530#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8536#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8537#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8530#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8536#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8537#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8529#L25-1 assume true; 8532#func_to_recursive_line_27_to_27_0EXIT >#106#return; 8549#L25-1 assume true; 8585#func_to_recursive_line_27_to_27_0EXIT >#106#return; 8584#L25-1 assume true; 8582#func_to_recursive_line_27_to_27_0EXIT >#106#return; 8581#L25-1 assume true; 8577#func_to_recursive_line_27_to_27_0EXIT >#106#return; 8574#L25-1 assume true; 8573#func_to_recursive_line_27_to_27_0EXIT >#108#return; 8567#L47-1 call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 8552#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 8550#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 8553#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 8556#L41-1 assume true; 8554#func_to_recursive_line_26_to_27_0EXIT >#110#return; 8555#L41-1 assume true; 8586#func_to_recursive_line_26_to_27_0EXIT >#102#return; 8560#L67-1 call #t~mem11 := read~int#3(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 8547#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 8558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 8562#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4); 8551#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 8550#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 8553#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 8531#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8536#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8537#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8530#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8536#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8537#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8530#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8536#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8537#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8530#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8536#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8537#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8530#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8536#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8537#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8529#L25-1 assume true; 8532#func_to_recursive_line_27_to_27_0EXIT >#106#return; 8549#L25-1 assume true; 8585#func_to_recursive_line_27_to_27_0EXIT >#106#return; 8584#L25-1 assume true; 8582#func_to_recursive_line_27_to_27_0EXIT >#106#return; 8581#L25-1 assume true; 8577#func_to_recursive_line_27_to_27_0EXIT >#106#return; 8574#L25-1 assume true; 8573#func_to_recursive_line_27_to_27_0EXIT >#108#return; 8567#L47-1 call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 8552#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 8550#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 8553#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 8556#L41-1 assume true; 8554#func_to_recursive_line_26_to_27_0EXIT >#110#return; 8555#L41-1 assume true; 8586#func_to_recursive_line_26_to_27_0EXIT >#102#return; 8560#L67-1 call #t~mem11 := read~int#3(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 8547#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 8558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 8562#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#2(0, ~d.base, ~d.offset, 4); 8551#L67 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 8550#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 8553#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#4(0, ~e.base, ~e.offset, 4); 8531#L47 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8536#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8537#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8530#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8536#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8537#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8530#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8536#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8537#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8530#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8536#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8537#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#4(~e.base, ~e.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#4(1 + #t~mem5, ~e.base, ~e.offset, 4);havoc #t~mem5;havoc #t~pre6; 8530#L32 call func_to_recursive_line_27_to_27_0(~e.base, ~e.offset);< 8536#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;call #t~mem4 := read~int#4(~e.base, ~e.offset, 4); 8537#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 8529#L25-1 assume true; 8532#func_to_recursive_line_27_to_27_0EXIT >#106#return; 8549#L25-1 assume true; 8585#func_to_recursive_line_27_to_27_0EXIT >#106#return; 8584#L25-1 assume true; 8582#func_to_recursive_line_27_to_27_0EXIT >#106#return; 8581#L25-1 assume true; 8577#func_to_recursive_line_27_to_27_0EXIT >#106#return; 8574#L25-1 assume true; 8573#func_to_recursive_line_27_to_27_0EXIT >#108#return; 8567#L47-1 call #t~mem8 := read~int#2(~d.base, ~d.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#2(1 + #t~mem8, ~d.base, ~d.offset, 4);havoc #t~mem8;havoc #t~pre9; 8552#L52 call func_to_recursive_line_26_to_27_0(~e.base, ~e.offset, ~d.base, ~d.offset);< 8550#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem7 := read~int#2(~d.base, ~d.offset, 4); 8553#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 8556#L41-1 assume true; 8554#func_to_recursive_line_26_to_27_0EXIT >#110#return; 8555#L41-1 assume true; 8586#func_to_recursive_line_26_to_27_0EXIT >#102#return; 8560#L67-1 call #t~mem11 := read~int#3(~c.base, ~c.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#3(1 + #t~mem11, ~c.base, ~c.offset, 4);havoc #t~mem11;havoc #t~pre12; 8547#L72 call func_to_recursive_line_25_to_26_0(~e.base, ~e.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 8558#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#3(~c.base, ~c.offset, 4); 8562#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 8563#L61-1 assume true; 8546#func_to_recursive_line_25_to_26_0EXIT >#104#return; 8548#L61-1 assume true; 8561#func_to_recursive_line_25_to_26_0EXIT >#104#return; 8580#L61-1 assume true; 8576#func_to_recursive_line_25_to_26_0EXIT >#104#return; 8572#L61-1 assume true; 8571#func_to_recursive_line_25_to_26_0EXIT >#98#return; 8559#L87-1 call #t~mem14 := read~int#1(~b.base, ~b.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#1(1 + #t~mem14, ~b.base, ~b.offset, 4);havoc #t~mem14;havoc #t~pre15; 8539#L92 call func_to_recursive_line_24_to_25_0(~e.base, ~e.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 8544#$Ultimate##0 ~e.base, ~e.offset := #in~e.base, #in~e.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem13 := read~int#1(~b.base, ~b.offset, 4); 8538#L81 assume !(#t~mem13 < 6);havoc #t~mem13; 8542#L81-1 assume true; 8564#func_to_recursive_line_24_to_25_0EXIT >#100#return; 8565#L81-1 assume true; 8568#func_to_recursive_line_24_to_25_0EXIT >#100#return; 8583#L81-1 assume true; 8579#func_to_recursive_line_24_to_25_0EXIT >#100#return; 8578#L81-1 assume true; 8575#func_to_recursive_line_24_to_25_0EXIT >#100#return; 8570#L81-1 assume true; 8569#func_to_recursive_line_24_to_25_0EXIT >#112#return; 8533#L107-1 call #t~mem17 := read~int#5(~a.base, ~a.offset, 4);#t~pre18 := 1 + #t~mem17;call write~int#5(1 + #t~mem17, ~a.base, ~a.offset, 4);havoc #t~mem17;havoc #t~pre18; 8534#L112 call func_to_recursive_line_23_to_24_0(~a.base, ~a.offset, ~b.base, ~b.offset, ~c.base, ~c.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 8557#$Ultimate##0 [2023-11-26 11:56:42,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:56:42,708 INFO L85 PathProgramCache]: Analyzing trace with hash 82544, now seen corresponding path program 9 times [2023-11-26 11:56:42,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:56:42,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707630114] [2023-11-26 11:56:42,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:56:42,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:56:42,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:56:42,724 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:56:42,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:56:42,735 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:56:42,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:56:42,736 INFO L85 PathProgramCache]: Analyzing trace with hash -913851805, now seen corresponding path program 5 times [2023-11-26 11:56:42,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:56:42,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880820774] [2023-11-26 11:56:42,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:56:42,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:56:42,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:56:48,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-26 11:56:48,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat