./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/recursified_loop-simple/recursified_deep-nested.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff310f87-c543-460a-8e25-fbec3b13339c/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff310f87-c543-460a-8e25-fbec3b13339c/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff310f87-c543-460a-8e25-fbec3b13339c/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff310f87-c543-460a-8e25-fbec3b13339c/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/recursified_loop-simple/recursified_deep-nested.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff310f87-c543-460a-8e25-fbec3b13339c/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff310f87-c543-460a-8e25-fbec3b13339c/bin/uautomizer-verify-4GaUIPS5ZU --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 dea78793c7130d873f751539350d9a84f129d659be765f9ed3f85c683976c43a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 21:56:30,731 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 21:56:30,833 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff310f87-c543-460a-8e25-fbec3b13339c/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-10-31 21:56:30,843 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 21:56:30,846 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 21:56:30,883 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 21:56:30,886 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 21:56:30,887 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 21:56:30,888 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 21:56:30,889 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 21:56:30,890 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 21:56:30,891 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 21:56:30,891 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 21:56:30,892 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-31 21:56:30,894 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-31 21:56:30,894 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-31 21:56:30,895 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-31 21:56:30,895 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-31 21:56:30,895 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-31 21:56:30,896 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 21:56:30,899 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-31 21:56:30,900 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 21:56:30,901 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 21:56:30,901 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 21:56:30,901 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 21:56:30,902 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-31 21:56:30,902 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-31 21:56:30,920 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-31 21:56:30,920 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 21:56:30,920 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-31 21:56:30,921 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 21:56:30,921 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 21:56:30,921 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-31 21:56:30,922 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 21:56:30,922 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 21:56:30,924 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 21:56:30,925 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 21:56:30,925 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 21:56:30,926 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-31 21:56:30,926 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_ff310f87-c543-460a-8e25-fbec3b13339c/bin/uautomizer-verify-4GaUIPS5ZU/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_ff310f87-c543-460a-8e25-fbec3b13339c/bin/uautomizer-verify-4GaUIPS5ZU 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 -> dea78793c7130d873f751539350d9a84f129d659be765f9ed3f85c683976c43a [2024-10-31 21:56:31,399 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 21:56:31,467 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 21:56:31,474 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 21:56:31,476 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 21:56:31,481 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 21:56:31,482 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff310f87-c543-460a-8e25-fbec3b13339c/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/recursified_loop-simple/recursified_deep-nested.c Unable to find full path for "g++" [2024-10-31 21:56:33,708 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 21:56:34,005 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 21:56:34,006 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff310f87-c543-460a-8e25-fbec3b13339c/sv-benchmarks/c/recursified_loop-simple/recursified_deep-nested.c [2024-10-31 21:56:34,014 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff310f87-c543-460a-8e25-fbec3b13339c/bin/uautomizer-verify-4GaUIPS5ZU/data/65c840e40/3ee9e28027884e4c81f9dc8d92f235d1/FLAG9e3deaca7 [2024-10-31 21:56:34,275 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff310f87-c543-460a-8e25-fbec3b13339c/bin/uautomizer-verify-4GaUIPS5ZU/data/65c840e40/3ee9e28027884e4c81f9dc8d92f235d1 [2024-10-31 21:56:34,279 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 21:56:34,281 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 21:56:34,285 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 21:56:34,285 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 21:56:34,295 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 21:56:34,296 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:56:34" (1/1) ... [2024-10-31 21:56:34,297 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a65ce8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:34, skipping insertion in model container [2024-10-31 21:56:34,298 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:56:34" (1/1) ... [2024-10-31 21:56:34,327 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 21:56:34,574 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:56:34,587 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 21:56:34,624 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:56:34,646 INFO L204 MainTranslator]: Completed translation [2024-10-31 21:56:34,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:34 WrapperNode [2024-10-31 21:56:34,647 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 21:56:34,648 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 21:56:34,648 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 21:56:34,648 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 21:56:34,656 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:34" (1/1) ... [2024-10-31 21:56:34,665 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:34" (1/1) ... [2024-10-31 21:56:34,688 INFO L138 Inliner]: procedures = 16, calls = 72, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 116 [2024-10-31 21:56:34,688 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 21:56:34,689 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 21:56:34,689 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 21:56:34,689 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 21:56:34,702 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:34" (1/1) ... [2024-10-31 21:56:34,702 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:34" (1/1) ... [2024-10-31 21:56:34,705 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:34" (1/1) ... [2024-10-31 21:56:34,730 INFO L175 MemorySlicer]: Split 38 memory accesses to 7 slices as follows [6, 2, 5, 6, 6, 6, 7]. 18 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0, 0, 0, 0, 0]. The 11 writes are split as follows [2, 0, 2, 2, 2, 2, 1]. [2024-10-31 21:56:34,730 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:34" (1/1) ... [2024-10-31 21:56:34,730 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:34" (1/1) ... [2024-10-31 21:56:34,742 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:34" (1/1) ... [2024-10-31 21:56:34,745 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:34" (1/1) ... [2024-10-31 21:56:34,747 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:34" (1/1) ... [2024-10-31 21:56:34,749 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:34" (1/1) ... [2024-10-31 21:56:34,753 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 21:56:34,754 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 21:56:34,754 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 21:56:34,754 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 21:56:34,755 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:34" (1/1) ... [2024-10-31 21:56:34,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-31 21:56:34,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff310f87-c543-460a-8e25-fbec3b13339c/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:56:34,794 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff310f87-c543-460a-8e25-fbec3b13339c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-31 21:56:34,796 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff310f87-c543-460a-8e25-fbec3b13339c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-31 21:56:34,829 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_12_to_13_0 [2024-10-31 21:56:34,829 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_12_to_13_0 [2024-10-31 21:56:34,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 21:56:34,829 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_13_to_14_0 [2024-10-31 21:56:34,829 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_13_to_14_0 [2024-10-31 21:56:34,830 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_11_to_12_0 [2024-10-31 21:56:34,830 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_11_to_12_0 [2024-10-31 21:56:34,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 21:56:34,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-31 21:56:34,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-31 21:56:34,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-31 21:56:34,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-31 21:56:34,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-31 21:56:34,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-31 21:56:34,831 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_14_to_16_0 [2024-10-31 21:56:34,831 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_14_to_16_0 [2024-10-31 21:56:34,831 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_10_to_11_0 [2024-10-31 21:56:34,831 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_10_to_11_0 [2024-10-31 21:56:34,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-31 21:56:34,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-31 21:56:34,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-31 21:56:34,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-31 21:56:34,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-31 21:56:34,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-31 21:56:34,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-31 21:56:34,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-31 21:56:34,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 21:56:34,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 21:56:34,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-31 21:56:34,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-31 21:56:34,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-31 21:56:34,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-31 21:56:34,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-31 21:56:34,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-31 21:56:34,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-31 21:56:34,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-31 21:56:34,985 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 21:56:34,986 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 21:56:35,418 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-10-31 21:56:35,418 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 21:56:35,438 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 21:56:35,438 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-31 21:56:35,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:56:35 BoogieIcfgContainer [2024-10-31 21:56:35,439 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 21:56:35,440 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-31 21:56:35,440 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-31 21:56:35,445 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-31 21:56:35,446 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-31 21:56:35,446 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 31.10 09:56:34" (1/3) ... [2024-10-31 21:56:35,448 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4298c370 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.10 09:56:35, skipping insertion in model container [2024-10-31 21:56:35,448 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-31 21:56:35,448 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:56:34" (2/3) ... [2024-10-31 21:56:35,449 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4298c370 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 31.10 09:56:35, skipping insertion in model container [2024-10-31 21:56:35,449 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-31 21:56:35,449 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:56:35" (3/3) ... [2024-10-31 21:56:35,450 INFO L332 chiAutomizerObserver]: Analyzing ICFG recursified_deep-nested.c [2024-10-31 21:56:35,534 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-31 21:56:35,535 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-31 21:56:35,535 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-31 21:56:35,535 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-31 21:56:35,535 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-31 21:56:35,535 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-31 21:56:35,535 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-31 21:56:35,536 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-31 21:56:35,541 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) [2024-10-31 21:56:35,570 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 33 [2024-10-31 21:56:35,571 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 21:56:35,571 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 21:56:35,580 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-31 21:56:35,580 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:56:35,580 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-31 21:56:35,581 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) [2024-10-31 21:56:35,586 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 33 [2024-10-31 21:56:35,586 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 21:56:35,586 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 21:56:35,587 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-31 21:56:35,587 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:56:35,597 INFO L745 eck$LassoCheckResult]: Stem: 20#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#1(48, 1, 0, 1);call write~init~int#1(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); 33#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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, main_~#uint32_max~0#1.base, main_~#uint32_max~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call main_~#uint32_max~0#1.base, main_~#uint32_max~0#1.offset := #Ultimate.allocOnStack(4);call write~int#6(4294967295, main_~#uint32_max~0#1.base, main_~#uint32_max~0#1.offset, 4);call write~int#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 19#L139true call func_to_recursive_line_10_to_11_0(main_~#uint32_max~0#1.base, main_~#uint32_max~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 35#$Ultimate##0true [2024-10-31 21:56:35,598 INFO L747 eck$LassoCheckResult]: Loop: 35#$Ultimate##0true ~uint32_max.base, ~uint32_max.offset := #in~uint32_max.base, #in~uint32_max.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem35 := read~int#2(~a.base, ~a.offset, 4);call #t~mem34 := read~int#6(~uint32_max.base, ~uint32_max.offset, 4); 17#L110true assume #t~mem35 % 4294967296 < (#t~mem34 - 1) % 4294967296;havoc #t~mem35;havoc #t~mem34;call write~int#0(0, ~b.base, ~b.offset, 4); 42#L116true call func_to_recursive_line_11_to_12_0(~uint32_max.base, ~uint32_max.offset, ~c.base, ~c.offset, ~b.base, ~b.offset, ~a.base, ~a.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 30#$Ultimate##0true ~uint32_max.base, ~uint32_max.offset := #in~uint32_max.base, #in~uint32_max.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem31 := read~int#0(~b.base, ~b.offset, 4);call #t~mem30 := read~int#6(~uint32_max.base, ~uint32_max.offset, 4); 24#L90true assume !(#t~mem31 % 4294967296 < (#t~mem30 - 1) % 4294967296);havoc #t~mem31;havoc #t~mem30; 22#L90-1true assume true; 25#func_to_recursive_line_11_to_12_0EXITtrue >#112#return; 51#L116-1true call #t~mem36 := read~int#2(~a.base, ~a.offset, 4);#t~pre37 := 1 + #t~mem36;call write~int#2(1 + #t~mem36, ~a.base, ~a.offset, 4);havoc #t~mem36;havoc #t~pre37; 18#L121true call func_to_recursive_line_10_to_11_0(~uint32_max.base, ~uint32_max.offset, ~c.base, ~c.offset, ~b.base, ~b.offset, ~a.base, ~a.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 35#$Ultimate##0true [2024-10-31 21:56:35,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:56:35,605 INFO L85 PathProgramCache]: Analyzing trace with hash 118256, now seen corresponding path program 1 times [2024-10-31 21:56:35,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:56:35,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356666434] [2024-10-31 21:56:35,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:56:35,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:56:35,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:56:35,876 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 21:56:35,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:56:36,022 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 21:56:36,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:56:36,026 INFO L85 PathProgramCache]: Analyzing trace with hash 376946881, now seen corresponding path program 1 times [2024-10-31 21:56:36,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:56:36,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222345804] [2024-10-31 21:56:36,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:56:36,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:56:36,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:36,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-31 21:56:36,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:37,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:56:37,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:56:37,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222345804] [2024-10-31 21:56:37,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222345804] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:56:37,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:56:37,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 21:56:37,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613844160] [2024-10-31 21:56:37,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:56:37,036 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-31 21:56:37,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:56:37,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 21:56:37,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-31 21:56:37,089 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 7 states, 6 states have (on average 1.0) internal successors, (6), 5 states have internal predecessors, (6), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-31 21:56:37,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:56:37,921 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2024-10-31 21:56:37,926 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 76 transitions. [2024-10-31 21:56:37,941 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 32 [2024-10-31 21:56:37,952 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 51 states and 66 transitions. [2024-10-31 21:56:37,955 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2024-10-31 21:56:37,956 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2024-10-31 21:56:37,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 66 transitions. [2024-10-31 21:56:37,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-31 21:56:37,961 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 66 transitions. [2024-10-31 21:56:37,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 66 transitions. [2024-10-31 21:56:37,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2024-10-31 21:56:37,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 34 states have internal predecessors, (38), 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) [2024-10-31 21:56:38,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2024-10-31 21:56:38,007 INFO L240 hiAutomatonCegarLoop]: Abstraction has 45 states and 57 transitions. [2024-10-31 21:56:38,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 21:56:38,015 INFO L425 stractBuchiCegarLoop]: Abstraction has 45 states and 57 transitions. [2024-10-31 21:56:38,015 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-31 21:56:38,015 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 57 transitions. [2024-10-31 21:56:38,017 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 32 [2024-10-31 21:56:38,018 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 21:56:38,018 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 21:56:38,019 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-31 21:56:38,019 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:56:38,019 INFO L745 eck$LassoCheckResult]: Stem: 171#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#1(48, 1, 0, 1);call write~init~int#1(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); 148#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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, main_~#uint32_max~0#1.base, main_~#uint32_max~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call main_~#uint32_max~0#1.base, main_~#uint32_max~0#1.offset := #Ultimate.allocOnStack(4);call write~int#6(4294967295, main_~#uint32_max~0#1.base, main_~#uint32_max~0#1.offset, 4);call write~int#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 149#L139 call func_to_recursive_line_10_to_11_0(main_~#uint32_max~0#1.base, main_~#uint32_max~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 153#$Ultimate##0 [2024-10-31 21:56:38,020 INFO L747 eck$LassoCheckResult]: Loop: 153#$Ultimate##0 ~uint32_max.base, ~uint32_max.offset := #in~uint32_max.base, #in~uint32_max.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem35 := read~int#2(~a.base, ~a.offset, 4);call #t~mem34 := read~int#6(~uint32_max.base, ~uint32_max.offset, 4); 155#L110 assume #t~mem35 % 4294967296 < (#t~mem34 - 1) % 4294967296;havoc #t~mem35;havoc #t~mem34;call write~int#0(0, ~b.base, ~b.offset, 4); 140#L116 call func_to_recursive_line_11_to_12_0(~uint32_max.base, ~uint32_max.offset, ~c.base, ~c.offset, ~b.base, ~b.offset, ~a.base, ~a.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 138#$Ultimate##0 ~uint32_max.base, ~uint32_max.offset := #in~uint32_max.base, #in~uint32_max.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem31 := read~int#0(~b.base, ~b.offset, 4);call #t~mem30 := read~int#6(~uint32_max.base, ~uint32_max.offset, 4); 141#L90 assume #t~mem31 % 4294967296 < (#t~mem30 - 1) % 4294967296;havoc #t~mem31;havoc #t~mem30;call write~int#5(0, ~c.base, ~c.offset, 4); 160#L96 call func_to_recursive_line_12_to_13_0(~uint32_max.base, ~uint32_max.offset, ~c.base, ~c.offset, ~b.base, ~b.offset, ~a.base, ~a.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 164#$Ultimate##0 ~uint32_max.base, ~uint32_max.offset := #in~uint32_max.base, #in~uint32_max.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem27 := read~int#5(~c.base, ~c.offset, 4);call #t~mem26 := read~int#6(~uint32_max.base, ~uint32_max.offset, 4); 165#L70 assume !(#t~mem27 % 4294967296 < (#t~mem26 - 1) % 4294967296);havoc #t~mem27;havoc #t~mem26; 162#L70-1 assume true; 158#func_to_recursive_line_12_to_13_0EXIT >#106#return; 161#L96-1 call #t~mem32 := read~int#0(~b.base, ~b.offset, 4);#t~pre33 := 1 + #t~mem32;call write~int#0(1 + #t~mem32, ~b.base, ~b.offset, 4);havoc #t~mem32;havoc #t~pre33; 139#L101 call func_to_recursive_line_11_to_12_0(~uint32_max.base, ~uint32_max.offset, ~c.base, ~c.offset, ~b.base, ~b.offset, ~a.base, ~a.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 138#$Ultimate##0 ~uint32_max.base, ~uint32_max.offset := #in~uint32_max.base, #in~uint32_max.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem31 := read~int#0(~b.base, ~b.offset, 4);call #t~mem30 := read~int#6(~uint32_max.base, ~uint32_max.offset, 4); 141#L90 assume !(#t~mem31 % 4294967296 < (#t~mem30 - 1) % 4294967296);havoc #t~mem31;havoc #t~mem30; 172#L90-1 assume true; 173#func_to_recursive_line_11_to_12_0EXIT >#108#return; 174#L90-1 assume true; 176#func_to_recursive_line_11_to_12_0EXIT >#112#return; 175#L116-1 call #t~mem36 := read~int#2(~a.base, ~a.offset, 4);#t~pre37 := 1 + #t~mem36;call write~int#2(1 + #t~mem36, ~a.base, ~a.offset, 4);havoc #t~mem36;havoc #t~pre37; 154#L121 call func_to_recursive_line_10_to_11_0(~uint32_max.base, ~uint32_max.offset, ~c.base, ~c.offset, ~b.base, ~b.offset, ~a.base, ~a.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 153#$Ultimate##0 [2024-10-31 21:56:38,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:56:38,020 INFO L85 PathProgramCache]: Analyzing trace with hash 118256, now seen corresponding path program 2 times [2024-10-31 21:56:38,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:56:38,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244051910] [2024-10-31 21:56:38,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:56:38,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:56:38,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:56:38,061 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 21:56:38,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:56:38,094 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 21:56:38,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:56:38,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1072601781, now seen corresponding path program 1 times [2024-10-31 21:56:38,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:56:38,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579713378] [2024-10-31 21:56:38,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:56:38,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:56:38,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:38,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-31 21:56:38,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:38,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-31 21:56:38,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:39,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-31 21:56:39,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:39,181 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-31 21:56:39,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:56:39,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579713378] [2024-10-31 21:56:39,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579713378] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 21:56:39,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776208811] [2024-10-31 21:56:39,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:56:39,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 21:56:39,182 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff310f87-c543-460a-8e25-fbec3b13339c/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:56:39,194 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff310f87-c543-460a-8e25-fbec3b13339c/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 21:56:39,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ff310f87-c543-460a-8e25-fbec3b13339c/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-31 21:56:39,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:56:39,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-10-31 21:56:39,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 21:56:39,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-31 21:56:39,880 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-31 21:56:39,882 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 21:56:39,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776208811] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:56:39,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-31 21:56:39,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2024-10-31 21:56:39,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715877237] [2024-10-31 21:56:39,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:56:39,885 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-31 21:56:39,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:56:39,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 21:56:39,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-10-31 21:56:39,887 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. cyclomatic complexity: 17 Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-31 21:56:52,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 12.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-31 21:57:04,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 12.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-31 21:57:16,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 12.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-31 21:57:16,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:57:16,583 INFO L93 Difference]: Finished difference Result 72 states and 92 transitions. [2024-10-31 21:57:16,583 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 92 transitions. [2024-10-31 21:57:16,586 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 49 [2024-10-31 21:57:16,590 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 70 states and 90 transitions. [2024-10-31 21:57:16,595 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 70 [2024-10-31 21:57:16,595 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2024-10-31 21:57:16,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 90 transitions. [2024-10-31 21:57:16,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-31 21:57:16,596 INFO L218 hiAutomatonCegarLoop]: Abstraction has 70 states and 90 transitions. [2024-10-31 21:57:16,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 90 transitions. [2024-10-31 21:57:16,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 47. [2024-10-31 21:57:16,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 32 states have (on average 1.25) internal successors, (40), 35 states have internal predecessors, (40), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-10-31 21:57:16,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2024-10-31 21:57:16,607 INFO L240 hiAutomatonCegarLoop]: Abstraction has 47 states and 59 transitions. [2024-10-31 21:57:16,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 21:57:16,608 INFO L425 stractBuchiCegarLoop]: Abstraction has 47 states and 59 transitions. [2024-10-31 21:57:16,608 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-31 21:57:16,608 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 59 transitions. [2024-10-31 21:57:16,609 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 32 [2024-10-31 21:57:16,610 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-31 21:57:16,610 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-31 21:57:16,611 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-10-31 21:57:16,613 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] [2024-10-31 21:57:16,613 INFO L745 eck$LassoCheckResult]: Stem: 385#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#1(48, 1, 0, 1);call write~init~int#1(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); 361#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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, main_~#uint32_max~0#1.base, main_~#uint32_max~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call main_~#e~0#1.base, main_~#e~0#1.offset := #Ultimate.allocOnStack(4);call main_~#uint32_max~0#1.base, main_~#uint32_max~0#1.offset := #Ultimate.allocOnStack(4);call write~int#6(4294967295, main_~#uint32_max~0#1.base, main_~#uint32_max~0#1.offset, 4);call write~int#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 362#L139 call func_to_recursive_line_10_to_11_0(main_~#uint32_max~0#1.base, main_~#uint32_max~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#e~0#1.base, main_~#e~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset);< 366#$Ultimate##0 [2024-10-31 21:57:16,614 INFO L747 eck$LassoCheckResult]: Loop: 366#$Ultimate##0 ~uint32_max.base, ~uint32_max.offset := #in~uint32_max.base, #in~uint32_max.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem35 := read~int#2(~a.base, ~a.offset, 4);call #t~mem34 := read~int#6(~uint32_max.base, ~uint32_max.offset, 4); 368#L110 assume #t~mem35 % 4294967296 < (#t~mem34 - 1) % 4294967296;havoc #t~mem35;havoc #t~mem34;call write~int#0(0, ~b.base, ~b.offset, 4); 353#L116 call func_to_recursive_line_11_to_12_0(~uint32_max.base, ~uint32_max.offset, ~c.base, ~c.offset, ~b.base, ~b.offset, ~a.base, ~a.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 351#$Ultimate##0 ~uint32_max.base, ~uint32_max.offset := #in~uint32_max.base, #in~uint32_max.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem31 := read~int#0(~b.base, ~b.offset, 4);call #t~mem30 := read~int#6(~uint32_max.base, ~uint32_max.offset, 4); 354#L90 assume #t~mem31 % 4294967296 < (#t~mem30 - 1) % 4294967296;havoc #t~mem31;havoc #t~mem30;call write~int#5(0, ~c.base, ~c.offset, 4); 374#L96 call func_to_recursive_line_12_to_13_0(~uint32_max.base, ~uint32_max.offset, ~c.base, ~c.offset, ~b.base, ~b.offset, ~a.base, ~a.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 377#$Ultimate##0 ~uint32_max.base, ~uint32_max.offset := #in~uint32_max.base, #in~uint32_max.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem27 := read~int#5(~c.base, ~c.offset, 4);call #t~mem26 := read~int#6(~uint32_max.base, ~uint32_max.offset, 4); 378#L70 assume #t~mem27 % 4294967296 < (#t~mem26 - 1) % 4294967296;havoc #t~mem27;havoc #t~mem26;call write~int#4(0, ~d.base, ~d.offset, 4); 357#L76 call func_to_recursive_line_13_to_14_0(~uint32_max.base, ~uint32_max.offset, ~c.base, ~c.offset, ~b.base, ~b.offset, ~a.base, ~a.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 364#$Ultimate##0 ~uint32_max.base, ~uint32_max.offset := #in~uint32_max.base, #in~uint32_max.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem23 := read~int#4(~d.base, ~d.offset, 4);call #t~mem22 := read~int#6(~uint32_max.base, ~uint32_max.offset, 4); 383#L50 assume !(#t~mem23 % 4294967296 < (#t~mem22 - 1) % 4294967296);havoc #t~mem23;havoc #t~mem22; 358#L50-1 assume true; 355#func_to_recursive_line_13_to_14_0EXIT >#98#return; 359#L76-1 call #t~mem28 := read~int#5(~c.base, ~c.offset, 4);#t~pre29 := 1 + #t~mem28;call write~int#5(1 + #t~mem28, ~c.base, ~c.offset, 4);havoc #t~mem28;havoc #t~pre29; 373#L81 call func_to_recursive_line_12_to_13_0(~uint32_max.base, ~uint32_max.offset, ~c.base, ~c.offset, ~b.base, ~b.offset, ~a.base, ~a.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 384#$Ultimate##0 ~uint32_max.base, ~uint32_max.offset := #in~uint32_max.base, #in~uint32_max.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem27 := read~int#5(~c.base, ~c.offset, 4);call #t~mem26 := read~int#6(~uint32_max.base, ~uint32_max.offset, 4); 390#L70 assume !(#t~mem27 % 4294967296 < (#t~mem26 - 1) % 4294967296);havoc #t~mem27;havoc #t~mem26; 375#L70-1 assume true; 372#func_to_recursive_line_12_to_13_0EXIT >#100#return; 375#L70-1 assume true; 372#func_to_recursive_line_12_to_13_0EXIT >#106#return; 376#L96-1 call #t~mem32 := read~int#0(~b.base, ~b.offset, 4);#t~pre33 := 1 + #t~mem32;call write~int#0(1 + #t~mem32, ~b.base, ~b.offset, 4);havoc #t~mem32;havoc #t~pre33; 352#L101 call func_to_recursive_line_11_to_12_0(~uint32_max.base, ~uint32_max.offset, ~c.base, ~c.offset, ~b.base, ~b.offset, ~a.base, ~a.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 351#$Ultimate##0 ~uint32_max.base, ~uint32_max.offset := #in~uint32_max.base, #in~uint32_max.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~b.base, ~b.offset := #in~b.base, #in~b.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~e.base, ~e.offset := #in~e.base, #in~e.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem31 := read~int#0(~b.base, ~b.offset, 4);call #t~mem30 := read~int#6(~uint32_max.base, ~uint32_max.offset, 4); 354#L90 assume !(#t~mem31 % 4294967296 < (#t~mem30 - 1) % 4294967296);havoc #t~mem31;havoc #t~mem30; 386#L90-1 assume true; 387#func_to_recursive_line_11_to_12_0EXIT >#108#return; 388#L90-1 assume true; 391#func_to_recursive_line_11_to_12_0EXIT >#112#return; 389#L116-1 call #t~mem36 := read~int#2(~a.base, ~a.offset, 4);#t~pre37 := 1 + #t~mem36;call write~int#2(1 + #t~mem36, ~a.base, ~a.offset, 4);havoc #t~mem36;havoc #t~pre37; 367#L121 call func_to_recursive_line_10_to_11_0(~uint32_max.base, ~uint32_max.offset, ~c.base, ~c.offset, ~b.base, ~b.offset, ~a.base, ~a.offset, ~e.base, ~e.offset, ~d.base, ~d.offset);< 366#$Ultimate##0 [2024-10-31 21:57:16,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:16,614 INFO L85 PathProgramCache]: Analyzing trace with hash 118256, now seen corresponding path program 3 times [2024-10-31 21:57:16,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:16,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623824530] [2024-10-31 21:57:16,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:16,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:16,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:57:16,642 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 21:57:16,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:57:16,658 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 21:57:16,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:57:16,659 INFO L85 PathProgramCache]: Analyzing trace with hash 2046612426, now seen corresponding path program 1 times [2024-10-31 21:57:16,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:57:16,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169886236] [2024-10-31 21:57:16,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:57:16,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:57:16,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat