/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_iter.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 06:50:40,370 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 06:50:40,376 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 06:50:40,447 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 06:50:40,448 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 06:50:40,455 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 06:50:40,461 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 06:50:40,471 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 06:50:40,475 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 06:50:40,482 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 06:50:40,503 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 06:50:40,505 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 06:50:40,506 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 06:50:40,507 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 06:50:40,508 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 06:50:40,509 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 06:50:40,510 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 06:50:40,515 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 06:50:40,524 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 06:50:40,530 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 06:50:40,535 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 06:50:40,538 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 06:50:40,542 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 06:50:40,545 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 06:50:40,556 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 06:50:40,557 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 06:50:40,560 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 06:50:40,563 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 06:50:40,564 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 06:50:40,565 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 06:50:40,565 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 06:50:40,566 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 06:50:40,569 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 06:50:40,570 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 06:50:40,572 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 06:50:40,572 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 06:50:40,573 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 06:50:40,573 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 06:50:40,573 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 06:50:40,575 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 06:50:40,576 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 06:50:40,577 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 06:50:40,607 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 06:50:40,608 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 06:50:40,614 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 06:50:40,615 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 06:50:40,615 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 06:50:40,615 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 06:50:40,616 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 06:50:40,616 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 06:50:40,616 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 06:50:40,616 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 06:50:40,618 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 06:50:40,618 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 06:50:40,618 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 06:50:40,619 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 06:50:40,619 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 06:50:40,619 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 06:50:40,620 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 06:50:40,620 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 06:50:40,620 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 06:50:40,621 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 06:50:40,621 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 06:50:40,621 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 06:50:40,621 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 06:50:41,115 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 06:50:41,152 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 06:50:41,156 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 06:50:41,158 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 06:50:41,159 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 06:50:41,160 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-07 06:50:41,278 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9528f9f9c/51dfec9d3b794634838b5d61d933b178/FLAGafa39f8fe [2020-11-07 06:50:41,991 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 06:50:41,994 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_iter.c [2020-11-07 06:50:42,007 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9528f9f9c/51dfec9d3b794634838b5d61d933b178/FLAGafa39f8fe [2020-11-07 06:50:42,361 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9528f9f9c/51dfec9d3b794634838b5d61d933b178 [2020-11-07 06:50:42,367 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 06:50:42,377 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 06:50:42,385 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 06:50:42,385 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 06:50:42,390 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 06:50:42,392 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:50:42" (1/1) ... [2020-11-07 06:50:42,402 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6549c0ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:42, skipping insertion in model container [2020-11-07 06:50:42,402 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:50:42" (1/1) ... [2020-11-07 06:50:42,413 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 06:50:42,457 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 06:50:42,803 WARN L1500 CHandler]: Possible shadowing of function min [2020-11-07 06:50:42,843 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 06:50:42,874 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 06:50:42,934 WARN L1500 CHandler]: Possible shadowing of function min [2020-11-07 06:50:42,958 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 06:50:42,985 INFO L208 MainTranslator]: Completed translation [2020-11-07 06:50:42,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:42 WrapperNode [2020-11-07 06:50:42,986 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 06:50:42,987 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 06:50:42,988 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 06:50:42,988 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 06:50:43,006 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:42" (1/1) ... [2020-11-07 06:50:43,006 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:42" (1/1) ... [2020-11-07 06:50:43,022 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:42" (1/1) ... [2020-11-07 06:50:43,022 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:42" (1/1) ... [2020-11-07 06:50:43,042 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:42" (1/1) ... [2020-11-07 06:50:43,049 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:42" (1/1) ... [2020-11-07 06:50:43,053 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:42" (1/1) ... [2020-11-07 06:50:43,059 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 06:50:43,060 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 06:50:43,060 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 06:50:43,060 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 06:50:43,062 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:42" (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 06:50:43,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 06:50:43,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 06:50:43,161 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_cycle_if_not [2020-11-07 06:50:43,161 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 06:50:43,162 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-11-07 06:50:43,162 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2020-11-07 06:50:43,162 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2020-11-07 06:50:43,162 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2020-11-07 06:50:43,163 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2020-11-07 06:50:43,163 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2020-11-07 06:50:43,163 INFO L138 BoogieDeclarations]: Found implementation of procedure task [2020-11-07 06:50:43,163 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 06:50:43,163 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2020-11-07 06:50:43,164 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-11-07 06:50:43,164 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-11-07 06:50:43,164 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-11-07 06:50:43,164 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 06:50:43,164 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2020-11-07 06:50:43,165 INFO L130 BoogieDeclarations]: Found specification of procedure assume_cycle_if_not [2020-11-07 06:50:43,165 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 06:50:43,165 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 06:50:43,165 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 06:50:43,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 06:50:43,166 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-11-07 06:50:43,166 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2020-11-07 06:50:43,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-11-07 06:50:43,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 06:50:43,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-07 06:50:43,167 INFO L130 BoogieDeclarations]: Found specification of procedure min [2020-11-07 06:50:43,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 06:50:43,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-11-07 06:50:43,168 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2020-11-07 06:50:43,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 06:50:43,168 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2020-11-07 06:50:43,168 INFO L130 BoogieDeclarations]: Found specification of procedure size [2020-11-07 06:50:43,168 INFO L130 BoogieDeclarations]: Found specification of procedure task [2020-11-07 06:50:43,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2020-11-07 06:50:43,169 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 06:50:43,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 06:50:43,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 06:50:43,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 06:50:44,172 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 06:50:44,172 INFO L298 CfgBuilder]: Removed 3 assume(true) statements. [2020-11-07 06:50:44,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:50:44 BoogieIcfgContainer [2020-11-07 06:50:44,175 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 06:50:44,177 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 06:50:44,177 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 06:50:44,182 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 06:50:44,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:50:42" (1/3) ... [2020-11-07 06:50:44,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a37f14c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:50:44, skipping insertion in model container [2020-11-07 06:50:44,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:50:42" (2/3) ... [2020-11-07 06:50:44,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a37f14c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:50:44, skipping insertion in model container [2020-11-07 06:50:44,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:50:44" (3/3) ... [2020-11-07 06:50:44,186 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_del_iter.c [2020-11-07 06:50:44,204 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 06:50:44,209 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 06:50:44,224 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 06:50:44,252 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 06:50:44,253 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 06:50:44,253 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 06:50:44,253 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 06:50:44,253 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 06:50:44,254 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 06:50:44,254 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 06:50:44,254 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 06:50:44,277 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states. [2020-11-07 06:50:44,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-11-07 06:50:44,294 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:50:44,295 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 06:50:44,296 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:50:44,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:50:44,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1791888388, now seen corresponding path program 1 times [2020-11-07 06:50:44,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:50:44,314 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [177925650] [2020-11-07 06:50:44,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:50:44,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:44,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:50:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:44,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-07 06:50:44,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:44,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-07 06:50:44,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:44,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:50:44,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:44,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-11-07 06:50:44,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:44,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2020-11-07 06:50:44,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:44,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2020-11-07 06:50:45,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:45,029 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 06:50:45,030 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [177925650] [2020-11-07 06:50:45,033 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:50:45,034 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-07 06:50:45,035 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843545791] [2020-11-07 06:50:45,042 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-07 06:50:45,043 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:50:45,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-07 06:50:45,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-11-07 06:50:45,065 INFO L87 Difference]: Start difference. First operand 215 states. Second operand 11 states. [2020-11-07 06:50:47,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:50:47,579 INFO L93 Difference]: Finished difference Result 376 states and 438 transitions. [2020-11-07 06:50:47,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-07 06:50:47,582 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2020-11-07 06:50:47,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:50:47,599 INFO L225 Difference]: With dead ends: 376 [2020-11-07 06:50:47,600 INFO L226 Difference]: Without dead ends: 216 [2020-11-07 06:50:47,607 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2020-11-07 06:50:47,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2020-11-07 06:50:47,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 202. [2020-11-07 06:50:47,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2020-11-07 06:50:47,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 226 transitions. [2020-11-07 06:50:47,716 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 226 transitions. Word has length 66 [2020-11-07 06:50:47,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:50:47,718 INFO L481 AbstractCegarLoop]: Abstraction has 202 states and 226 transitions. [2020-11-07 06:50:47,718 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-07 06:50:47,718 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 226 transitions. [2020-11-07 06:50:47,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-11-07 06:50:47,724 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:50:47,724 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 06:50:47,725 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 06:50:47,725 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:50:47,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:50:47,726 INFO L82 PathProgramCache]: Analyzing trace with hash 753948554, now seen corresponding path program 1 times [2020-11-07 06:50:47,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:50:47,727 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1152965272] [2020-11-07 06:50:47,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:50:47,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:47,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:50:47,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:47,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-07 06:50:47,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:48,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-11-07 06:50:48,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:48,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:50:48,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:48,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 06:50:48,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:48,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 06:50:48,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:48,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-11-07 06:50:48,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:48,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2020-11-07 06:50:48,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:48,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2020-11-07 06:50:48,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:48,196 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 06:50:48,196 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1152965272] [2020-11-07 06:50:48,197 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:50:48,197 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-11-07 06:50:48,197 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850038387] [2020-11-07 06:50:48,199 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 06:50:48,200 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:50:48,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 06:50:48,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-11-07 06:50:48,201 INFO L87 Difference]: Start difference. First operand 202 states and 226 transitions. Second operand 12 states. [2020-11-07 06:50:50,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:50:50,239 INFO L93 Difference]: Finished difference Result 361 states and 407 transitions. [2020-11-07 06:50:50,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-07 06:50:50,239 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 86 [2020-11-07 06:50:50,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:50:50,244 INFO L225 Difference]: With dead ends: 361 [2020-11-07 06:50:50,245 INFO L226 Difference]: Without dead ends: 215 [2020-11-07 06:50:50,248 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 06:50:50,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2020-11-07 06:50:50,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 204. [2020-11-07 06:50:50,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2020-11-07 06:50:50,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 229 transitions. [2020-11-07 06:50:50,308 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 229 transitions. Word has length 86 [2020-11-07 06:50:50,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:50:50,309 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 229 transitions. [2020-11-07 06:50:50,309 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 06:50:50,309 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 229 transitions. [2020-11-07 06:50:50,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2020-11-07 06:50:50,314 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:50:50,314 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 06:50:50,315 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 06:50:50,315 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:50:50,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:50:50,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1318257437, now seen corresponding path program 1 times [2020-11-07 06:50:50,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:50:50,317 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [817507322] [2020-11-07 06:50:50,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:50:50,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:50,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:50:50,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:50,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-07 06:50:50,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:50,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-11-07 06:50:50,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:50,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 06:50:50,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:50,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:50:50,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:50,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-11-07 06:50:50,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:50,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 06:50:50,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:50,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 06:50:50,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:50,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2020-11-07 06:50:50,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:50,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2020-11-07 06:50:50,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:50,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2020-11-07 06:50:50,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:50,716 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 06:50:50,717 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [817507322] [2020-11-07 06:50:50,718 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:50:50,718 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-11-07 06:50:50,718 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36115851] [2020-11-07 06:50:50,719 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-07 06:50:50,719 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:50:50,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-07 06:50:50,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-11-07 06:50:50,721 INFO L87 Difference]: Start difference. First operand 204 states and 229 transitions. Second operand 14 states. [2020-11-07 06:50:52,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:50:52,711 INFO L93 Difference]: Finished difference Result 360 states and 406 transitions. [2020-11-07 06:50:52,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-07 06:50:52,712 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 107 [2020-11-07 06:50:52,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:50:52,716 INFO L225 Difference]: With dead ends: 360 [2020-11-07 06:50:52,716 INFO L226 Difference]: Without dead ends: 217 [2020-11-07 06:50:52,718 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 06:50:52,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2020-11-07 06:50:52,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 206. [2020-11-07 06:50:52,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2020-11-07 06:50:52,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 232 transitions. [2020-11-07 06:50:52,765 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 232 transitions. Word has length 107 [2020-11-07 06:50:52,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:50:52,766 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 232 transitions. [2020-11-07 06:50:52,766 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-07 06:50:52,766 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 232 transitions. [2020-11-07 06:50:52,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2020-11-07 06:50:52,769 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:50:52,770 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 06:50:52,770 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 06:50:52,770 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:50:52,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:50:52,771 INFO L82 PathProgramCache]: Analyzing trace with hash 782152357, now seen corresponding path program 1 times [2020-11-07 06:50:52,771 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:50:52,772 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [566937148] [2020-11-07 06:50:52,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:50:52,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:52,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:50:52,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:52,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-07 06:50:52,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:53,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-11-07 06:50:53,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:53,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-11-07 06:50:53,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:53,044 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:50:53,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:53,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-07 06:50:53,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:53,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-11-07 06:50:53,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:53,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2020-11-07 06:50:53,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:53,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-07 06:50:53,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:53,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-07 06:50:53,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:53,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-11-07 06:50:53,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:53,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2020-11-07 06:50:53,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:53,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2020-11-07 06:50:53,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:50:53,285 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 06:50:53,286 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [566937148] [2020-11-07 06:50:53,286 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:50:53,286 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-11-07 06:50:53,287 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980734127] [2020-11-07 06:50:53,288 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-07 06:50:53,288 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:50:53,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-07 06:50:53,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2020-11-07 06:50:53,289 INFO L87 Difference]: Start difference. First operand 206 states and 232 transitions. Second operand 17 states. [2020-11-07 06:50:55,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:50:55,899 INFO L93 Difference]: Finished difference Result 343 states and 385 transitions. [2020-11-07 06:50:55,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-11-07 06:50:55,900 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 133 [2020-11-07 06:50:55,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:50:55,904 INFO L225 Difference]: With dead ends: 343 [2020-11-07 06:50:55,905 INFO L226 Difference]: Without dead ends: 217 [2020-11-07 06:50:55,906 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=158, Invalid=898, Unknown=0, NotChecked=0, Total=1056 [2020-11-07 06:50:55,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2020-11-07 06:50:55,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 208. [2020-11-07 06:50:55,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2020-11-07 06:50:55,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 236 transitions. [2020-11-07 06:50:55,949 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 236 transitions. Word has length 133 [2020-11-07 06:50:55,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:50:55,949 INFO L481 AbstractCegarLoop]: Abstraction has 208 states and 236 transitions. [2020-11-07 06:50:55,949 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-07 06:50:55,950 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 236 transitions. [2020-11-07 06:50:55,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2020-11-07 06:50:55,952 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:50:55,953 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 06:50:55,953 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 06:50:55,953 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:50:55,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:50:55,954 INFO L82 PathProgramCache]: Analyzing trace with hash 2078905262, now seen corresponding path program 1 times [2020-11-07 06:50:55,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:50:55,955 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1856419348] [2020-11-07 06:50:55,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:50:56,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 06:50:56,007 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 06:50:56,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-07 06:50:56,059 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-07 06:50:56,127 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-11-07 06:50:56,127 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-07 06:50:56,128 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 06:50:56,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 06:50:56 BoogieIcfgContainer [2020-11-07 06:50:56,221 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 06:50:56,224 INFO L168 Benchmark]: Toolchain (without parser) took 13853.02 ms. Allocated memory was 165.7 MB in the beginning and 329.3 MB in the end (delta: 163.6 MB). Free memory was 142.4 MB in the beginning and 143.0 MB in the end (delta: -567.2 kB). Peak memory consumption was 163.2 MB. Max. memory is 8.0 GB. [2020-11-07 06:50:56,225 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 165.7 MB. Free memory was 138.8 MB in the beginning and 138.8 MB in the end (delta: 82.9 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 06:50:56,226 INFO L168 Benchmark]: CACSL2BoogieTranslator took 601.90 ms. Allocated memory is still 165.7 MB. Free memory was 141.7 MB in the beginning and 130.0 MB in the end (delta: 11.7 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. [2020-11-07 06:50:56,227 INFO L168 Benchmark]: Boogie Preprocessor took 71.74 ms. Allocated memory is still 165.7 MB. Free memory was 129.9 MB in the beginning and 127.6 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-07 06:50:56,228 INFO L168 Benchmark]: RCFGBuilder took 1114.79 ms. Allocated memory is still 165.7 MB. Free memory was 127.5 MB in the beginning and 116.7 MB in the end (delta: 10.8 MB). Peak memory consumption was 14.9 MB. Max. memory is 8.0 GB. [2020-11-07 06:50:56,229 INFO L168 Benchmark]: TraceAbstraction took 12044.32 ms. Allocated memory was 165.7 MB in the beginning and 329.3 MB in the end (delta: 163.6 MB). Free memory was 116.3 MB in the beginning and 143.0 MB in the end (delta: -26.7 MB). Peak memory consumption was 137.8 MB. Max. memory is 8.0 GB. [2020-11-07 06:50:56,233 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 165.7 MB. Free memory was 138.8 MB in the beginning and 138.8 MB in the end (delta: 82.9 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 601.90 ms. Allocated memory is still 165.7 MB. Free memory was 141.7 MB in the beginning and 130.0 MB in the end (delta: 11.7 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 71.74 ms. Allocated memory is still 165.7 MB. Free memory was 129.9 MB in the beginning and 127.6 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1114.79 ms. Allocated memory is still 165.7 MB. Free memory was 127.5 MB in the beginning and 116.7 MB in the end (delta: 10.8 MB). Peak memory consumption was 14.9 MB. Max. memory is 8.0 GB. * TraceAbstraction took 12044.32 ms. Allocated memory was 165.7 MB in the beginning and 329.3 MB in the end (delta: 163.6 MB). Free memory was 116.3 MB in the beginning and 143.0 MB in the end (delta: -26.7 MB). Peak memory consumption was 137.8 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()) 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}] [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) 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}] [L86] RET, EXPR min(t) VAL [min(t)=2147483647, t={-1:0}, t={-1:0}] [L86] int a = min(t); VAL [a=2147483647, min(t)=2147483647, t={-1:0}, t={-1:0}] [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) VAL [t={-1:0}, t={-1:0}] [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 VAL [t={0:0}, t={0:0}] [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 VAL [t={0:0}, t={0:0}] [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; 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}] [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); VAL [a=2147483647, b={3:0}, n=1, size(t)=1, t={-1:0}, t={-1:0}] [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) VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=1, t={-1:0}, t={-1:0}] [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 VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=1, t={0:0}, t={0:0}] [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) 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] [L74] EXPR i++ VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=2, i++=1, t={-1:0}, t={-1:0}] [L74] 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] [L74] 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] [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 VAL [\old(i)=2, a={-2:0}, a={-2:0}, i=2, t={0:0}, t={0:0}] [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) 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] [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, 215 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 11.8s, OverallIterations: 5, TraceHistogramMax: 3, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 741 SDtfs, 1336 SDslu, 2383 SDs, 0 SdLazy, 5192 SolverSat, 451 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 163 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=215occurred 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, 45 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s 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...