/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/verifythis/tree_del_rec.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-06 22:24:33,685 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-06 22:24:33,688 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-06 22:24:33,725 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-06 22:24:33,726 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-06 22:24:33,728 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-06 22:24:33,730 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-06 22:24:33,732 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-06 22:24:33,734 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-06 22:24:33,736 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-06 22:24:33,737 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-06 22:24:33,739 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-06 22:24:33,739 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-06 22:24:33,740 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-06 22:24:33,742 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-06 22:24:33,743 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-06 22:24:33,744 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-06 22:24:33,746 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-06 22:24:33,748 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-06 22:24:33,750 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-06 22:24:33,753 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-06 22:24:33,754 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-06 22:24:33,756 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-06 22:24:33,758 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-06 22:24:33,761 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-06 22:24:33,762 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-06 22:24:33,762 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-06 22:24:33,764 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-06 22:24:33,764 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-06 22:24:33,766 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-06 22:24:33,766 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-06 22:24:33,767 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-06 22:24:33,769 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-06 22:24:33,770 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-06 22:24:33,785 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-06 22:24:33,786 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-06 22:24:33,787 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-06 22:24:33,788 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-06 22:24:33,788 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-06 22:24:33,792 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-06 22:24:33,793 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-06 22:24:33,796 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-06 22:24:33,856 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-06 22:24:33,856 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-06 22:24:33,861 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-06 22:24:33,862 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-06 22:24:33,862 INFO L138 SettingsManager]: * Use SBE=true [2020-11-06 22:24:33,862 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-06 22:24:33,863 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-06 22:24:33,863 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-06 22:24:33,863 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-06 22:24:33,863 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-06 22:24:33,865 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-06 22:24:33,865 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-06 22:24:33,865 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-06 22:24:33,865 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-06 22:24:33,865 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-06 22:24:33,866 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-06 22:24:33,866 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-06 22:24:33,866 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-06 22:24:33,866 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-06 22:24:33,867 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-06 22:24:33,867 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-06 22:24:33,867 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-06 22:24:33,867 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-06 22:24:33,867 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-06 22:24:33,868 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-06 22:24:33,868 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-06 22:24:33,868 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-06 22:24:33,868 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-06 22:24:33,868 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-06 22:24:33,869 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2020-11-06 22:24:34,351 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-06 22:24:34,399 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-06 22:24:34,403 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-06 22:24:34,405 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-06 22:24:34,406 INFO L275 PluginConnector]: CDTParser initialized [2020-11-06 22:24:34,407 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/tree_del_rec.c [2020-11-06 22:24:34,506 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6be4b467/4708d7281ed448a889adb070d9fd4afa/FLAGdecacac0d [2020-11-06 22:24:35,298 INFO L306 CDTParser]: Found 1 translation units. [2020-11-06 22:24:35,300 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_rec.c [2020-11-06 22:24:35,310 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6be4b467/4708d7281ed448a889adb070d9fd4afa/FLAGdecacac0d [2020-11-06 22:24:35,597 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6be4b467/4708d7281ed448a889adb070d9fd4afa [2020-11-06 22:24:35,601 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-06 22:24:35,608 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-06 22:24:35,611 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-06 22:24:35,611 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-06 22:24:35,616 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-06 22:24:35,618 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:24:35" (1/1) ... [2020-11-06 22:24:35,622 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78be8191 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:35, skipping insertion in model container [2020-11-06 22:24:35,623 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:24:35" (1/1) ... [2020-11-06 22:24:35,632 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-06 22:24:35,662 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-06 22:24:35,891 WARN L1500 CHandler]: Possible shadowing of function min [2020-11-06 22:24:35,893 WARN L1500 CHandler]: Possible shadowing of function min [2020-11-06 22:24:35,914 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-06 22:24:35,931 INFO L203 MainTranslator]: Completed pre-run [2020-11-06 22:24:35,955 WARN L1500 CHandler]: Possible shadowing of function min [2020-11-06 22:24:35,957 WARN L1500 CHandler]: Possible shadowing of function min [2020-11-06 22:24:35,971 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-06 22:24:36,005 INFO L208 MainTranslator]: Completed translation [2020-11-06 22:24:36,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:36 WrapperNode [2020-11-06 22:24:36,007 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-06 22:24:36,008 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-06 22:24:36,009 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-06 22:24:36,009 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-06 22:24:36,025 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:36" (1/1) ... [2020-11-06 22:24:36,025 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:36" (1/1) ... [2020-11-06 22:24:36,040 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:36" (1/1) ... [2020-11-06 22:24:36,041 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:36" (1/1) ... [2020-11-06 22:24:36,060 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:36" (1/1) ... [2020-11-06 22:24:36,066 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:36" (1/1) ... [2020-11-06 22:24:36,069 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:36" (1/1) ... [2020-11-06 22:24:36,075 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-06 22:24:36,076 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-06 22:24:36,076 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-06 22:24:36,076 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-06 22:24:36,077 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:36" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-06 22:24:36,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-06 22:24:36,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-06 22:24:36,165 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_cycle_if_not [2020-11-06 22:24:36,165 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-06 22:24:36,165 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-11-06 22:24:36,165 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2020-11-06 22:24:36,165 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2020-11-06 22:24:36,166 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2020-11-06 22:24:36,166 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2020-11-06 22:24:36,166 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2020-11-06 22:24:36,166 INFO L138 BoogieDeclarations]: Found implementation of procedure task [2020-11-06 22:24:36,166 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-06 22:24:36,166 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2020-11-06 22:24:36,167 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-11-06 22:24:36,167 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-11-06 22:24:36,167 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-11-06 22:24:36,167 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-06 22:24:36,167 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2020-11-06 22:24:36,167 INFO L130 BoogieDeclarations]: Found specification of procedure assume_cycle_if_not [2020-11-06 22:24:36,168 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-06 22:24:36,168 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-06 22:24:36,168 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-06 22:24:36,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-06 22:24:36,168 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-11-06 22:24:36,168 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2020-11-06 22:24:36,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-11-06 22:24:36,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-06 22:24:36,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-06 22:24:36,169 INFO L130 BoogieDeclarations]: Found specification of procedure min [2020-11-06 22:24:36,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-06 22:24:36,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-11-06 22:24:36,170 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2020-11-06 22:24:36,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-06 22:24:36,170 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2020-11-06 22:24:36,170 INFO L130 BoogieDeclarations]: Found specification of procedure size [2020-11-06 22:24:36,170 INFO L130 BoogieDeclarations]: Found specification of procedure task [2020-11-06 22:24:36,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2020-11-06 22:24:36,171 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-06 22:24:36,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-06 22:24:36,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-06 22:24:36,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-06 22:24:36,919 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-06 22:24:36,919 INFO L298 CfgBuilder]: Removed 2 assume(true) statements. [2020-11-06 22:24:36,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:24:36 BoogieIcfgContainer [2020-11-06 22:24:36,922 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-06 22:24:36,924 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-06 22:24:36,924 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-06 22:24:36,929 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-06 22:24:36,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:24:35" (1/3) ... [2020-11-06 22:24:36,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@396bb9b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:24:36, skipping insertion in model container [2020-11-06 22:24:36,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:36" (2/3) ... [2020-11-06 22:24:36,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@396bb9b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:24:36, skipping insertion in model container [2020-11-06 22:24:36,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:24:36" (3/3) ... [2020-11-06 22:24:36,933 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_del_rec.c [2020-11-06 22:24:36,954 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-06 22:24:36,959 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-06 22:24:36,976 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-06 22:24:37,009 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-06 22:24:37,010 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-06 22:24:37,010 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-06 22:24:37,010 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-06 22:24:37,010 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-06 22:24:37,010 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-06 22:24:37,010 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-06 22:24:37,011 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-06 22:24:37,033 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states. [2020-11-06 22:24:37,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-11-06 22:24:37,043 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:24:37,044 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2020-11-06 22:24:37,045 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:24:37,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:24:37,052 INFO L82 PathProgramCache]: Analyzing trace with hash 608013235, now seen corresponding path program 1 times [2020-11-06 22:24:37,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:24:37,064 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140223829] [2020-11-06 22:24:37,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:24:37,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:24:37,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:24:37,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:24:37,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-11-06 22:24:37,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:24:37,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-06 22:24:37,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:24:37,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-11-06 22:24:37,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:24:37,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-06 22:24:37,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:24:37,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:24:37,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:24:37,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-11-06 22:24:37,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:24:37,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:24:37,805 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140223829] [2020-11-06 22:24:37,806 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:24:37,806 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-06 22:24:37,807 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494008831] [2020-11-06 22:24:37,817 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-06 22:24:37,819 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:24:37,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-06 22:24:37,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-11-06 22:24:37,838 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 11 states. [2020-11-06 22:24:38,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:24:38,836 INFO L93 Difference]: Finished difference Result 176 states and 235 transitions. [2020-11-06 22:24:38,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-06 22:24:38,838 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 45 [2020-11-06 22:24:38,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:24:38,852 INFO L225 Difference]: With dead ends: 176 [2020-11-06 22:24:38,853 INFO L226 Difference]: Without dead ends: 97 [2020-11-06 22:24:38,858 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2020-11-06 22:24:38,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-11-06 22:24:38,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 91. [2020-11-06 22:24:38,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-11-06 22:24:38,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 115 transitions. [2020-11-06 22:24:38,926 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 115 transitions. Word has length 45 [2020-11-06 22:24:38,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:24:38,929 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 115 transitions. [2020-11-06 22:24:38,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-06 22:24:38,929 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 115 transitions. [2020-11-06 22:24:38,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-11-06 22:24:38,937 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:24:38,937 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:24:38,938 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-06 22:24:38,938 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:24:38,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:24:38,939 INFO L82 PathProgramCache]: Analyzing trace with hash 2111601266, now seen corresponding path program 1 times [2020-11-06 22:24:38,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:24:38,940 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166983098] [2020-11-06 22:24:38,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:24:38,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:24:39,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:24:39,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:24:39,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-11-06 22:24:39,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:24:39,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-06 22:24:39,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:24:39,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-11-06 22:24:39,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:24:39,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-06 22:24:39,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:24:39,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-11-06 22:24:39,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:24:39,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-06 22:24:39,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:24:39,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-06 22:24:39,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:24:39,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-06 22:24:39,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:24:39,317 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-06 22:24:39,318 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166983098] [2020-11-06 22:24:39,318 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568766496] [2020-11-06 22:24:39,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:24:39,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:24:39,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 25 conjunts are in the unsatisfiable core [2020-11-06 22:24:39,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:24:39,748 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-06 22:24:39,749 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:24:39,749 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 13 [2020-11-06 22:24:39,752 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432057321] [2020-11-06 22:24:39,753 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-06 22:24:39,754 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:24:39,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-06 22:24:39,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2020-11-06 22:24:39,755 INFO L87 Difference]: Start difference. First operand 91 states and 115 transitions. Second operand 13 states. [2020-11-06 22:24:41,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:24:41,049 INFO L93 Difference]: Finished difference Result 164 states and 210 transitions. [2020-11-06 22:24:41,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-06 22:24:41,050 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2020-11-06 22:24:41,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:24:41,053 INFO L225 Difference]: With dead ends: 164 [2020-11-06 22:24:41,053 INFO L226 Difference]: Without dead ends: 96 [2020-11-06 22:24:41,056 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2020-11-06 22:24:41,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-11-06 22:24:41,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 93. [2020-11-06 22:24:41,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-11-06 22:24:41,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 118 transitions. [2020-11-06 22:24:41,076 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 118 transitions. Word has length 57 [2020-11-06 22:24:41,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:24:41,076 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 118 transitions. [2020-11-06 22:24:41,077 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-06 22:24:41,077 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 118 transitions. [2020-11-06 22:24:41,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-11-06 22:24:41,080 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:24:41,080 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:24:41,293 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-11-06 22:24:41,294 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:24:41,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:24:41,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1898064043, now seen corresponding path program 1 times [2020-11-06 22:24:41,296 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:24:41,297 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819886033] [2020-11-06 22:24:41,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:24:41,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:24:41,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:24:41,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:24:41,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-11-06 22:24:41,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:24:41,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:24:41,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:24:41,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:24:41,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:24:41,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-11-06 22:24:41,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:24:41,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-06 22:24:41,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:24:41,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-06 22:24:41,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:24:41,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-11-06 22:24:41,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:24:41,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-11-06 22:24:41,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:24:41,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-06 22:24:41,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:24:41,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-06 22:24:41,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:24:41,719 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-11-06 22:24:41,719 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819886033] [2020-11-06 22:24:41,720 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:24:41,720 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-06 22:24:41,720 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496533415] [2020-11-06 22:24:41,721 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-06 22:24:41,721 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:24:41,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-06 22:24:41,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2020-11-06 22:24:41,722 INFO L87 Difference]: Start difference. First operand 93 states and 118 transitions. Second operand 13 states. [2020-11-06 22:24:42,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:24:42,914 INFO L93 Difference]: Finished difference Result 163 states and 209 transitions. [2020-11-06 22:24:42,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-06 22:24:42,915 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2020-11-06 22:24:42,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:24:42,921 INFO L225 Difference]: With dead ends: 163 [2020-11-06 22:24:42,922 INFO L226 Difference]: Without dead ends: 98 [2020-11-06 22:24:42,923 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2020-11-06 22:24:42,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-11-06 22:24:42,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 95. [2020-11-06 22:24:42,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-11-06 22:24:42,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 121 transitions. [2020-11-06 22:24:42,961 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 121 transitions. Word has length 67 [2020-11-06 22:24:42,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:24:42,962 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 121 transitions. [2020-11-06 22:24:42,962 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-06 22:24:42,962 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 121 transitions. [2020-11-06 22:24:42,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-11-06 22:24:42,971 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:24:42,971 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:24:42,972 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-06 22:24:42,972 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:24:42,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:24:42,973 INFO L82 PathProgramCache]: Analyzing trace with hash -330780866, now seen corresponding path program 1 times [2020-11-06 22:24:42,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:24:42,975 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43009953] [2020-11-06 22:24:42,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:24:43,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:24:43,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:24:43,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:24:43,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-11-06 22:24:43,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:24:43,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:24:43,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:24:43,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:24:43,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:24:43,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-11-06 22:24:43,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:24:43,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-06 22:24:43,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:24:43,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-11-06 22:24:43,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:24:43,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-11-06 22:24:43,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:24:43,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-06 22:24:43,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:24:43,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-11-06 22:24:43,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:24:43,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-11-06 22:24:43,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:24:43,389 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-06 22:24:43,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:24:43,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-11-06 22:24:43,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:24:43,468 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-11-06 22:24:43,469 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43009953] [2020-11-06 22:24:43,469 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660492374] [2020-11-06 22:24:43,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:24:43,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:24:43,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 31 conjunts are in the unsatisfiable core [2020-11-06 22:24:43,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:24:43,722 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-11-06 22:24:43,722 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:24:43,723 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 17 [2020-11-06 22:24:43,723 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692357839] [2020-11-06 22:24:43,724 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-06 22:24:43,724 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:24:43,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-06 22:24:43,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2020-11-06 22:24:43,725 INFO L87 Difference]: Start difference. First operand 95 states and 121 transitions. Second operand 17 states. [2020-11-06 22:24:45,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:24:45,304 INFO L93 Difference]: Finished difference Result 151 states and 193 transitions. [2020-11-06 22:24:45,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-06 22:24:45,305 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 80 [2020-11-06 22:24:45,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:24:45,309 INFO L225 Difference]: With dead ends: 151 [2020-11-06 22:24:45,309 INFO L226 Difference]: Without dead ends: 98 [2020-11-06 22:24:45,311 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=144, Invalid=726, Unknown=0, NotChecked=0, Total=870 [2020-11-06 22:24:45,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-11-06 22:24:45,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2020-11-06 22:24:45,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-11-06 22:24:45,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 124 transitions. [2020-11-06 22:24:45,330 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 124 transitions. Word has length 80 [2020-11-06 22:24:45,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:24:45,330 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 124 transitions. [2020-11-06 22:24:45,330 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-06 22:24:45,331 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 124 transitions. [2020-11-06 22:24:45,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-11-06 22:24:45,333 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:24:45,333 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:24:45,547 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:24:45,548 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:24:45,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:24:45,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1397967645, now seen corresponding path program 1 times [2020-11-06 22:24:45,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:24:45,550 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987500666] [2020-11-06 22:24:45,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:24:45,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-06 22:24:45,597 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-06 22:24:45,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-06 22:24:45,672 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-06 22:24:45,744 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-06 22:24:45,744 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-06 22:24:45,745 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-06 22:24:45,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:24:45 BoogieIcfgContainer [2020-11-06 22:24:45,858 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-06 22:24:45,861 INFO L168 Benchmark]: Toolchain (without parser) took 10256.54 ms. Allocated memory was 153.1 MB in the beginning and 222.3 MB in the end (delta: 69.2 MB). Free memory was 129.0 MB in the beginning and 131.1 MB in the end (delta: -2.1 MB). Peak memory consumption was 67.9 MB. Max. memory is 8.0 GB. [2020-11-06 22:24:45,862 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 153.1 MB. Free memory is still 128.0 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-06 22:24:45,863 INFO L168 Benchmark]: CACSL2BoogieTranslator took 396.11 ms. Allocated memory is still 153.1 MB. Free memory was 128.3 MB in the beginning and 116.7 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. [2020-11-06 22:24:45,864 INFO L168 Benchmark]: Boogie Preprocessor took 66.39 ms. Allocated memory is still 153.1 MB. Free memory was 116.7 MB in the beginning and 114.2 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-06 22:24:45,866 INFO L168 Benchmark]: RCFGBuilder took 846.45 ms. Allocated memory is still 153.1 MB. Free memory was 114.2 MB in the beginning and 113.6 MB in the end (delta: 670.4 kB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2020-11-06 22:24:45,867 INFO L168 Benchmark]: TraceAbstraction took 8933.93 ms. Allocated memory was 153.1 MB in the beginning and 222.3 MB in the end (delta: 69.2 MB). Free memory was 113.0 MB in the beginning and 131.1 MB in the end (delta: -18.0 MB). Peak memory consumption was 52.2 MB. Max. memory is 8.0 GB. [2020-11-06 22:24:45,872 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 153.1 MB. Free memory is still 128.0 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 396.11 ms. Allocated memory is still 153.1 MB. Free memory was 128.3 MB in the beginning and 116.7 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 66.39 ms. Allocated memory is still 153.1 MB. Free memory was 116.7 MB in the beginning and 114.2 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 846.45 ms. Allocated memory is still 153.1 MB. Free memory was 114.2 MB in the beginning and 113.6 MB in the end (delta: 670.4 kB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 8933.93 ms. Allocated memory was 153.1 MB in the beginning and 222.3 MB in the end (delta: 69.2 MB). Free memory was 113.0 MB in the beginning and 131.1 MB in the end (delta: -18.0 MB). Peak memory consumption was 52.2 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 14]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L102] CALL, EXPR nondet_tree() [L25] COND FALSE !(__VERIFIER_nondet_bool()) [L28] struct node *n = (struct node *)malloc(sizeof(struct node)); [L29] n->data = __VERIFIER_nondet_int() [L30] CALL, EXPR nondet_tree() [L25] COND TRUE __VERIFIER_nondet_bool() [L26] return 0; VAL [\result={0:0}] [L30] RET, EXPR nondet_tree() VAL [malloc(sizeof(struct node))={-1:0}, n={-1:0}, nondet_tree()={0:0}] [L30] n->left = nondet_tree() [L31] CALL, EXPR nondet_tree() [L25] COND TRUE __VERIFIER_nondet_bool() [L26] return 0; VAL [\result={0:0}] [L31] RET, EXPR nondet_tree() VAL [malloc(sizeof(struct node))={-1:0}, n={-1:0}, nondet_tree()={0:0}] [L31] n->right = nondet_tree() [L32] return n; VAL [\result={-1:0}, malloc(sizeof(struct node))={-1:0}, n={-1:0}] [L102] RET, EXPR nondet_tree() VAL [nondet_tree()={-1:0}] [L102] CALL task(nondet_tree()) VAL [t={-1:0}] [L78] CALL, EXPR min(t) VAL [n={-1:0}] [L37] COND FALSE !(!n) [L40] EXPR n->data [L40] int a = n->data; [L41] EXPR n->left VAL [a=2147483647, n={-1:0}, n={-1:0}, n->left={0:0}] [L41] CALL, EXPR min(n->left) VAL [n={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\result=2147483647, n={0:0}, n={0:0}] [L41] RET, EXPR min(n->left) VAL [a=2147483647, min(n->left)=2147483647, n={-1:0}, n={-1:0}, n->left={0:0}] [L41] int b = min(n->left); [L42] EXPR n->right VAL [a=2147483647, b=2147483647, n={-1:0}, n={-1:0}, n->right={0:0}] [L42] CALL, EXPR min(n->right) VAL [n={0:0}] [L37] COND TRUE !n [L38] return 2147483647; VAL [\result=2147483647, n={0:0}, n={0:0}] [L42] RET, EXPR min(n->right) VAL [a=2147483647, b=2147483647, min(n->right)=2147483647, n={-1:0}, n={-1:0}, n->right={0:0}] [L42] int c = min(n->right); [L43] COND TRUE b <= a && b <= c [L43] return b; VAL [\result=2147483647, a=2147483647, b=2147483647, c=2147483647, n={-1:0}, n={-1:0}] [L78] RET, EXPR min(t) VAL [min(t)=2147483647, t={-1:0}, t={-1:0}] [L78] int a = min(t); [L79] int b; VAL [a=2147483647, b={3:0}, t={-1:0}, t={-1:0}] [L81] CALL, EXPR size(t) VAL [t={-1:0}] [L73] COND FALSE !(!t) [L74] EXPR t->left VAL [t={-1:0}, t={-1:0}, t->left={0:0}] [L74] CALL, EXPR size(t->left) VAL [t={0:0}] [L73] COND TRUE !t [L73] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L74] RET, EXPR size(t->left) VAL [size(t->left)=0, t={-1:0}, t={-1:0}, t->left={0:0}] [L74] EXPR t->right VAL [size(t->left)=0, t={-1:0}, t={-1:0}, t->left={0:0}, t->right={0:0}] [L74] CALL, EXPR size(t->right) VAL [t={0:0}] [L73] COND TRUE !t [L73] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L74] RET, EXPR size(t->right) VAL [size(t->left)=0, size(t->right)=0, t={-1:0}, t={-1:0}, t->left={0:0}, t->right={0:0}] [L74] return size(t->left) + size(t->right) + 1; [L81] RET, EXPR size(t) VAL [a=2147483647, b={3:0}, size(t)=1, t={-1:0}, t={-1:0}] [L81] int n = size(t); [L82] CALL assume_cycle_if_not(n != 0) VAL [\old(cond)=1] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L82] RET assume_cycle_if_not(n != 0) VAL [a=2147483647, b={3:0}, n=1, t={-1:0}, t={-1:0}] [L83] EXPR, FCALL calloc(n, sizeof(int)) VAL [a=2147483647, b={3:0}, calloc(n, sizeof(int))={-2:0}, n=1, t={-1:0}, t={-1:0}] [L83] int *x = calloc(n, sizeof(int)); VAL [a=2147483647, b={3:0}, calloc(n, sizeof(int))={-2:0}, n=1, t={-1:0}, t={-1:0}, x={-2:0}] [L84] CALL tree_inorder(t, x, n) VAL [\old(i)=1, a={-2:0}, t={-1:0}] [L62] COND FALSE !(!t) [L65] EXPR t->left VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=1, t={-1:0}, t={-1:0}, t->left={0:0}] [L65] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-2:0}, t={0:0}] [L62] COND TRUE !t [L63] return i; VAL [\old(i)=1, \result=1, a={-2:0}, a={-2:0}, i=1, t={0:0}, t={0:0}] [L65] RET, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=1, t={-1:0}, t={-1:0}, t->left={0:0}, tree_inorder(t->left, a, i)=1] [L65] i = tree_inorder(t->left, a, i) [L66] EXPR i++ [L66] EXPR t->data [L66] a[i++] = t->data [L67] EXPR t->right VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=2, t={-1:0}, t={-1:0}, t->right={0:0}] [L67] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=2, a={-2:0}, t={0:0}] [L62] COND TRUE !t [L63] return i; VAL [\old(i)=2, \result=2, a={-2:0}, a={-2:0}, i=2, t={0:0}, t={0:0}] [L67] RET, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=2, t={-1:0}, t={-1:0}, t->right={0:0}, tree_inorder(t->right, a, i)=2] [L67] i = tree_inorder(t->right, a, i) [L68] return i; VAL [\old(i)=1, \result=2, a={-2:0}, a={-2:0}, i=2, t={-1:0}, t={-1:0}] [L84] RET tree_inorder(t, x, n) VAL [a=2147483647, b={3:0}, calloc(n, sizeof(int))={-2:0}, n=1, t={-1:0}, t={-1:0}, tree_inorder(t, x, n)=2, x={-2:0}] [L85] EXPR x[0] VAL [a=2147483647, b={3:0}, calloc(n, sizeof(int))={-2:0}, n=1, t={-1:0}, t={-1:0}, x={-2:0}, x[0]=0] [L85] CALL __VERIFIER_assert(a == x[0]) VAL [\old(cond)=0] [L16] COND TRUE !cond VAL [\old(cond)=0, cond=0] [L16] CALL reach_error() [L14] __assert_fail("0", "tree_del_rec.c", 14, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 13 procedures, 101 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 8.7s, OverallIterations: 5, TraceHistogramMax: 3, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 356 SDtfs, 567 SDslu, 1599 SDs, 0 SdLazy, 2017 SolverSat, 562 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 286 GetRequests, 201 SyntacticMatches, 4 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=101occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 13 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 478 NumberOfCodeBlocks, 478 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 380 ConstructedInterpolants, 0 QuantifiedInterpolants, 79926 SizeOfPredicates, 14 NumberOfNonLiveVariables, 737 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 103/111 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...