./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 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/recursified_loop-simple/recursified_deep-nested.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dea78793c7130d873f751539350d9a84f129d659be765f9ed3f85c683976c43a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 23:18:42,836 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 23:18:42,939 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-10 23:18:42,945 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 23:18:42,946 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 23:18:42,946 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-10 23:18:42,978 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 23:18:42,980 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 23:18:42,980 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 23:18:42,982 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 23:18:42,983 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 23:18:42,983 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 23:18:42,983 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 23:18:42,986 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 23:18:42,986 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-10 23:18:42,986 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-10 23:18:42,986 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-10 23:18:42,987 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-10 23:18:42,987 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-10 23:18:42,987 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-10 23:18:42,987 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 23:18:42,988 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-10 23:18:42,989 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 23:18:42,989 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 23:18:42,989 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 23:18:42,990 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 23:18:42,990 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-10 23:18:42,990 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-10 23:18:42,990 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-10 23:18:42,991 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 23:18:42,991 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 23:18:42,991 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 23:18:42,991 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 23:18:42,992 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-10 23:18:42,992 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 23:18:42,992 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 23:18:42,993 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 23:18:42,993 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 23:18:42,993 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 23:18:42,994 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-10 23:18:42,994 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dea78793c7130d873f751539350d9a84f129d659be765f9ed3f85c683976c43a [2024-11-10 23:18:43,266 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 23:18:43,288 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 23:18:43,292 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 23:18:43,294 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 23:18:43,295 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 23:18:43,296 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_loop-simple/recursified_deep-nested.c [2024-11-10 23:18:44,771 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 23:18:44,962 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 23:18:44,962 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_deep-nested.c [2024-11-10 23:18:44,971 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f5e13054/ceb1878b4e65488cbab7044fb3e174a0/FLAGa49c49f6a [2024-11-10 23:18:44,984 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f5e13054/ceb1878b4e65488cbab7044fb3e174a0 [2024-11-10 23:18:44,987 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 23:18:44,989 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 23:18:44,990 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 23:18:44,990 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 23:18:44,999 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 23:18:45,000 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:18:44" (1/1) ... [2024-11-10 23:18:45,001 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@394d172b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:18:45, skipping insertion in model container [2024-11-10 23:18:45,001 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:18:44" (1/1) ... [2024-11-10 23:18:45,028 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 23:18:45,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 23:18:45,312 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 23:18:45,384 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 23:18:45,407 INFO L204 MainTranslator]: Completed translation [2024-11-10 23:18:45,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:18:45 WrapperNode [2024-11-10 23:18:45,408 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 23:18:45,410 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 23:18:45,410 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 23:18:45,411 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 23:18:45,420 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:18:45" (1/1) ... [2024-11-10 23:18:45,430 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:18:45" (1/1) ... [2024-11-10 23:18:45,450 INFO L138 Inliner]: procedures = 16, calls = 72, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 116 [2024-11-10 23:18:45,451 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 23:18:45,451 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 23:18:45,451 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 23:18:45,451 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 23:18:45,461 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:18:45" (1/1) ... [2024-11-10 23:18:45,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:18:45" (1/1) ... [2024-11-10 23:18:45,465 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:18:45" (1/1) ... [2024-11-10 23:18:45,498 INFO L175 MemorySlicer]: Split 38 memory accesses to 7 slices as follows [2, 6, 6, 6, 6, 7, 5]. 18 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0, 0]. The 11 writes are split as follows [0, 2, 2, 2, 2, 1, 2]. [2024-11-10 23:18:45,499 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:18:45" (1/1) ... [2024-11-10 23:18:45,499 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:18:45" (1/1) ... [2024-11-10 23:18:45,516 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:18:45" (1/1) ... [2024-11-10 23:18:45,516 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:18:45" (1/1) ... [2024-11-10 23:18:45,519 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:18:45" (1/1) ... [2024-11-10 23:18:45,525 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:18:45" (1/1) ... [2024-11-10 23:18:45,530 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 23:18:45,532 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 23:18:45,532 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 23:18:45,532 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 23:18:45,533 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:18:45" (1/1) ... [2024-11-10 23:18:45,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-10 23:18:45,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:18:45,564 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-10 23:18:45,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-10 23:18:45,606 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_12_to_13_0 [2024-11-10 23:18:45,606 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_12_to_13_0 [2024-11-10 23:18:45,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 23:18:45,606 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_13_to_14_0 [2024-11-10 23:18:45,606 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_13_to_14_0 [2024-11-10 23:18:45,606 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_11_to_12_0 [2024-11-10 23:18:45,606 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_11_to_12_0 [2024-11-10 23:18:45,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 23:18:45,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 23:18:45,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 23:18:45,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-10 23:18:45,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-10 23:18:45,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-10 23:18:45,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-10 23:18:45,607 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_14_to_16_0 [2024-11-10 23:18:45,607 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_14_to_16_0 [2024-11-10 23:18:45,608 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_10_to_11_0 [2024-11-10 23:18:45,608 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_10_to_11_0 [2024-11-10 23:18:45,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 23:18:45,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 23:18:45,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 23:18:45,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-10 23:18:45,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-10 23:18:45,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-10 23:18:45,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-10 23:18:45,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-10 23:18:45,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 23:18:45,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 23:18:45,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 23:18:45,609 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 23:18:45,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-10 23:18:45,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-10 23:18:45,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-10 23:18:45,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-10 23:18:45,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-10 23:18:45,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 23:18:45,730 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 23:18:45,732 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 23:18:46,006 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L130: call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset;call ULTIMATE.dealloc(main_~#b~0#1.base, main_~#b~0#1.offset);havoc main_~#b~0#1.base, main_~#b~0#1.offset;call ULTIMATE.dealloc(main_~#c~0#1.base, main_~#c~0#1.offset);havoc main_~#c~0#1.base, main_~#c~0#1.offset;call ULTIMATE.dealloc(main_~#d~0#1.base, main_~#d~0#1.offset);havoc main_~#d~0#1.base, main_~#d~0#1.offset;call ULTIMATE.dealloc(main_~#e~0#1.base, main_~#e~0#1.offset);havoc main_~#e~0#1.base, main_~#e~0#1.offset;call ULTIMATE.dealloc(main_~#uint32_max~0#1.base, main_~#uint32_max~0#1.offset);havoc main_~#uint32_max~0#1.base, main_~#uint32_max~0#1.offset; [2024-11-10 23:18:46,038 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-10 23:18:46,038 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 23:18:46,056 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 23:18:46,056 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 23:18:46,057 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 11:18:46 BoogieIcfgContainer [2024-11-10 23:18:46,057 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 23:18:46,057 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-10 23:18:46,057 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-10 23:18:46,062 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-10 23:18:46,063 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 23:18:46,063 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 11:18:44" (1/3) ... [2024-11-10 23:18:46,064 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1d7b5725 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:18:46, skipping insertion in model container [2024-11-10 23:18:46,064 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 23:18:46,064 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:18:45" (2/3) ... [2024-11-10 23:18:46,065 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1d7b5725 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 11:18:46, skipping insertion in model container [2024-11-10 23:18:46,065 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-10 23:18:46,065 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 11:18:46" (3/3) ... [2024-11-10 23:18:46,067 INFO L332 chiAutomizerObserver]: Analyzing ICFG recursified_deep-nested.c [2024-11-10 23:18:46,129 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-10 23:18:46,130 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-10 23:18:46,130 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-10 23:18:46,130 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-10 23:18:46,130 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-10 23:18:46,130 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-10 23:18:46,130 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-10 23:18:46,131 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-10 23:18:46,135 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-11-10 23:18:46,158 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 33 [2024-11-10 23:18:46,158 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:18:46,158 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:18:46,165 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-10 23:18:46,165 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 23:18:46,165 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-10 23:18:46,166 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-11-10 23:18:46,169 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 33 [2024-11-10 23:18:46,170 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:18:46,170 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:18:46,170 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-10 23:18:46,170 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 23:18:46,175 INFO L745 eck$LassoCheckResult]: Stem: 40#ULTIMATE.startENTRYtrue 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(14, 2);call #Ultimate.allocInit(12, 3); 19#ULTIMATE.init_returnLabel#1true assume true;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#5(4294967295, main_~#uint32_max~0#1.base, main_~#uint32_max~0#1.offset, 4);call write~int#6(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 5#L139-1true 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);< 28#func_to_recursive_line_10_to_11_0ENTRYtrue [2024-11-10 23:18:46,176 INFO L747 eck$LassoCheckResult]: Loop: 28#func_to_recursive_line_10_to_11_0ENTRYtrue ~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#6(~a.base, ~a.offset, 4);call #t~mem34 := read~int#5(~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#3(0, ~b.base, ~b.offset, 4); 51#L116-1true 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);< 36#func_to_recursive_line_11_to_12_0ENTRYtrue ~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#3(~b.base, ~b.offset, 4);call #t~mem30 := read~int#5(~uint32_max.base, ~uint32_max.offset, 4); 23#L90true assume !(#t~mem31 % 4294967296 < (#t~mem30 - 1) % 4294967296);havoc #t~mem31;havoc #t~mem30; 45#func_to_recursive_line_11_to_12_0FINALtrue assume true; 24#func_to_recursive_line_11_to_12_0EXITtrue >#73#return; 41#L116true call #t~mem36 := read~int#6(~a.base, ~a.offset, 4);#t~pre37 := 1 + #t~mem36;call write~int#6(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);< 28#func_to_recursive_line_10_to_11_0ENTRYtrue [2024-11-10 23:18:46,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:18:46,183 INFO L85 PathProgramCache]: Analyzing trace with hash 83402, now seen corresponding path program 1 times [2024-11-10 23:18:46,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:18:46,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779266007] [2024-11-10 23:18:46,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:18:46,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:18:46,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:18:46,400 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:18:46,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:18:46,483 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:18:46,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:18:46,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1971170713, now seen corresponding path program 1 times [2024-11-10 23:18:46,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:18:46,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616711085] [2024-11-10 23:18:46,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:18:46,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:18:46,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:47,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:18:47,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:47,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 23:18:47,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:18:47,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616711085] [2024-11-10 23:18:47,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616711085] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 23:18:47,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 23:18:47,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 23:18:47,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532871050] [2024-11-10 23:18:47,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 23:18:47,324 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 23:18:47,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:18:47,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 23:18:47,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 23:18:47,362 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-11-10 23:18:47,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:18:47,774 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2024-11-10 23:18:47,776 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 76 transitions. [2024-11-10 23:18:47,783 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 32 [2024-11-10 23:18:47,790 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 51 states and 66 transitions. [2024-11-10 23:18:47,791 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2024-11-10 23:18:47,791 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2024-11-10 23:18:47,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 66 transitions. [2024-11-10 23:18:47,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 23:18:47,796 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 66 transitions. [2024-11-10 23:18:47,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 66 transitions. [2024-11-10 23:18:47,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2024-11-10 23:18:47,824 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-11-10 23:18:47,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2024-11-10 23:18:47,826 INFO L240 hiAutomatonCegarLoop]: Abstraction has 45 states and 57 transitions. [2024-11-10 23:18:47,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 23:18:47,833 INFO L425 stractBuchiCegarLoop]: Abstraction has 45 states and 57 transitions. [2024-11-10 23:18:47,833 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-10 23:18:47,834 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 57 transitions. [2024-11-10 23:18:47,835 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 32 [2024-11-10 23:18:47,836 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:18:47,836 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:18:47,837 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-10 23:18:47,837 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 23:18:47,837 INFO L745 eck$LassoCheckResult]: Stem: 166#ULTIMATE.startENTRY 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(14, 2);call #Ultimate.allocInit(12, 3); 167#ULTIMATE.init_returnLabel#1 assume true;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#5(4294967295, main_~#uint32_max~0#1.base, main_~#uint32_max~0#1.offset, 4);call write~int#6(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 143#L139-1 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);< 142#func_to_recursive_line_10_to_11_0ENTRY [2024-11-10 23:18:47,837 INFO L747 eck$LassoCheckResult]: Loop: 142#func_to_recursive_line_10_to_11_0ENTRY ~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#6(~a.base, ~a.offset, 4);call #t~mem34 := read~int#5(~uint32_max.base, ~uint32_max.offset, 4); 145#L110 assume #t~mem35 % 4294967296 < (#t~mem34 - 1) % 4294967296;havoc #t~mem35;havoc #t~mem34;call write~int#3(0, ~b.base, ~b.offset, 4); 153#L116-1 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);< 154#func_to_recursive_line_11_to_12_0ENTRY ~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#3(~b.base, ~b.offset, 4);call #t~mem30 := read~int#5(~uint32_max.base, ~uint32_max.offset, 4); 163#L90 assume #t~mem31 % 4294967296 < (#t~mem30 - 1) % 4294967296;havoc #t~mem31;havoc #t~mem30;call write~int#4(0, ~c.base, ~c.offset, 4); 137#L96-1 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);< 158#func_to_recursive_line_12_to_13_0ENTRY ~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#4(~c.base, ~c.offset, 4);call #t~mem26 := read~int#5(~uint32_max.base, ~uint32_max.offset, 4); 159#L70 assume !(#t~mem27 % 4294967296 < (#t~mem26 - 1) % 4294967296);havoc #t~mem27;havoc #t~mem26; 136#func_to_recursive_line_12_to_13_0FINAL assume true; 139#func_to_recursive_line_12_to_13_0EXIT >#67#return; 156#L96 call #t~mem32 := read~int#3(~b.base, ~b.offset, 4);#t~pre33 := 1 + #t~mem32;call write~int#3(1 + #t~mem32, ~b.base, ~b.offset, 4);havoc #t~mem32;havoc #t~pre33; 152#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);< 154#func_to_recursive_line_11_to_12_0ENTRY ~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#3(~b.base, ~b.offset, 4);call #t~mem30 := read~int#5(~uint32_max.base, ~uint32_max.offset, 4); 163#L90 assume !(#t~mem31 % 4294967296 < (#t~mem30 - 1) % 4294967296);havoc #t~mem31;havoc #t~mem30; 173#func_to_recursive_line_11_to_12_0FINAL assume true; 174#func_to_recursive_line_11_to_12_0EXIT >#65#return; 175#func_to_recursive_line_11_to_12_0FINAL assume true; 176#func_to_recursive_line_11_to_12_0EXIT >#73#return; 169#L116 call #t~mem36 := read~int#6(~a.base, ~a.offset, 4);#t~pre37 := 1 + #t~mem36;call write~int#6(1 + #t~mem36, ~a.base, ~a.offset, 4);havoc #t~mem36;havoc #t~pre37; 144#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);< 142#func_to_recursive_line_10_to_11_0ENTRY [2024-11-10 23:18:47,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:18:47,838 INFO L85 PathProgramCache]: Analyzing trace with hash 83402, now seen corresponding path program 2 times [2024-11-10 23:18:47,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:18:47,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872585185] [2024-11-10 23:18:47,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:18:47,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:18:47,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:18:47,878 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:18:47,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:18:47,897 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:18:47,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:18:47,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1370545883, now seen corresponding path program 1 times [2024-11-10 23:18:47,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:18:47,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132074928] [2024-11-10 23:18:47,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:18:47,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:18:47,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:48,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:18:48,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:48,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:18:48,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:48,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 23:18:48,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:48,708 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 23:18:48,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:18:48,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132074928] [2024-11-10 23:18:48,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132074928] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 23:18:48,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515515437] [2024-11-10 23:18:48,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:18:48,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 23:18:48,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:18:48,713 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 23:18:48,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 23:18:48,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:48,851 INFO L255 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-10 23:18:48,854 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:18:49,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 23:18:49,632 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 23:18:49,632 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 23:18:50,357 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 23:18:50,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515515437] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 23:18:50,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 23:18:50,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 10] total 26 [2024-11-10 23:18:50,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419761568] [2024-11-10 23:18:50,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 23:18:50,359 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 23:18:50,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:18:50,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-10 23:18:50,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2024-11-10 23:18:50,360 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. cyclomatic complexity: 17 Second operand has 26 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 21 states have internal predecessors, (35), 8 states have call successors, (10), 8 states have call predecessors, (10), 8 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-10 23:18:51,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:18:51,343 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2024-11-10 23:18:51,343 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 65 transitions. [2024-11-10 23:18:51,344 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 32 [2024-11-10 23:18:51,346 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 65 transitions. [2024-11-10 23:18:51,346 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2024-11-10 23:18:51,346 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2024-11-10 23:18:51,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 65 transitions. [2024-11-10 23:18:51,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 23:18:51,347 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 65 transitions. [2024-11-10 23:18:51,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 65 transitions. [2024-11-10 23:18:51,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2024-11-10 23:18:51,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 35 states have internal predecessors, (39), 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) [2024-11-10 23:18:51,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2024-11-10 23:18:51,352 INFO L240 hiAutomatonCegarLoop]: Abstraction has 47 states and 59 transitions. [2024-11-10 23:18:51,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 23:18:51,353 INFO L425 stractBuchiCegarLoop]: Abstraction has 47 states and 59 transitions. [2024-11-10 23:18:51,353 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-10 23:18:51,353 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 59 transitions. [2024-11-10 23:18:51,354 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 32 [2024-11-10 23:18:51,354 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:18:51,354 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:18:51,355 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-10 23:18:51,355 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-11-10 23:18:51,355 INFO L745 eck$LassoCheckResult]: Stem: 446#ULTIMATE.startENTRY 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(14, 2);call #Ultimate.allocInit(12, 3); 447#ULTIMATE.init_returnLabel#1 assume true;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#5(4294967295, main_~#uint32_max~0#1.base, main_~#uint32_max~0#1.offset, 4);call write~int#6(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 427#L139-1 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);< 426#func_to_recursive_line_10_to_11_0ENTRY [2024-11-10 23:18:51,356 INFO L747 eck$LassoCheckResult]: Loop: 426#func_to_recursive_line_10_to_11_0ENTRY ~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#6(~a.base, ~a.offset, 4);call #t~mem34 := read~int#5(~uint32_max.base, ~uint32_max.offset, 4); 429#L110 assume #t~mem35 % 4294967296 < (#t~mem34 - 1) % 4294967296;havoc #t~mem35;havoc #t~mem34;call write~int#3(0, ~b.base, ~b.offset, 4); 432#L116-1 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);< 433#func_to_recursive_line_11_to_12_0ENTRY ~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#3(~b.base, ~b.offset, 4);call #t~mem30 := read~int#5(~uint32_max.base, ~uint32_max.offset, 4); 443#L90 assume #t~mem31 % 4294967296 < (#t~mem30 - 1) % 4294967296;havoc #t~mem31;havoc #t~mem30;call write~int#4(0, ~c.base, ~c.offset, 4); 416#L96-1 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);< 437#func_to_recursive_line_12_to_13_0ENTRY ~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#4(~c.base, ~c.offset, 4);call #t~mem26 := read~int#5(~uint32_max.base, ~uint32_max.offset, 4); 439#L70 assume #t~mem27 % 4294967296 < (#t~mem26 - 1) % 4294967296;havoc #t~mem27;havoc #t~mem26;call write~int#1(0, ~d.base, ~d.offset, 4); 423#L76-1 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);< 430#func_to_recursive_line_13_to_14_0ENTRY ~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#1(~d.base, ~d.offset, 4);call #t~mem22 := read~int#5(~uint32_max.base, ~uint32_max.offset, 4); 452#L50 assume !(#t~mem23 % 4294967296 < (#t~mem22 - 1) % 4294967296);havoc #t~mem23;havoc #t~mem22; 425#func_to_recursive_line_13_to_14_0FINAL assume true; 421#func_to_recursive_line_13_to_14_0EXIT >#59#return; 424#L76 call #t~mem28 := read~int#4(~c.base, ~c.offset, 4);#t~pre29 := 1 + #t~mem28;call write~int#4(1 + #t~mem28, ~c.base, ~c.offset, 4);havoc #t~mem28;havoc #t~pre29; 417#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);< 437#func_to_recursive_line_12_to_13_0ENTRY ~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#4(~c.base, ~c.offset, 4);call #t~mem26 := read~int#5(~uint32_max.base, ~uint32_max.offset, 4); 439#L70 assume !(#t~mem27 % 4294967296 < (#t~mem26 - 1) % 4294967296);havoc #t~mem27;havoc #t~mem26; 415#func_to_recursive_line_12_to_13_0FINAL assume true; 418#func_to_recursive_line_12_to_13_0EXIT >#57#return; 436#func_to_recursive_line_12_to_13_0FINAL assume true; 457#func_to_recursive_line_12_to_13_0EXIT >#67#return; 438#L96 call #t~mem32 := read~int#3(~b.base, ~b.offset, 4);#t~pre33 := 1 + #t~mem32;call write~int#3(1 + #t~mem32, ~b.base, ~b.offset, 4);havoc #t~mem32;havoc #t~pre33; 431#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);< 433#func_to_recursive_line_11_to_12_0ENTRY ~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#3(~b.base, ~b.offset, 4);call #t~mem30 := read~int#5(~uint32_max.base, ~uint32_max.offset, 4); 443#L90 assume !(#t~mem31 % 4294967296 < (#t~mem30 - 1) % 4294967296);havoc #t~mem31;havoc #t~mem30; 453#func_to_recursive_line_11_to_12_0FINAL assume true; 454#func_to_recursive_line_11_to_12_0EXIT >#65#return; 455#func_to_recursive_line_11_to_12_0FINAL assume true; 456#func_to_recursive_line_11_to_12_0EXIT >#73#return; 449#L116 call #t~mem36 := read~int#6(~a.base, ~a.offset, 4);#t~pre37 := 1 + #t~mem36;call write~int#6(1 + #t~mem36, ~a.base, ~a.offset, 4);havoc #t~mem36;havoc #t~pre37; 428#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);< 426#func_to_recursive_line_10_to_11_0ENTRY [2024-11-10 23:18:51,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:18:51,356 INFO L85 PathProgramCache]: Analyzing trace with hash 83402, now seen corresponding path program 3 times [2024-11-10 23:18:51,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:18:51,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003690958] [2024-11-10 23:18:51,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:18:51,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:18:51,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:18:51,376 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:18:51,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:18:51,392 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:18:51,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:18:51,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1125247938, now seen corresponding path program 1 times [2024-11-10 23:18:51,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:18:51,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983475194] [2024-11-10 23:18:51,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:18:51,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:18:51,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:51,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:18:51,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:52,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:18:52,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:52,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:18:52,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:52,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 23:18:52,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:52,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-10 23:18:52,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:52,438 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-10 23:18:52,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:18:52,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983475194] [2024-11-10 23:18:52,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983475194] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 23:18:52,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318763012] [2024-11-10 23:18:52,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:18:52,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 23:18:52,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:18:52,462 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 23:18:52,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 23:18:52,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:52,625 INFO L255 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-10 23:18:52,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:18:52,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 23:18:53,370 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 23:18:53,371 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 23:18:53,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318763012] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 23:18:53,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 23:18:53,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 21 [2024-11-10 23:18:53,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727900812] [2024-11-10 23:18:53,833 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 23:18:53,833 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 23:18:53,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:18:53,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-10 23:18:53,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2024-11-10 23:18:53,836 INFO L87 Difference]: Start difference. First operand 47 states and 59 transitions. cyclomatic complexity: 17 Second operand has 21 states, 18 states have (on average 2.111111111111111) internal successors, (38), 16 states have internal predecessors, (38), 8 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (10), 3 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-10 23:18:54,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:18:54,908 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2024-11-10 23:18:54,909 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 64 transitions. [2024-11-10 23:18:54,910 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 32 [2024-11-10 23:18:54,911 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 64 transitions. [2024-11-10 23:18:54,912 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2024-11-10 23:18:54,912 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2024-11-10 23:18:54,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 64 transitions. [2024-11-10 23:18:54,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 23:18:54,913 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 64 transitions. [2024-11-10 23:18:54,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 64 transitions. [2024-11-10 23:18:54,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2024-11-10 23:18:54,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.25) internal successors, (40), 36 states have internal predecessors, (40), 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) [2024-11-10 23:18:54,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2024-11-10 23:18:54,917 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 61 transitions. [2024-11-10 23:18:54,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-10 23:18:54,918 INFO L425 stractBuchiCegarLoop]: Abstraction has 49 states and 61 transitions. [2024-11-10 23:18:54,919 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-10 23:18:54,919 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 61 transitions. [2024-11-10 23:18:54,920 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 32 [2024-11-10 23:18:54,920 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:18:54,920 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:18:54,921 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-10 23:18:54,921 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] [2024-11-10 23:18:54,921 INFO L745 eck$LassoCheckResult]: Stem: 780#ULTIMATE.startENTRY 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(14, 2);call #Ultimate.allocInit(12, 3); 781#ULTIMATE.init_returnLabel#1 assume true;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#5(4294967295, main_~#uint32_max~0#1.base, main_~#uint32_max~0#1.offset, 4);call write~int#6(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 755#L139-1 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);< 754#func_to_recursive_line_10_to_11_0ENTRY [2024-11-10 23:18:54,922 INFO L747 eck$LassoCheckResult]: Loop: 754#func_to_recursive_line_10_to_11_0ENTRY ~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#6(~a.base, ~a.offset, 4);call #t~mem34 := read~int#5(~uint32_max.base, ~uint32_max.offset, 4); 757#L110 assume #t~mem35 % 4294967296 < (#t~mem34 - 1) % 4294967296;havoc #t~mem35;havoc #t~mem34;call write~int#3(0, ~b.base, ~b.offset, 4); 764#L116-1 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);< 765#func_to_recursive_line_11_to_12_0ENTRY ~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#3(~b.base, ~b.offset, 4);call #t~mem30 := read~int#5(~uint32_max.base, ~uint32_max.offset, 4); 776#L90 assume #t~mem31 % 4294967296 < (#t~mem30 - 1) % 4294967296;havoc #t~mem31;havoc #t~mem30;call write~int#4(0, ~c.base, ~c.offset, 4); 750#L96-1 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);< 769#func_to_recursive_line_12_to_13_0ENTRY ~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#4(~c.base, ~c.offset, 4);call #t~mem26 := read~int#5(~uint32_max.base, ~uint32_max.offset, 4); 771#L70 assume #t~mem27 % 4294967296 < (#t~mem26 - 1) % 4294967296;havoc #t~mem27;havoc #t~mem26;call write~int#1(0, ~d.base, ~d.offset, 4); 759#L76-1 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);< 762#func_to_recursive_line_13_to_14_0ENTRY ~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#1(~d.base, ~d.offset, 4);call #t~mem22 := read~int#5(~uint32_max.base, ~uint32_max.offset, 4); 786#L50 assume #t~mem23 % 4294967296 < (#t~mem22 - 1) % 4294967296;havoc #t~mem23;havoc #t~mem22;call write~int#2(0, ~e.base, ~e.offset, 4); 745#L56-1 call func_to_recursive_line_14_to_16_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);< 766#func_to_recursive_line_14_to_16_0ENTRY ~uint32_max#1.base, ~uint32_max#1.offset := #in~uint32_max#1.base, #in~uint32_max#1.offset;~c#1.base, ~c#1.offset := #in~c#1.base, #in~c#1.offset;~b#1.base, ~b#1.offset := #in~b#1.base, #in~b#1.offset;~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~e#1.base, ~e#1.offset := #in~e#1.base, #in~e#1.offset;~d#1.base, ~d#1.offset := #in~d#1.base, #in~d#1.offset;call #t~mem5#1 := read~int#2(~e#1.base, ~e#1.offset, 4);call #t~mem4#1 := read~int#5(~uint32_max#1.base, ~uint32_max#1.offset, 4); 773#L25 assume !(#t~mem5#1 % 4294967296 < (#t~mem4#1 - 1) % 4294967296);havoc #t~mem5#1;havoc #t~mem4#1; 778#func_to_recursive_line_14_to_16_0FINAL assume true; 782#func_to_recursive_line_14_to_16_0EXIT >#63#return; 772#L56 call #t~mem24 := read~int#1(~d.base, ~d.offset, 4);#t~pre25 := 1 + #t~mem24;call write~int#1(1 + #t~mem24, ~d.base, ~d.offset, 4);havoc #t~mem24;havoc #t~pre25; 760#L61 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);< 762#func_to_recursive_line_13_to_14_0ENTRY ~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#1(~d.base, ~d.offset, 4);call #t~mem22 := read~int#5(~uint32_max.base, ~uint32_max.offset, 4); 786#L50 assume !(#t~mem23 % 4294967296 < (#t~mem22 - 1) % 4294967296);havoc #t~mem23;havoc #t~mem22; 774#func_to_recursive_line_13_to_14_0FINAL assume true; 758#func_to_recursive_line_13_to_14_0EXIT >#61#return; 761#func_to_recursive_line_13_to_14_0FINAL assume true; 791#func_to_recursive_line_13_to_14_0EXIT >#59#return; 779#L76 call #t~mem28 := read~int#4(~c.base, ~c.offset, 4);#t~pre29 := 1 + #t~mem28;call write~int#4(1 + #t~mem28, ~c.base, ~c.offset, 4);havoc #t~mem28;havoc #t~pre29; 749#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);< 769#func_to_recursive_line_12_to_13_0ENTRY ~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#4(~c.base, ~c.offset, 4);call #t~mem26 := read~int#5(~uint32_max.base, ~uint32_max.offset, 4); 771#L70 assume !(#t~mem27 % 4294967296 < (#t~mem26 - 1) % 4294967296);havoc #t~mem27;havoc #t~mem26; 748#func_to_recursive_line_12_to_13_0FINAL assume true; 751#func_to_recursive_line_12_to_13_0EXIT >#57#return; 767#func_to_recursive_line_12_to_13_0FINAL assume true; 792#func_to_recursive_line_12_to_13_0EXIT >#67#return; 770#L96 call #t~mem32 := read~int#3(~b.base, ~b.offset, 4);#t~pre33 := 1 + #t~mem32;call write~int#3(1 + #t~mem32, ~b.base, ~b.offset, 4);havoc #t~mem32;havoc #t~pre33; 763#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);< 765#func_to_recursive_line_11_to_12_0ENTRY ~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#3(~b.base, ~b.offset, 4);call #t~mem30 := read~int#5(~uint32_max.base, ~uint32_max.offset, 4); 776#L90 assume !(#t~mem31 % 4294967296 < (#t~mem30 - 1) % 4294967296);havoc #t~mem31;havoc #t~mem30; 787#func_to_recursive_line_11_to_12_0FINAL assume true; 788#func_to_recursive_line_11_to_12_0EXIT >#65#return; 789#func_to_recursive_line_11_to_12_0FINAL assume true; 790#func_to_recursive_line_11_to_12_0EXIT >#73#return; 783#L116 call #t~mem36 := read~int#6(~a.base, ~a.offset, 4);#t~pre37 := 1 + #t~mem36;call write~int#6(1 + #t~mem36, ~a.base, ~a.offset, 4);havoc #t~mem36;havoc #t~pre37; 756#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);< 754#func_to_recursive_line_10_to_11_0ENTRY [2024-11-10 23:18:54,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:18:54,922 INFO L85 PathProgramCache]: Analyzing trace with hash 83402, now seen corresponding path program 4 times [2024-11-10 23:18:54,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:18:54,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952389155] [2024-11-10 23:18:54,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:18:54,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:18:54,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:18:54,942 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:18:54,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:18:54,953 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:18:54,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:18:54,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1361781542, now seen corresponding path program 1 times [2024-11-10 23:18:54,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:18:54,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099082532] [2024-11-10 23:18:54,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:18:54,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:18:55,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:55,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:18:55,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:55,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:18:55,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:55,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:18:56,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:56,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:18:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:56,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-10 23:18:56,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:56,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-10 23:18:56,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:56,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-10 23:18:56,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:56,262 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-10 23:18:56,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:18:56,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099082532] [2024-11-10 23:18:56,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099082532] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 23:18:56,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664216244] [2024-11-10 23:18:56,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:18:56,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 23:18:56,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:18:56,266 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 23:18:56,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 23:18:56,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:18:56,478 INFO L255 TraceCheckSpWp]: Trace formula consists of 616 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-11-10 23:18:56,482 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:18:56,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 23:18:57,258 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 23:18:57,259 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 23:18:57,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664216244] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 23:18:57,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 23:18:57,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 16] total 24 [2024-11-10 23:18:57,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944910935] [2024-11-10 23:18:57,929 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 23:18:57,930 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-10 23:18:57,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 23:18:57,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-10 23:18:57,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=659, Unknown=0, NotChecked=0, Total=756 [2024-11-10 23:18:57,931 INFO L87 Difference]: Start difference. First operand 49 states and 61 transitions. cyclomatic complexity: 17 Second operand has 24 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 18 states have internal predecessors, (46), 8 states have call successors, (15), 9 states have call predecessors, (15), 7 states have return successors, (13), 5 states have call predecessors, (13), 8 states have call successors, (13) [2024-11-10 23:18:58,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 23:18:58,903 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2024-11-10 23:18:58,903 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 63 transitions. [2024-11-10 23:18:58,905 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 32 [2024-11-10 23:18:58,906 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 63 transitions. [2024-11-10 23:18:58,906 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2024-11-10 23:18:58,906 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2024-11-10 23:18:58,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 63 transitions. [2024-11-10 23:18:58,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-10 23:18:58,907 INFO L218 hiAutomatonCegarLoop]: Abstraction has 51 states and 63 transitions. [2024-11-10 23:18:58,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 63 transitions. [2024-11-10 23:18:58,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-10 23:18:58,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 37 states have internal predecessors, (41), 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) [2024-11-10 23:18:58,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2024-11-10 23:18:58,912 INFO L240 hiAutomatonCegarLoop]: Abstraction has 51 states and 63 transitions. [2024-11-10 23:18:58,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-10 23:18:58,913 INFO L425 stractBuchiCegarLoop]: Abstraction has 51 states and 63 transitions. [2024-11-10 23:18:58,913 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-10 23:18:58,913 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 63 transitions. [2024-11-10 23:18:58,914 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 32 [2024-11-10 23:18:58,914 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-10 23:18:58,914 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-10 23:18:58,915 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-10 23:18:58,915 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 23:18:58,915 INFO L745 eck$LassoCheckResult]: Stem: 1223#ULTIMATE.startENTRY 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(14, 2);call #Ultimate.allocInit(12, 3); 1224#ULTIMATE.init_returnLabel#1 assume true;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#5(4294967295, main_~#uint32_max~0#1.base, main_~#uint32_max~0#1.offset, 4);call write~int#6(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 1203#L139-1 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);< 1201#func_to_recursive_line_10_to_11_0ENTRY [2024-11-10 23:18:58,916 INFO L747 eck$LassoCheckResult]: Loop: 1201#func_to_recursive_line_10_to_11_0ENTRY ~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#6(~a.base, ~a.offset, 4);call #t~mem34 := read~int#5(~uint32_max.base, ~uint32_max.offset, 4); 1204#L110 assume #t~mem35 % 4294967296 < (#t~mem34 - 1) % 4294967296;havoc #t~mem35;havoc #t~mem34;call write~int#3(0, ~b.base, ~b.offset, 4); 1207#L116-1 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);< 1208#func_to_recursive_line_11_to_12_0ENTRY ~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#3(~b.base, ~b.offset, 4);call #t~mem30 := read~int#5(~uint32_max.base, ~uint32_max.offset, 4); 1221#L90 assume #t~mem31 % 4294967296 < (#t~mem30 - 1) % 4294967296;havoc #t~mem31;havoc #t~mem30;call write~int#4(0, ~c.base, ~c.offset, 4); 1192#L96-1 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);< 1212#func_to_recursive_line_12_to_13_0ENTRY ~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#4(~c.base, ~c.offset, 4);call #t~mem26 := read~int#5(~uint32_max.base, ~uint32_max.offset, 4); 1214#L70 assume #t~mem27 % 4294967296 < (#t~mem26 - 1) % 4294967296;havoc #t~mem27;havoc #t~mem26;call write~int#1(0, ~d.base, ~d.offset, 4); 1199#L76-1 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);< 1205#func_to_recursive_line_13_to_14_0ENTRY ~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#1(~d.base, ~d.offset, 4);call #t~mem22 := read~int#5(~uint32_max.base, ~uint32_max.offset, 4); 1230#L50 assume #t~mem23 % 4294967296 < (#t~mem22 - 1) % 4294967296;havoc #t~mem23;havoc #t~mem22;call write~int#2(0, ~e.base, ~e.offset, 4); 1188#L56-1 call func_to_recursive_line_14_to_16_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);< 1209#func_to_recursive_line_14_to_16_0ENTRY ~uint32_max#1.base, ~uint32_max#1.offset := #in~uint32_max#1.base, #in~uint32_max#1.offset;~c#1.base, ~c#1.offset := #in~c#1.base, #in~c#1.offset;~b#1.base, ~b#1.offset := #in~b#1.base, #in~b#1.offset;~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~e#1.base, ~e#1.offset := #in~e#1.base, #in~e#1.offset;~d#1.base, ~d#1.offset := #in~d#1.base, #in~d#1.offset;call #t~mem5#1 := read~int#2(~e#1.base, ~e#1.offset, 4);call #t~mem4#1 := read~int#5(~uint32_max#1.base, ~uint32_max#1.offset, 4); 1216#L25 assume #t~mem5#1 % 4294967296 < (#t~mem4#1 - 1) % 4294967296;havoc #t~mem5#1;havoc #t~mem4#1;call #t~mem6#1 := read~int#6(~a#1.base, ~a#1.offset, 4);call #t~mem7#1 := read~int#3(~b#1.base, ~b#1.offset, 4);#t~short10#1 := #t~mem6#1 % 4294967296 == #t~mem7#1 % 4294967296; 1219#L29-7 assume !#t~short10#1; 1195#L29-6 #t~short13#1 := #t~short10#1; 1196#L29-5 assume !#t~short13#1; 1210#L29-4 #t~short16#1 := #t~short13#1; 1228#L29-3 assume !#t~short16#1; 1187#L29-2 #t~short19#1 := #t~short16#1; 1190#L29-1 assume !#t~short19#1; 1218#L29 assume !#t~short19#1;havoc #t~mem6#1;havoc #t~mem7#1;havoc #t~mem8#1;havoc #t~mem9#1;havoc #t~short10#1;havoc #t~mem11#1;havoc #t~mem12#1;havoc #t~short13#1;havoc #t~mem14#1;havoc #t~mem15#1;havoc #t~short16#1;havoc #t~mem18#1;havoc #t~mem17#1;havoc #t~short19#1; 1229#L39 call #t~mem20#1 := read~int#2(~e#1.base, ~e#1.offset, 4);#t~pre21#1 := 1 + #t~mem20#1;call write~int#2(1 + #t~mem20#1, ~e#1.base, ~e#1.offset, 4);havoc #t~mem20#1;havoc #t~pre21#1; 1189#L41 call func_to_recursive_line_14_to_16_0(~uint32_max#1.base, ~uint32_max#1.offset, ~c#1.base, ~c#1.offset, ~b#1.base, ~b#1.offset, ~a#1.base, ~a#1.offset, ~e#1.base, ~e#1.offset, ~d#1.base, ~d#1.offset);< 1209#func_to_recursive_line_14_to_16_0ENTRY ~uint32_max#1.base, ~uint32_max#1.offset := #in~uint32_max#1.base, #in~uint32_max#1.offset;~c#1.base, ~c#1.offset := #in~c#1.base, #in~c#1.offset;~b#1.base, ~b#1.offset := #in~b#1.base, #in~b#1.offset;~a#1.base, ~a#1.offset := #in~a#1.base, #in~a#1.offset;~e#1.base, ~e#1.offset := #in~e#1.base, #in~e#1.offset;~d#1.base, ~d#1.offset := #in~d#1.base, #in~d#1.offset;call #t~mem5#1 := read~int#2(~e#1.base, ~e#1.offset, 4);call #t~mem4#1 := read~int#5(~uint32_max#1.base, ~uint32_max#1.offset, 4); 1216#L25 assume !(#t~mem5#1 % 4294967296 < (#t~mem4#1 - 1) % 4294967296);havoc #t~mem5#1;havoc #t~mem4#1; 1220#func_to_recursive_line_14_to_16_0FINAL assume true; 1225#func_to_recursive_line_14_to_16_0EXIT >#69#return; 1226#func_to_recursive_line_14_to_16_0FINAL assume true; 1236#func_to_recursive_line_14_to_16_0EXIT >#63#return; 1215#L56 call #t~mem24 := read~int#1(~d.base, ~d.offset, 4);#t~pre25 := 1 + #t~mem24;call write~int#1(1 + #t~mem24, ~d.base, ~d.offset, 4);havoc #t~mem24;havoc #t~pre25; 1198#L61 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);< 1205#func_to_recursive_line_13_to_14_0ENTRY ~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#1(~d.base, ~d.offset, 4);call #t~mem22 := read~int#5(~uint32_max.base, ~uint32_max.offset, 4); 1230#L50 assume !(#t~mem23 % 4294967296 < (#t~mem22 - 1) % 4294967296);havoc #t~mem23;havoc #t~mem22; 1217#func_to_recursive_line_13_to_14_0FINAL assume true; 1197#func_to_recursive_line_13_to_14_0EXIT >#61#return; 1200#func_to_recursive_line_13_to_14_0FINAL assume true; 1235#func_to_recursive_line_13_to_14_0EXIT >#59#return; 1222#L76 call #t~mem28 := read~int#4(~c.base, ~c.offset, 4);#t~pre29 := 1 + #t~mem28;call write~int#4(1 + #t~mem28, ~c.base, ~c.offset, 4);havoc #t~mem28;havoc #t~pre29; 1193#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);< 1212#func_to_recursive_line_12_to_13_0ENTRY ~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#4(~c.base, ~c.offset, 4);call #t~mem26 := read~int#5(~uint32_max.base, ~uint32_max.offset, 4); 1214#L70 assume !(#t~mem27 % 4294967296 < (#t~mem26 - 1) % 4294967296);havoc #t~mem27;havoc #t~mem26; 1191#func_to_recursive_line_12_to_13_0FINAL assume true; 1194#func_to_recursive_line_12_to_13_0EXIT >#57#return; 1211#func_to_recursive_line_12_to_13_0FINAL assume true; 1237#func_to_recursive_line_12_to_13_0EXIT >#67#return; 1213#L96 call #t~mem32 := read~int#3(~b.base, ~b.offset, 4);#t~pre33 := 1 + #t~mem32;call write~int#3(1 + #t~mem32, ~b.base, ~b.offset, 4);havoc #t~mem32;havoc #t~pre33; 1206#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);< 1208#func_to_recursive_line_11_to_12_0ENTRY ~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#3(~b.base, ~b.offset, 4);call #t~mem30 := read~int#5(~uint32_max.base, ~uint32_max.offset, 4); 1221#L90 assume !(#t~mem31 % 4294967296 < (#t~mem30 - 1) % 4294967296);havoc #t~mem31;havoc #t~mem30; 1231#func_to_recursive_line_11_to_12_0FINAL assume true; 1232#func_to_recursive_line_11_to_12_0EXIT >#65#return; 1233#func_to_recursive_line_11_to_12_0FINAL assume true; 1234#func_to_recursive_line_11_to_12_0EXIT >#73#return; 1227#L116 call #t~mem36 := read~int#6(~a.base, ~a.offset, 4);#t~pre37 := 1 + #t~mem36;call write~int#6(1 + #t~mem36, ~a.base, ~a.offset, 4);havoc #t~mem36;havoc #t~pre37; 1202#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);< 1201#func_to_recursive_line_10_to_11_0ENTRY [2024-11-10 23:18:58,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:18:58,917 INFO L85 PathProgramCache]: Analyzing trace with hash 83402, now seen corresponding path program 5 times [2024-11-10 23:18:58,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:18:58,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142598896] [2024-11-10 23:18:58,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:18:58,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:18:58,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:18:58,931 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 23:18:58,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 23:18:58,946 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 23:18:58,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 23:18:58,947 INFO L85 PathProgramCache]: Analyzing trace with hash 12078459, now seen corresponding path program 1 times [2024-11-10 23:18:58,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 23:18:58,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900616141] [2024-11-10 23:18:58,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:18:58,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 23:18:58,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:00,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:00,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:01,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:02,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:05,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:05,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:06,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-10 23:19:06,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:07,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 23:19:07,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:08,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 23:19:08,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:08,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 23:19:08,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:08,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 23:19:08,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:08,620 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 23:19:08,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 23:19:08,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900616141] [2024-11-10 23:19:08,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900616141] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 23:19:08,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389396830] [2024-11-10 23:19:08,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 23:19:08,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 23:19:08,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 23:19:08,625 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 23:19:08,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 23:19:08,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 23:19:08,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 710 conjuncts, 221 conjuncts are in the unsatisfiable core [2024-11-10 23:19:08,837 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 23:19:08,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 23:19:29,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 23:19:30,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 23:19:46,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3