/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_iter.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-06 22:47:31,454 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-06 22:47:31,457 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-06 22:47:31,499 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-06 22:47:31,500 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-06 22:47:31,501 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-06 22:47:31,503 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-06 22:47:31,506 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-06 22:47:31,508 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-06 22:47:31,509 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-06 22:47:31,511 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-06 22:47:31,512 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-06 22:47:31,513 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-06 22:47:31,514 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-06 22:47:31,516 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-06 22:47:31,517 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-06 22:47:31,518 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-06 22:47:31,520 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-06 22:47:31,537 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-06 22:47:31,540 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-06 22:47:31,542 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-06 22:47:31,544 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-06 22:47:31,546 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-06 22:47:31,547 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-06 22:47:31,550 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-06 22:47:31,550 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-06 22:47:31,551 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-06 22:47:31,552 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-06 22:47:31,553 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-06 22:47:31,554 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-06 22:47:31,554 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-06 22:47:31,555 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-06 22:47:31,556 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-06 22:47:31,557 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-06 22:47:31,558 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-06 22:47:31,559 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-06 22:47:31,560 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-06 22:47:31,560 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-06 22:47:31,561 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-06 22:47:31,562 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-06 22:47:31,563 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-06 22:47:31,564 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:47:31,592 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-06 22:47:31,593 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-06 22:47:31,594 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-06 22:47:31,595 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-06 22:47:31,595 INFO L138 SettingsManager]: * Use SBE=true [2020-11-06 22:47:31,595 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-06 22:47:31,595 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-06 22:47:31,596 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-06 22:47:31,596 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-06 22:47:31,596 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-06 22:47:31,597 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-06 22:47:31,597 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-06 22:47:31,597 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-06 22:47:31,597 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-06 22:47:31,597 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-06 22:47:31,598 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-06 22:47:31,598 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-06 22:47:31,598 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-06 22:47:31,598 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-06 22:47:31,599 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-06 22:47:31,599 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-06 22:47:31,599 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-06 22:47:31,600 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-06 22:47:31,600 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-06 22:47:31,600 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-06 22:47:31,600 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-06 22:47:31,601 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-06 22:47:31,601 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-06 22:47:31,601 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-06 22:47:31,601 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:47:31,972 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-06 22:47:32,021 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-06 22:47:32,024 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-06 22:47:32,026 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-06 22:47:32,027 INFO L275 PluginConnector]: CDTParser initialized [2020-11-06 22:47:32,028 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/tree_del_iter.c [2020-11-06 22:47:32,124 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/948fff889/9f56953fefa346e392e93ff9ded888c0/FLAGb34ae2901 [2020-11-06 22:47:32,780 INFO L306 CDTParser]: Found 1 translation units. [2020-11-06 22:47:32,781 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_iter.c [2020-11-06 22:47:32,792 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/948fff889/9f56953fefa346e392e93ff9ded888c0/FLAGb34ae2901 [2020-11-06 22:47:33,144 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/948fff889/9f56953fefa346e392e93ff9ded888c0 [2020-11-06 22:47:33,149 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-06 22:47:33,158 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-06 22:47:33,162 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-06 22:47:33,162 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-06 22:47:33,168 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-06 22:47:33,169 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:47:33" (1/1) ... [2020-11-06 22:47:33,174 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29676c20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:33, skipping insertion in model container [2020-11-06 22:47:33,175 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:47:33" (1/1) ... [2020-11-06 22:47:33,187 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-06 22:47:33,215 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-06 22:47:33,448 WARN L1500 CHandler]: Possible shadowing of function min [2020-11-06 22:47:33,466 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-06 22:47:33,490 INFO L203 MainTranslator]: Completed pre-run [2020-11-06 22:47:33,529 WARN L1500 CHandler]: Possible shadowing of function min [2020-11-06 22:47:33,542 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-06 22:47:33,566 INFO L208 MainTranslator]: Completed translation [2020-11-06 22:47:33,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:33 WrapperNode [2020-11-06 22:47:33,566 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-06 22:47:33,568 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-06 22:47:33,568 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-06 22:47:33,568 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-06 22:47:33,583 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:33" (1/1) ... [2020-11-06 22:47:33,583 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:33" (1/1) ... [2020-11-06 22:47:33,596 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:33" (1/1) ... [2020-11-06 22:47:33,597 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:33" (1/1) ... [2020-11-06 22:47:33,617 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:33" (1/1) ... [2020-11-06 22:47:33,623 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:33" (1/1) ... [2020-11-06 22:47:33,627 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:33" (1/1) ... [2020-11-06 22:47:33,632 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-06 22:47:33,633 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-06 22:47:33,634 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-06 22:47:33,634 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-06 22:47:33,635 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:33" (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:47:33,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-06 22:47:33,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-06 22:47:33,707 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_cycle_if_not [2020-11-06 22:47:33,707 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-06 22:47:33,708 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-11-06 22:47:33,708 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2020-11-06 22:47:33,708 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2020-11-06 22:47:33,708 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2020-11-06 22:47:33,708 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2020-11-06 22:47:33,708 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2020-11-06 22:47:33,708 INFO L138 BoogieDeclarations]: Found implementation of procedure task [2020-11-06 22:47:33,709 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-06 22:47:33,709 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2020-11-06 22:47:33,709 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-11-06 22:47:33,709 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-11-06 22:47:33,709 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-11-06 22:47:33,710 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-06 22:47:33,710 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2020-11-06 22:47:33,710 INFO L130 BoogieDeclarations]: Found specification of procedure assume_cycle_if_not [2020-11-06 22:47:33,710 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-06 22:47:33,710 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-06 22:47:33,710 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-06 22:47:33,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-06 22:47:33,711 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-11-06 22:47:33,711 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2020-11-06 22:47:33,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-11-06 22:47:33,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-06 22:47:33,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-06 22:47:33,712 INFO L130 BoogieDeclarations]: Found specification of procedure min [2020-11-06 22:47:33,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-06 22:47:33,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-11-06 22:47:33,712 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2020-11-06 22:47:33,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-06 22:47:33,712 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2020-11-06 22:47:33,712 INFO L130 BoogieDeclarations]: Found specification of procedure size [2020-11-06 22:47:33,713 INFO L130 BoogieDeclarations]: Found specification of procedure task [2020-11-06 22:47:33,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2020-11-06 22:47:33,713 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-06 22:47:33,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-06 22:47:33,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-06 22:47:33,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-06 22:47:34,343 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-06 22:47:34,343 INFO L298 CfgBuilder]: Removed 3 assume(true) statements. [2020-11-06 22:47:34,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:47:34 BoogieIcfgContainer [2020-11-06 22:47:34,345 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-06 22:47:34,347 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-06 22:47:34,348 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-06 22:47:34,351 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-06 22:47:34,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:47:33" (1/3) ... [2020-11-06 22:47:34,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@af1f8e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:47:34, skipping insertion in model container [2020-11-06 22:47:34,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:33" (2/3) ... [2020-11-06 22:47:34,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@af1f8e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:47:34, skipping insertion in model container [2020-11-06 22:47:34,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:47:34" (3/3) ... [2020-11-06 22:47:34,355 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_del_iter.c [2020-11-06 22:47:34,373 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-06 22:47:34,378 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-06 22:47:34,392 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-06 22:47:34,423 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-06 22:47:34,424 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-06 22:47:34,424 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-06 22:47:34,424 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-06 22:47:34,424 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-06 22:47:34,424 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-06 22:47:34,424 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-06 22:47:34,425 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-06 22:47:34,446 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states. [2020-11-06 22:47:34,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-11-06 22:47:34,456 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:47:34,457 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:47:34,457 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:47:34,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:47:34,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1748048263, now seen corresponding path program 1 times [2020-11-06 22:47:34,474 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:47:34,475 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794708100] [2020-11-06 22:47:34,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:47:34,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:34,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:47:34,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:34,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-11-06 22:47:34,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:34,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-06 22:47:34,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:34,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-11-06 22:47:34,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:34,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-06 22:47:34,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:35,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-11-06 22:47:35,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:35,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-11-06 22:47:35,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:35,103 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:47:35,104 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794708100] [2020-11-06 22:47:35,105 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:47:35,105 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-06 22:47:35,106 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226406050] [2020-11-06 22:47:35,111 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-06 22:47:35,111 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:47:35,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-06 22:47:35,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-11-06 22:47:35,129 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 11 states. [2020-11-06 22:47:36,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:47:36,100 INFO L93 Difference]: Finished difference Result 179 states and 241 transitions. [2020-11-06 22:47:36,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-06 22:47:36,103 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 45 [2020-11-06 22:47:36,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:47:36,122 INFO L225 Difference]: With dead ends: 179 [2020-11-06 22:47:36,122 INFO L226 Difference]: Without dead ends: 99 [2020-11-06 22:47:36,131 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:47:36,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-11-06 22:47:36,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 92. [2020-11-06 22:47:36,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-11-06 22:47:36,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 116 transitions. [2020-11-06 22:47:36,196 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 116 transitions. Word has length 45 [2020-11-06 22:47:36,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:47:36,197 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 116 transitions. [2020-11-06 22:47:36,197 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-06 22:47:36,197 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 116 transitions. [2020-11-06 22:47:36,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-11-06 22:47:36,201 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:47:36,201 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:47:36,202 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-06 22:47:36,202 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:47:36,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:47:36,203 INFO L82 PathProgramCache]: Analyzing trace with hash -911543376, now seen corresponding path program 1 times [2020-11-06 22:47:36,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:47:36,203 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027330212] [2020-11-06 22:47:36,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:47:36,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:36,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:47:36,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:36,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-11-06 22:47:36,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:36,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-06 22:47:36,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:36,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-11-06 22:47:36,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:36,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-06 22:47:36,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:36,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-11-06 22:47:36,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:36,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2020-11-06 22:47:36,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:36,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-06 22:47:36,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:36,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-06 22:47:36,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:36,490 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:47:36,490 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027330212] [2020-11-06 22:47:36,491 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692785347] [2020-11-06 22:47:36,491 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:47:36,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:36,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 25 conjunts are in the unsatisfiable core [2020-11-06 22:47:36,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:47:36,706 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:47:36,706 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:47:36,707 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 12 [2020-11-06 22:47:36,708 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502193304] [2020-11-06 22:47:36,712 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-06 22:47:36,712 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:47:36,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-06 22:47:36,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-06 22:47:36,715 INFO L87 Difference]: Start difference. First operand 92 states and 116 transitions. Second operand 12 states. [2020-11-06 22:47:37,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:47:37,706 INFO L93 Difference]: Finished difference Result 167 states and 213 transitions. [2020-11-06 22:47:37,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-06 22:47:37,707 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2020-11-06 22:47:37,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:47:37,710 INFO L225 Difference]: With dead ends: 167 [2020-11-06 22:47:37,710 INFO L226 Difference]: Without dead ends: 98 [2020-11-06 22:47:37,712 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2020-11-06 22:47:37,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-11-06 22:47:37,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2020-11-06 22:47:37,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-11-06 22:47:37,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 119 transitions. [2020-11-06 22:47:37,731 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 119 transitions. Word has length 57 [2020-11-06 22:47:37,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:47:37,731 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 119 transitions. [2020-11-06 22:47:37,731 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-06 22:47:37,731 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 119 transitions. [2020-11-06 22:47:37,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-11-06 22:47:37,734 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:47:37,735 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:47:37,948 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-11-06 22:47:37,949 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:47:37,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:47:37,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1666703955, now seen corresponding path program 1 times [2020-11-06 22:47:37,951 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:47:37,951 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091658671] [2020-11-06 22:47:37,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:47:37,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:38,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:47:38,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:38,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-11-06 22:47:38,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:38,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:47:38,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:38,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:47:38,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:38,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-11-06 22:47:38,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:38,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2020-11-06 22:47:38,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:38,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-06 22:47:38,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:38,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-11-06 22:47:38,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:38,172 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-11-06 22:47:38,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:38,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-06 22:47:38,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:38,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-06 22:47:38,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:38,224 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:47:38,224 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091658671] [2020-11-06 22:47:38,224 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:47:38,225 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-06 22:47:38,225 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074928678] [2020-11-06 22:47:38,225 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-06 22:47:38,226 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:47:38,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-06 22:47:38,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2020-11-06 22:47:38,227 INFO L87 Difference]: Start difference. First operand 94 states and 119 transitions. Second operand 13 states. [2020-11-06 22:47:39,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:47:39,248 INFO L93 Difference]: Finished difference Result 166 states and 212 transitions. [2020-11-06 22:47:39,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-06 22:47:39,249 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2020-11-06 22:47:39,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:47:39,253 INFO L225 Difference]: With dead ends: 166 [2020-11-06 22:47:39,253 INFO L226 Difference]: Without dead ends: 100 [2020-11-06 22:47:39,254 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2020-11-06 22:47:39,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-11-06 22:47:39,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2020-11-06 22:47:39,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-11-06 22:47:39,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 122 transitions. [2020-11-06 22:47:39,274 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 122 transitions. Word has length 67 [2020-11-06 22:47:39,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:47:39,275 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 122 transitions. [2020-11-06 22:47:39,275 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-06 22:47:39,275 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 122 transitions. [2020-11-06 22:47:39,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-11-06 22:47:39,280 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:47:39,281 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:47:39,281 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-06 22:47:39,281 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:47:39,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:47:39,282 INFO L82 PathProgramCache]: Analyzing trace with hash 145683958, now seen corresponding path program 1 times [2020-11-06 22:47:39,282 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:47:39,282 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393118973] [2020-11-06 22:47:39,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:47:39,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:39,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:47:39,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:39,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-11-06 22:47:39,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:39,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:47:39,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:39,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:47:39,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:39,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-11-06 22:47:39,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:39,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-06 22:47:39,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:39,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-11-06 22:47:39,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:39,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-11-06 22:47:39,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:39,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-06 22:47:39,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:39,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-11-06 22:47:39,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:39,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2020-11-06 22:47:39,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:39,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-06 22:47:39,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:39,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2020-11-06 22:47:39,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:39,788 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:47:39,788 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393118973] [2020-11-06 22:47:39,788 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416153995] [2020-11-06 22:47:39,789 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:47:39,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:47:39,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 31 conjunts are in the unsatisfiable core [2020-11-06 22:47:39,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:47:40,001 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:47:40,001 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:47:40,001 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 17 [2020-11-06 22:47:40,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114558571] [2020-11-06 22:47:40,003 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-06 22:47:40,003 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:47:40,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-06 22:47:40,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2020-11-06 22:47:40,004 INFO L87 Difference]: Start difference. First operand 96 states and 122 transitions. Second operand 17 states. [2020-11-06 22:47:41,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:47:41,272 INFO L93 Difference]: Finished difference Result 154 states and 196 transitions. [2020-11-06 22:47:41,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-06 22:47:41,272 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 80 [2020-11-06 22:47:41,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:47:41,275 INFO L225 Difference]: With dead ends: 154 [2020-11-06 22:47:41,276 INFO L226 Difference]: Without dead ends: 100 [2020-11-06 22:47:41,280 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=144, Invalid=726, Unknown=0, NotChecked=0, Total=870 [2020-11-06 22:47:41,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-11-06 22:47:41,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2020-11-06 22:47:41,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-11-06 22:47:41,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 126 transitions. [2020-11-06 22:47:41,315 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 126 transitions. Word has length 80 [2020-11-06 22:47:41,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:47:41,318 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 126 transitions. [2020-11-06 22:47:41,318 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-06 22:47:41,318 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 126 transitions. [2020-11-06 22:47:41,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-11-06 22:47:41,323 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:47:41,324 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:47:41,534 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:47:41,535 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:47:41,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:47:41,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1198978013, now seen corresponding path program 1 times [2020-11-06 22:47:41,537 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:47:41,537 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928839415] [2020-11-06 22:47:41,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:47:41,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-06 22:47:41,630 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-06 22:47:41,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-06 22:47:41,697 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-06 22:47:41,761 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-06 22:47:41,762 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-06 22:47:41,763 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-06 22:47:41,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:47:41 BoogieIcfgContainer [2020-11-06 22:47:41,891 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-06 22:47:41,894 INFO L168 Benchmark]: Toolchain (without parser) took 8740.74 ms. Allocated memory was 154.1 MB in the beginning and 223.3 MB in the end (delta: 69.2 MB). Free memory was 129.1 MB in the beginning and 135.6 MB in the end (delta: -6.5 MB). Peak memory consumption was 63.7 MB. Max. memory is 8.0 GB. [2020-11-06 22:47:41,895 INFO L168 Benchmark]: CDTParser took 1.49 ms. Allocated memory is still 154.1 MB. Free memory is still 126.9 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-06 22:47:41,896 INFO L168 Benchmark]: CACSL2BoogieTranslator took 404.83 ms. Allocated memory is still 154.1 MB. Free memory was 128.5 MB in the beginning and 116.8 MB in the end (delta: 11.7 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. [2020-11-06 22:47:41,899 INFO L168 Benchmark]: Boogie Preprocessor took 64.76 ms. Allocated memory is still 154.1 MB. Free memory was 116.8 MB in the beginning and 114.4 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:47:41,901 INFO L168 Benchmark]: RCFGBuilder took 712.01 ms. Allocated memory is still 154.1 MB. Free memory was 114.4 MB in the beginning and 114.4 MB in the end (delta: 53.0 kB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. [2020-11-06 22:47:41,904 INFO L168 Benchmark]: TraceAbstraction took 7543.83 ms. Allocated memory was 154.1 MB in the beginning and 223.3 MB in the end (delta: 69.2 MB). Free memory was 113.8 MB in the beginning and 135.6 MB in the end (delta: -21.7 MB). Peak memory consumption was 46.9 MB. Max. memory is 8.0 GB. [2020-11-06 22:47:41,909 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.49 ms. Allocated memory is still 154.1 MB. Free memory is still 126.9 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 404.83 ms. Allocated memory is still 154.1 MB. Free memory was 128.5 MB in the beginning and 116.8 MB in the end (delta: 11.7 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 64.76 ms. Allocated memory is still 154.1 MB. Free memory was 116.8 MB in the beginning and 114.4 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 712.01 ms. Allocated memory is still 154.1 MB. Free memory was 114.4 MB in the beginning and 114.4 MB in the end (delta: 53.0 kB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 7543.83 ms. Allocated memory was 154.1 MB in the beginning and 223.3 MB in the end (delta: 69.2 MB). Free memory was 113.8 MB in the beginning and 135.6 MB in the end (delta: -21.7 MB). Peak memory consumption was 46.9 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: [L110] 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}] [L110] RET, EXPR nondet_tree() VAL [nondet_tree()={-1:0}] [L110] CALL task(nondet_tree()) VAL [t={-1:0}] [L86] 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}] [L86] RET, EXPR min(t) VAL [min(t)=2147483647, t={-1:0}, t={-1:0}] [L86] int a = min(t); [L87] int b; VAL [a=2147483647, b={3:0}, t={-1:0}, t={-1:0}] [L89] CALL, EXPR size(t) VAL [t={-1:0}] [L81] COND FALSE !(!t) [L82] EXPR t->left VAL [t={-1:0}, t={-1:0}, t->left={0:0}] [L82] CALL, EXPR size(t->left) VAL [t={0:0}] [L81] COND TRUE !t [L81] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L82] RET, EXPR size(t->left) VAL [size(t->left)=0, t={-1:0}, t={-1:0}, t->left={0:0}] [L82] EXPR t->right VAL [size(t->left)=0, t={-1:0}, t={-1:0}, t->left={0:0}, t->right={0:0}] [L82] CALL, EXPR size(t->right) VAL [t={0:0}] [L81] COND TRUE !t [L81] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L82] 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}] [L82] return size(t->left) + size(t->right) + 1; [L89] RET, EXPR size(t) VAL [a=2147483647, b={3:0}, size(t)=1, t={-1:0}, t={-1:0}] [L89] int n = size(t); [L90] CALL assume_cycle_if_not(n != 0) VAL [\old(cond)=1] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L90] RET assume_cycle_if_not(n != 0) VAL [a=2147483647, b={3:0}, n=1, t={-1:0}, t={-1:0}] [L91] 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}] [L91] 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}] [L92] CALL tree_inorder(t, x, n) VAL [\old(i)=1, a={-2:0}, t={-1:0}] [L70] COND FALSE !(!t) [L73] 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}] [L73] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-2:0}, t={0:0}] [L70] COND TRUE !t [L71] return i; VAL [\old(i)=1, \result=1, a={-2:0}, a={-2:0}, i=1, t={0:0}, t={0:0}] [L73] 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] [L73] i = tree_inorder(t->left, a, i) [L74] EXPR i++ [L74] EXPR t->data [L74] a[i++] = t->data [L75] 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}] [L75] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=2, a={-2:0}, t={0:0}] [L70] COND TRUE !t [L71] return i; VAL [\old(i)=2, \result=2, a={-2:0}, a={-2:0}, i=2, t={0:0}, t={0:0}] [L75] 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] [L75] i = tree_inorder(t->right, a, i) [L76] return i; VAL [\old(i)=1, \result=2, a={-2:0}, a={-2:0}, i=2, t={-1:0}, t={-1:0}] [L92] 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}] [L93] 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] [L93] 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_iter.c", 14, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 13 procedures, 102 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 7.3s, OverallIterations: 5, TraceHistogramMax: 3, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 348 SDtfs, 527 SDslu, 1527 SDs, 0 SdLazy, 2168 SolverSat, 512 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 286 GetRequests, 202 SyntacticMatches, 4 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred 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, 17 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 478 NumberOfCodeBlocks, 478 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 380 ConstructedInterpolants, 0 QuantifiedInterpolants, 79702 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...