/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/verifythis/tree_del_rec.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 05:09:36,696 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 05:09:36,699 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 05:09:36,735 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 05:09:36,735 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 05:09:36,737 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 05:09:36,739 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 05:09:36,741 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 05:09:36,744 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 05:09:36,745 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 05:09:36,746 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 05:09:36,748 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 05:09:36,748 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 05:09:36,750 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 05:09:36,751 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 05:09:36,752 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 05:09:36,754 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 05:09:36,755 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 05:09:36,757 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 05:09:36,761 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 05:09:36,764 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 05:09:36,766 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 05:09:36,768 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 05:09:36,769 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 05:09:36,782 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 05:09:36,782 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 05:09:36,782 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 05:09:36,784 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 05:09:36,784 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 05:09:36,785 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 05:09:36,786 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 05:09:36,787 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 05:09:36,788 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 05:09:36,789 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 05:09:36,790 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 05:09:36,790 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 05:09:36,791 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 05:09:36,792 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 05:09:36,792 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 05:09:36,793 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 05:09:36,794 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 05:09:36,795 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 05:09:36,812 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 05:09:36,813 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 05:09:36,815 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 05:09:36,815 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 05:09:36,817 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 05:09:36,817 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 05:09:36,818 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 05:09:36,818 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 05:09:36,818 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 05:09:36,818 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 05:09:36,819 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 05:09:36,819 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 05:09:36,819 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 05:09:36,819 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 05:09:36,819 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 05:09:36,820 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 05:09:36,820 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 05:09:36,821 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 05:09:36,821 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 05:09:36,822 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 05:09:36,822 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 05:09:36,822 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 05:09:36,822 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-11-07 05:09:37,238 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 05:09:37,271 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 05:09:37,274 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 05:09:37,276 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 05:09:37,277 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 05:09:37,278 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-07 05:09:37,369 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dbf2237e/b24d305db87b4e96a4e162ee17db8759/FLAGd63750f0d [2020-11-07 05:09:37,989 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 05:09:37,990 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_rec.c [2020-11-07 05:09:38,005 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dbf2237e/b24d305db87b4e96a4e162ee17db8759/FLAGd63750f0d [2020-11-07 05:09:38,353 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dbf2237e/b24d305db87b4e96a4e162ee17db8759 [2020-11-07 05:09:38,357 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 05:09:38,367 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 05:09:38,373 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 05:09:38,373 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 05:09:38,379 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 05:09:38,380 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:09:38" (1/1) ... [2020-11-07 05:09:38,384 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@493fad1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:09:38, skipping insertion in model container [2020-11-07 05:09:38,385 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:09:38" (1/1) ... [2020-11-07 05:09:38,395 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 05:09:38,427 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 05:09:38,655 WARN L1500 CHandler]: Possible shadowing of function min [2020-11-07 05:09:38,658 WARN L1500 CHandler]: Possible shadowing of function min [2020-11-07 05:09:38,697 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:09:38,728 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 05:09:38,776 WARN L1500 CHandler]: Possible shadowing of function min [2020-11-07 05:09:38,779 WARN L1500 CHandler]: Possible shadowing of function min [2020-11-07 05:09:38,792 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:09:38,817 INFO L208 MainTranslator]: Completed translation [2020-11-07 05:09:38,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:09:38 WrapperNode [2020-11-07 05:09:38,818 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 05:09:38,819 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 05:09:38,820 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 05:09:38,820 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 05:09:38,836 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:09:38" (1/1) ... [2020-11-07 05:09:38,836 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:09:38" (1/1) ... [2020-11-07 05:09:38,850 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:09:38" (1/1) ... [2020-11-07 05:09:38,850 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:09:38" (1/1) ... [2020-11-07 05:09:38,868 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:09:38" (1/1) ... [2020-11-07 05:09:38,875 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:09:38" (1/1) ... [2020-11-07 05:09:38,879 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:09:38" (1/1) ... [2020-11-07 05:09:38,884 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 05:09:38,886 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 05:09:38,886 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 05:09:38,886 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 05:09:38,887 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:09:38" (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-07 05:09:38,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 05:09:38,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 05:09:38,972 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_cycle_if_not [2020-11-07 05:09:38,972 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 05:09:38,972 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-11-07 05:09:38,973 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2020-11-07 05:09:38,973 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2020-11-07 05:09:38,973 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2020-11-07 05:09:38,973 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2020-11-07 05:09:38,973 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2020-11-07 05:09:38,974 INFO L138 BoogieDeclarations]: Found implementation of procedure task [2020-11-07 05:09:38,974 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 05:09:38,974 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2020-11-07 05:09:38,974 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-11-07 05:09:38,974 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-11-07 05:09:38,975 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-11-07 05:09:38,975 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 05:09:38,975 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2020-11-07 05:09:38,975 INFO L130 BoogieDeclarations]: Found specification of procedure assume_cycle_if_not [2020-11-07 05:09:38,975 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 05:09:38,976 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 05:09:38,976 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 05:09:38,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 05:09:38,976 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-11-07 05:09:38,976 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2020-11-07 05:09:38,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-11-07 05:09:38,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 05:09:38,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-07 05:09:38,977 INFO L130 BoogieDeclarations]: Found specification of procedure min [2020-11-07 05:09:38,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 05:09:38,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-11-07 05:09:38,978 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2020-11-07 05:09:38,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 05:09:38,978 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2020-11-07 05:09:38,978 INFO L130 BoogieDeclarations]: Found specification of procedure size [2020-11-07 05:09:38,978 INFO L130 BoogieDeclarations]: Found specification of procedure task [2020-11-07 05:09:38,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2020-11-07 05:09:38,979 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 05:09:38,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 05:09:38,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 05:09:38,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 05:09:39,770 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 05:09:39,770 INFO L298 CfgBuilder]: Removed 2 assume(true) statements. [2020-11-07 05:09:39,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:09:39 BoogieIcfgContainer [2020-11-07 05:09:39,773 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 05:09:39,777 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 05:09:39,777 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 05:09:39,783 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 05:09:39,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:09:38" (1/3) ... [2020-11-07 05:09:39,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c79822e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:09:39, skipping insertion in model container [2020-11-07 05:09:39,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:09:38" (2/3) ... [2020-11-07 05:09:39,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c79822e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:09:39, skipping insertion in model container [2020-11-07 05:09:39,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:09:39" (3/3) ... [2020-11-07 05:09:39,787 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_del_rec.c [2020-11-07 05:09:39,809 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 05:09:39,813 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 05:09:39,824 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 05:09:39,848 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 05:09:39,848 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 05:09:39,848 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 05:09:39,848 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 05:09:39,849 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 05:09:39,849 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 05:09:39,849 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 05:09:39,849 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 05:09:39,869 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states. [2020-11-07 05:09:39,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-11-07 05:09:39,885 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:09:39,886 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:09:39,887 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:09:39,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:09:39,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1212435517, now seen corresponding path program 1 times [2020-11-07 05:09:39,902 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:09:39,903 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1974862748] [2020-11-07 05:09:39,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:09:40,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:09:40,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:09:40,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:09:40,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-07 05:09:40,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:09:40,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-07 05:09:40,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:09:40,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 05:09:40,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:09:40,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-11-07 05:09:40,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:09:40,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-11-07 05:09:40,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:09:40,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2020-11-07 05:09:40,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:09:40,658 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-07 05:09:40,660 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1974862748] [2020-11-07 05:09:40,662 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:09:40,662 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-07 05:09:40,663 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308819954] [2020-11-07 05:09:40,670 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 05:09:40,670 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:09:40,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 05:09:40,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-11-07 05:09:40,689 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 11 states. [2020-11-07 05:09:42,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:09:42,734 INFO L93 Difference]: Finished difference Result 343 states and 402 transitions. [2020-11-07 05:09:42,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-07 05:09:42,736 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2020-11-07 05:09:42,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:09:42,770 INFO L225 Difference]: With dead ends: 343 [2020-11-07 05:09:42,770 INFO L226 Difference]: Without dead ends: 199 [2020-11-07 05:09:42,782 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2020-11-07 05:09:42,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2020-11-07 05:09:42,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 186. [2020-11-07 05:09:42,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-11-07 05:09:42,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 210 transitions. [2020-11-07 05:09:42,936 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 210 transitions. Word has length 66 [2020-11-07 05:09:42,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:09:42,937 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 210 transitions. [2020-11-07 05:09:42,937 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 05:09:42,937 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 210 transitions. [2020-11-07 05:09:42,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-11-07 05:09:42,943 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:09:42,943 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:09:42,943 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 05:09:42,944 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:09:42,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:09:42,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1003200631, now seen corresponding path program 1 times [2020-11-07 05:09:42,945 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:09:42,945 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [866569291] [2020-11-07 05:09:42,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:09:42,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:09:43,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:09:43,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:09:43,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-07 05:09:43,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:09:43,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-07 05:09:43,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:09:43,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 05:09:43,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:09:43,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:09:43,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:09:43,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:09:43,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:09:43,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-11-07 05:09:43,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:09:43,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-11-07 05:09:43,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:09:43,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-11-07 05:09:43,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:09:43,366 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-11-07 05:09:43,366 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [866569291] [2020-11-07 05:09:43,366 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:09:43,367 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-11-07 05:09:43,367 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289935008] [2020-11-07 05:09:43,368 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 05:09:43,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:09:43,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 05:09:43,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-07 05:09:43,370 INFO L87 Difference]: Start difference. First operand 186 states and 210 transitions. Second operand 12 states. [2020-11-07 05:09:45,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:09:45,089 INFO L93 Difference]: Finished difference Result 328 states and 374 transitions. [2020-11-07 05:09:45,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 05:09:45,090 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 86 [2020-11-07 05:09:45,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:09:45,096 INFO L225 Difference]: With dead ends: 328 [2020-11-07 05:09:45,096 INFO L226 Difference]: Without dead ends: 198 [2020-11-07 05:09:45,099 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2020-11-07 05:09:45,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2020-11-07 05:09:45,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 188. [2020-11-07 05:09:45,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-11-07 05:09:45,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 213 transitions. [2020-11-07 05:09:45,141 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 213 transitions. Word has length 86 [2020-11-07 05:09:45,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:09:45,142 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 213 transitions. [2020-11-07 05:09:45,142 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 05:09:45,142 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 213 transitions. [2020-11-07 05:09:45,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2020-11-07 05:09:45,147 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:09:45,147 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 05:09:45,148 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 05:09:45,148 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:09:45,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:09:45,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1179715517, now seen corresponding path program 1 times [2020-11-07 05:09:45,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:09:45,149 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [243241168] [2020-11-07 05:09:45,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:09:45,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:09:45,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:09:45,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:09:45,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-07 05:09:45,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:09:45,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-11-07 05:09:45,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:09:45,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 05:09:45,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:09:45,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 05:09:45,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:09:45,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 05:09:45,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:09:45,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:09:45,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:09:45,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:09:45,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:09:45,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2020-11-07 05:09:45,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:09:45,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2020-11-07 05:09:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:09:45,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-11-07 05:09:45,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:09:45,550 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-11-07 05:09:45,551 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [243241168] [2020-11-07 05:09:45,551 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:09:45,551 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-11-07 05:09:45,553 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066952237] [2020-11-07 05:09:45,556 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-07 05:09:45,556 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:09:45,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-07 05:09:45,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-11-07 05:09:45,557 INFO L87 Difference]: Start difference. First operand 188 states and 213 transitions. Second operand 14 states. [2020-11-07 05:09:47,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:09:47,378 INFO L93 Difference]: Finished difference Result 327 states and 373 transitions. [2020-11-07 05:09:47,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-07 05:09:47,380 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 107 [2020-11-07 05:09:47,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:09:47,387 INFO L225 Difference]: With dead ends: 327 [2020-11-07 05:09:47,388 INFO L226 Difference]: Without dead ends: 200 [2020-11-07 05:09:47,390 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2020-11-07 05:09:47,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2020-11-07 05:09:47,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 190. [2020-11-07 05:09:47,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2020-11-07 05:09:47,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 216 transitions. [2020-11-07 05:09:47,479 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 216 transitions. Word has length 107 [2020-11-07 05:09:47,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:09:47,480 INFO L481 AbstractCegarLoop]: Abstraction has 190 states and 216 transitions. [2020-11-07 05:09:47,480 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-07 05:09:47,480 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 216 transitions. [2020-11-07 05:09:47,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-11-07 05:09:47,489 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:09:47,490 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 05:09:47,490 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 05:09:47,490 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:09:47,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:09:47,491 INFO L82 PathProgramCache]: Analyzing trace with hash 163926763, now seen corresponding path program 1 times [2020-11-07 05:09:47,491 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:09:47,492 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1095438979] [2020-11-07 05:09:47,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:09:47,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:09:47,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:09:47,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:09:47,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-07 05:09:47,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:09:47,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-11-07 05:09:47,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:09:47,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 05:09:47,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:09:47,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 05:09:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:09:47,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-07 05:09:47,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:09:47,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-11-07 05:09:47,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:09:47,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2020-11-07 05:09:47,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:09:47,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 05:09:47,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:09:47,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 05:09:47,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:09:47,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-11-07 05:09:47,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:09:47,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2020-11-07 05:09:47,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:09:47,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2020-11-07 05:09:47,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:09:48,065 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-11-07 05:09:48,065 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1095438979] [2020-11-07 05:09:48,066 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:09:48,066 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-11-07 05:09:48,066 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913606518] [2020-11-07 05:09:48,067 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-07 05:09:48,067 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:09:48,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-07 05:09:48,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2020-11-07 05:09:48,068 INFO L87 Difference]: Start difference. First operand 190 states and 216 transitions. Second operand 17 states. [2020-11-07 05:09:50,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:09:50,343 INFO L93 Difference]: Finished difference Result 310 states and 352 transitions. [2020-11-07 05:09:50,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-11-07 05:09:50,344 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 133 [2020-11-07 05:09:50,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:09:50,347 INFO L225 Difference]: With dead ends: 310 [2020-11-07 05:09:50,347 INFO L226 Difference]: Without dead ends: 200 [2020-11-07 05:09:50,349 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=158, Invalid=898, Unknown=0, NotChecked=0, Total=1056 [2020-11-07 05:09:50,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2020-11-07 05:09:50,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 192. [2020-11-07 05:09:50,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-11-07 05:09:50,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 219 transitions. [2020-11-07 05:09:50,383 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 219 transitions. Word has length 133 [2020-11-07 05:09:50,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:09:50,384 INFO L481 AbstractCegarLoop]: Abstraction has 192 states and 219 transitions. [2020-11-07 05:09:50,384 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-07 05:09:50,384 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 219 transitions. [2020-11-07 05:09:50,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2020-11-07 05:09:50,387 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:09:50,387 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 05:09:50,388 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 05:09:50,388 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:09:50,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:09:50,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1253455348, now seen corresponding path program 1 times [2020-11-07 05:09:50,389 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:09:50,389 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1170976208] [2020-11-07 05:09:50,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:09:50,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 05:09:50,431 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 05:09:50,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 05:09:50,474 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 05:09:50,540 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-11-07 05:09:50,541 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-07 05:09:50,541 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 05:09:50,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:09:50 BoogieIcfgContainer [2020-11-07 05:09:50,652 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 05:09:50,658 INFO L168 Benchmark]: Toolchain (without parser) took 12293.55 ms. Allocated memory was 151.0 MB in the beginning and 291.5 MB in the end (delta: 140.5 MB). Free memory was 126.5 MB in the beginning and 184.3 MB in the end (delta: -57.8 MB). Peak memory consumption was 83.1 MB. Max. memory is 8.0 GB. [2020-11-07 05:09:50,658 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 151.0 MB. Free memory is still 126.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 05:09:50,659 INFO L168 Benchmark]: CACSL2BoogieTranslator took 445.91 ms. Allocated memory is still 151.0 MB. Free memory was 125.7 MB in the beginning and 114.2 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. [2020-11-07 05:09:50,660 INFO L168 Benchmark]: Boogie Preprocessor took 65.23 ms. Allocated memory is still 151.0 MB. Free memory was 114.2 MB in the beginning and 111.9 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-07 05:09:50,661 INFO L168 Benchmark]: RCFGBuilder took 887.31 ms. Allocated memory is still 151.0 MB. Free memory was 111.9 MB in the beginning and 103.4 MB in the end (delta: 8.5 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2020-11-07 05:09:50,664 INFO L168 Benchmark]: TraceAbstraction took 10875.97 ms. Allocated memory was 151.0 MB in the beginning and 291.5 MB in the end (delta: 140.5 MB). Free memory was 102.8 MB in the beginning and 184.3 MB in the end (delta: -81.5 MB). Peak memory consumption was 60.1 MB. Max. memory is 8.0 GB. [2020-11-07 05:09:50,670 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.27 ms. Allocated memory is still 151.0 MB. Free memory is still 126.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 445.91 ms. Allocated memory is still 151.0 MB. Free memory was 125.7 MB in the beginning and 114.2 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 65.23 ms. Allocated memory is still 151.0 MB. Free memory was 114.2 MB in the beginning and 111.9 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 887.31 ms. Allocated memory is still 151.0 MB. Free memory was 111.9 MB in the beginning and 103.4 MB in the end (delta: 8.5 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 10875.97 ms. Allocated memory was 151.0 MB in the beginning and 291.5 MB in the end (delta: 140.5 MB). Free memory was 102.8 MB in the beginning and 184.3 MB in the end (delta: -81.5 MB). Peak memory consumption was 60.1 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()) VAL [__VERIFIER_nondet_bool()=0] [L28] struct node *n = (struct node *)malloc(sizeof(struct node)); VAL [malloc(sizeof(struct node))={-1:0}, n={-1:0}] [L29] n->data = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=2147483647, malloc(sizeof(struct node))={-1:0}, n={-1:0}] [L30] CALL, EXPR nondet_tree() [L25] COND TRUE __VERIFIER_nondet_bool() VAL [__VERIFIER_nondet_bool()=1] [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() VAL [malloc(sizeof(struct node))={-1:0}, n={-1:0}, nondet_tree()={0:0}] [L31] CALL, EXPR nondet_tree() [L25] COND TRUE __VERIFIER_nondet_bool() VAL [__VERIFIER_nondet_bool()=1] [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() VAL [malloc(sizeof(struct node))={-1:0}, n={-1:0}, nondet_tree()={0:0}] [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) VAL [n={-1:0}, n={-1:0}] [L40] EXPR n->data VAL [n={-1:0}, n={-1:0}, n->data=2147483647] [L40] int a = n->data; VAL [a=2147483647, n={-1:0}, n={-1:0}, n->data=2147483647] [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 VAL [n={0:0}, n={0:0}] [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); VAL [a=2147483647, b=2147483647, min(n->left)=2147483647, n={-1:0}, n={-1:0}, n->left={0:0}] [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 VAL [n={0:0}, n={0:0}] [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); VAL [a=2147483647, b=2147483647, c=2147483647, min(n->right)=2147483647, n={-1:0}, n={-1:0}, n->right={0:0}] [L43] COND TRUE b <= a && b <= c VAL [a=2147483647, b=2147483647, c=2147483647, n={-1:0}, n={-1:0}] [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); VAL [a=2147483647, min(t)=2147483647, t={-1:0}, t={-1:0}] [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) VAL [t={-1:0}, t={-1:0}] [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 VAL [t={0:0}, t={0:0}] [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 VAL [t={0:0}, t={0:0}] [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; VAL [\result=1, size(t->left)=0, size(t->right)=0, t={-1:0}, t={-1:0}, t->left={0:0}, t->right={0:0}] [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); VAL [a=2147483647, b={3:0}, n=1, size(t)=1, t={-1:0}, t={-1:0}] [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) VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=1, t={-1:0}, t={-1:0}] [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 VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=1, t={0:0}, t={0:0}] [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) 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] [L66] EXPR i++ VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=2, i++=1, t={-1:0}, t={-1:0}] [L66] EXPR t->data VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=2, i++=1, t={-1:0}, t={-1:0}, t->data=2147483647] [L66] a[i++] = t->data VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=2, i++=1, t={-1:0}, t={-1:0}, t->data=2147483647] [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 VAL [\old(i)=2, a={-2:0}, a={-2:0}, i=2, t={0:0}, t={0:0}] [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) 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] [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, 199 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 10.6s, OverallIterations: 5, TraceHistogramMax: 3, AutomataDifference: 7.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 701 SDtfs, 1668 SDslu, 2462 SDs, 0 SdLazy, 4422 SolverSat, 641 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 163 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=199occurred 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.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 41 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 557 NumberOfCodeBlocks, 557 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 388 ConstructedInterpolants, 0 QuantifiedInterpolants, 137250 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 70/74 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...