/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/verifythis/tree_del_iter.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-c225d54 [2021-05-03 00:37:06,542 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-03 00:37:06,545 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-03 00:37:06,590 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-03 00:37:06,590 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-03 00:37:06,595 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-03 00:37:06,601 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-03 00:37:06,604 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-03 00:37:06,608 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-03 00:37:06,609 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-03 00:37:06,610 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-03 00:37:06,611 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-03 00:37:06,611 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-03 00:37:06,612 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-03 00:37:06,613 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-03 00:37:06,614 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-03 00:37:06,615 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-03 00:37:06,616 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-03 00:37:06,617 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-03 00:37:06,619 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-03 00:37:06,646 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-03 00:37:06,648 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-03 00:37:06,649 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-03 00:37:06,650 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-03 00:37:06,652 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-03 00:37:06,653 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-03 00:37:06,653 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-03 00:37:06,654 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-03 00:37:06,655 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-03 00:37:06,655 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-03 00:37:06,656 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-03 00:37:06,656 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-03 00:37:06,657 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-03 00:37:06,658 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-03 00:37:06,659 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-03 00:37:06,659 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-03 00:37:06,660 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-03 00:37:06,660 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-03 00:37:06,660 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-03 00:37:06,668 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-03 00:37:06,669 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-03 00:37:06,671 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2021-05-03 00:37:06,686 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-03 00:37:06,687 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-03 00:37:06,691 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-03 00:37:06,691 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-03 00:37:06,691 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-03 00:37:06,691 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-03 00:37:06,691 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-03 00:37:06,692 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-03 00:37:06,692 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-03 00:37:06,692 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-03 00:37:06,693 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-03 00:37:06,693 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-03 00:37:06,693 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-03 00:37:06,693 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-03 00:37:06,693 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-03 00:37:06,694 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-03 00:37:06,694 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-03 00:37:06,694 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-03 00:37:06,694 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-03 00:37:06,694 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-03 00:37:06,694 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-05-03 00:37:06,695 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-03 00:37:06,695 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2021-05-03 00:37:06,695 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2021-05-03 00:37:07,107 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-03 00:37:07,127 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-03 00:37:07,130 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-03 00:37:07,131 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-03 00:37:07,132 INFO L275 PluginConnector]: CDTParser initialized [2021-05-03 00:37:07,132 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/tree_del_iter.c [2021-05-03 00:37:07,213 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0f3372b2/1b1d0b4f353649aa977cc7c740dcbb3b/FLAG07cc38c67 [2021-05-03 00:37:07,811 INFO L306 CDTParser]: Found 1 translation units. [2021-05-03 00:37:07,812 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_iter.c [2021-05-03 00:37:07,820 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0f3372b2/1b1d0b4f353649aa977cc7c740dcbb3b/FLAG07cc38c67 [2021-05-03 00:37:08,149 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0f3372b2/1b1d0b4f353649aa977cc7c740dcbb3b [2021-05-03 00:37:08,152 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-03 00:37:08,157 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-03 00:37:08,160 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-03 00:37:08,160 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-03 00:37:08,166 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-03 00:37:08,168 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 12:37:08" (1/1) ... [2021-05-03 00:37:08,169 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e8faf53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:37:08, skipping insertion in model container [2021-05-03 00:37:08,169 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 12:37:08" (1/1) ... [2021-05-03 00:37:08,177 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-03 00:37:08,204 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-03 00:37:08,340 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_iter.c[586,599] [2021-05-03 00:37:08,358 WARN L1507 CHandler]: Possible shadowing of function min [2021-05-03 00:37:08,372 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-03 00:37:08,388 INFO L203 MainTranslator]: Completed pre-run [2021-05-03 00:37:08,400 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_iter.c[586,599] [2021-05-03 00:37:08,409 WARN L1507 CHandler]: Possible shadowing of function min [2021-05-03 00:37:08,419 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-03 00:37:08,468 INFO L208 MainTranslator]: Completed translation [2021-05-03 00:37:08,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:37:08 WrapperNode [2021-05-03 00:37:08,469 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-03 00:37:08,470 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-03 00:37:08,470 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-03 00:37:08,470 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-03 00:37:08,498 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:37:08" (1/1) ... [2021-05-03 00:37:08,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:37:08" (1/1) ... [2021-05-03 00:37:08,510 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:37:08" (1/1) ... [2021-05-03 00:37:08,511 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:37:08" (1/1) ... [2021-05-03 00:37:08,526 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:37:08" (1/1) ... [2021-05-03 00:37:08,531 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:37:08" (1/1) ... [2021-05-03 00:37:08,534 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:37:08" (1/1) ... [2021-05-03 00:37:08,538 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-03 00:37:08,545 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-03 00:37:08,545 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-03 00:37:08,545 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-03 00:37:08,547 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:37:08" (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 [2021-05-03 00:37:08,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-03 00:37:08,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-03 00:37:08,613 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_cycle_if_not [2021-05-03 00:37:08,613 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-03 00:37:08,614 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-03 00:37:08,614 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2021-05-03 00:37:08,614 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2021-05-03 00:37:08,614 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2021-05-03 00:37:08,614 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2021-05-03 00:37:08,615 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2021-05-03 00:37:08,615 INFO L138 BoogieDeclarations]: Found implementation of procedure task [2021-05-03 00:37:08,615 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-03 00:37:08,615 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2021-05-03 00:37:08,615 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-05-03 00:37:08,615 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-05-03 00:37:08,615 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-05-03 00:37:08,615 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-05-03 00:37:08,615 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2021-05-03 00:37:08,616 INFO L130 BoogieDeclarations]: Found specification of procedure assume_cycle_if_not [2021-05-03 00:37:08,616 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-03 00:37:08,616 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-03 00:37:08,616 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-03 00:37:08,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-03 00:37:08,616 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-03 00:37:08,616 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2021-05-03 00:37:08,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-05-03 00:37:08,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-03 00:37:08,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-05-03 00:37:08,617 INFO L130 BoogieDeclarations]: Found specification of procedure min [2021-05-03 00:37:08,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-03 00:37:08,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-05-03 00:37:08,617 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2021-05-03 00:37:08,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-03 00:37:08,617 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2021-05-03 00:37:08,617 INFO L130 BoogieDeclarations]: Found specification of procedure size [2021-05-03 00:37:08,617 INFO L130 BoogieDeclarations]: Found specification of procedure task [2021-05-03 00:37:08,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2021-05-03 00:37:08,618 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-03 00:37:08,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-03 00:37:08,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-03 00:37:08,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-03 00:37:09,208 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-03 00:37:09,209 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2021-05-03 00:37:09,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 12:37:09 BoogieIcfgContainer [2021-05-03 00:37:09,211 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-03 00:37:09,216 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-03 00:37:09,217 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-03 00:37:09,220 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-03 00:37:09,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.05 12:37:08" (1/3) ... [2021-05-03 00:37:09,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@646fb831 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 12:37:09, skipping insertion in model container [2021-05-03 00:37:09,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:37:08" (2/3) ... [2021-05-03 00:37:09,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@646fb831 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 12:37:09, skipping insertion in model container [2021-05-03 00:37:09,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 12:37:09" (3/3) ... [2021-05-03 00:37:09,224 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_del_iter.c [2021-05-03 00:37:09,232 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-05-03 00:37:09,236 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-03 00:37:09,253 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-03 00:37:09,281 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-03 00:37:09,281 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-03 00:37:09,281 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-05-03 00:37:09,282 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-03 00:37:09,282 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-03 00:37:09,282 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-03 00:37:09,282 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-03 00:37:09,282 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-03 00:37:09,310 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 60 states have (on average 1.2666666666666666) internal successors, (76), 61 states have internal predecessors, (76), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2021-05-03 00:37:09,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-05-03 00:37:09,321 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:37:09,321 INFO L523 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] [2021-05-03 00:37:09,322 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:37:09,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:37:09,327 INFO L82 PathProgramCache]: Analyzing trace with hash -738616471, now seen corresponding path program 1 times [2021-05-03 00:37:09,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:37:09,343 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [84168652] [2021-05-03 00:37:09,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:37:09,422 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-03 00:37:09,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:37:09,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:37:09,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:37:09,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-05-03 00:37:09,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:37:09,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-03 00:37:09,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:37:09,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-05-03 00:37:09,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:37:09,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-05-03 00:37:09,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:37:09,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-05-03 00:37:09,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:37:10,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-05-03 00:37:10,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:37:10,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-03 00:37:10,029 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:37:10,030 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [84168652] [2021-05-03 00:37:10,032 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [84168652] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:37:10,032 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:37:10,032 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-05-03 00:37:10,032 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757843872] [2021-05-03 00:37:10,039 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-05-03 00:37:10,039 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:37:10,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-05-03 00:37:10,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-05-03 00:37:10,055 INFO L87 Difference]: Start difference. First operand has 98 states, 60 states have (on average 1.2666666666666666) internal successors, (76), 61 states have internal predecessors, (76), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (10), 6 states have call predecessors, (10), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-05-03 00:37:11,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:37:11,026 INFO L93 Difference]: Finished difference Result 174 states and 235 transitions. [2021-05-03 00:37:11,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-03 00:37:11,028 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (10), 6 states have call predecessors, (10), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 44 [2021-05-03 00:37:11,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:37:11,038 INFO L225 Difference]: With dead ends: 174 [2021-05-03 00:37:11,038 INFO L226 Difference]: Without dead ends: 98 [2021-05-03 00:37:11,041 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 348.1ms TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2021-05-03 00:37:11,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2021-05-03 00:37:11,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 91. [2021-05-03 00:37:11,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 56 states have internal predecessors, (64), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (26), 23 states have call predecessors, (26), 23 states have call successors, (26) [2021-05-03 00:37:11,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 115 transitions. [2021-05-03 00:37:11,099 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 115 transitions. Word has length 44 [2021-05-03 00:37:11,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:37:11,100 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 115 transitions. [2021-05-03 00:37:11,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (10), 6 states have call predecessors, (10), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-05-03 00:37:11,100 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 115 transitions. [2021-05-03 00:37:11,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-05-03 00:37:11,103 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:37:11,103 INFO L523 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:37:11,104 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-03 00:37:11,104 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:37:11,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:37:11,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1232690542, now seen corresponding path program 1 times [2021-05-03 00:37:11,105 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:37:11,105 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1467971392] [2021-05-03 00:37:11,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:37:11,109 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-03 00:37:11,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:37:11,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:37:11,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:37:11,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-05-03 00:37:11,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:37:11,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-05-03 00:37:11,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:37:11,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-05-03 00:37:11,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:37:11,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-05-03 00:37:11,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:37:11,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-05-03 00:37:11,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:37:11,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-05-03 00:37:11,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:37:11,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-05-03 00:37:11,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:37:11,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-05-03 00:37:11,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:37:11,315 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-05-03 00:37:11,315 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:37:11,315 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1467971392] [2021-05-03 00:37:11,315 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1467971392] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:37:11,315 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:37:11,316 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-05-03 00:37:11,316 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115946400] [2021-05-03 00:37:11,317 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-05-03 00:37:11,317 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:37:11,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-05-03 00:37:11,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2021-05-03 00:37:11,318 INFO L87 Difference]: Start difference. First operand 91 states and 115 transitions. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 6 states have internal predecessors, (32), 5 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2021-05-03 00:37:12,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:37:12,171 INFO L93 Difference]: Finished difference Result 165 states and 211 transitions. [2021-05-03 00:37:12,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-05-03 00:37:12,171 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 6 states have internal predecessors, (32), 5 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 56 [2021-05-03 00:37:12,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:37:12,184 INFO L225 Difference]: With dead ends: 165 [2021-05-03 00:37:12,185 INFO L226 Difference]: Without dead ends: 97 [2021-05-03 00:37:12,187 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 355.8ms TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2021-05-03 00:37:12,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-05-03 00:37:12,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2021-05-03 00:37:12,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 58 states have internal predecessors, (65), 25 states have call successors, (25), 11 states have call predecessors, (25), 11 states have return successors, (28), 23 states have call predecessors, (28), 23 states have call successors, (28) [2021-05-03 00:37:12,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 118 transitions. [2021-05-03 00:37:12,209 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 118 transitions. Word has length 56 [2021-05-03 00:37:12,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:37:12,209 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 118 transitions. [2021-05-03 00:37:12,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 6 states have internal predecessors, (32), 5 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2021-05-03 00:37:12,209 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 118 transitions. [2021-05-03 00:37:12,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-05-03 00:37:12,212 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:37:12,212 INFO L523 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:37:12,212 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-03 00:37:12,213 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:37:12,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:37:12,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1976466705, now seen corresponding path program 1 times [2021-05-03 00:37:12,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:37:12,214 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [780743931] [2021-05-03 00:37:12,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:37:12,217 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-03 00:37:12,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:37:12,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:37:12,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:37:12,315 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-05-03 00:37:12,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:37:12,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-05-03 00:37:12,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:37:12,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:37:12,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:37:12,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-05-03 00:37:12,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:37:12,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-05-03 00:37:12,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:37:12,407 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-05-03 00:37:12,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:37:12,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-05-03 00:37:12,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:37:12,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-05-03 00:37:12,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:37:12,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-05-03 00:37:12,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:37:12,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2021-05-03 00:37:12,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:37:12,449 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-05-03 00:37:12,449 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:37:12,449 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [780743931] [2021-05-03 00:37:12,449 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [780743931] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:37:12,449 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:37:12,450 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-05-03 00:37:12,450 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10746692] [2021-05-03 00:37:12,450 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-05-03 00:37:12,451 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:37:12,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-05-03 00:37:12,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2021-05-03 00:37:12,452 INFO L87 Difference]: Start difference. First operand 93 states and 118 transitions. Second operand has 13 states, 11 states have (on average 3.090909090909091) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (14), 7 states have call predecessors, (14), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2021-05-03 00:37:13,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:37:13,182 INFO L93 Difference]: Finished difference Result 164 states and 210 transitions. [2021-05-03 00:37:13,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-05-03 00:37:13,182 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.090909090909091) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (14), 7 states have call predecessors, (14), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 66 [2021-05-03 00:37:13,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:37:13,189 INFO L225 Difference]: With dead ends: 164 [2021-05-03 00:37:13,189 INFO L226 Difference]: Without dead ends: 99 [2021-05-03 00:37:13,193 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 266.9ms TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2021-05-03 00:37:13,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-05-03 00:37:13,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2021-05-03 00:37:13,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 57 states have (on average 1.1578947368421053) internal successors, (66), 60 states have internal predecessors, (66), 25 states have call successors, (25), 11 states have call predecessors, (25), 12 states have return successors, (30), 23 states have call predecessors, (30), 23 states have call successors, (30) [2021-05-03 00:37:13,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 121 transitions. [2021-05-03 00:37:13,215 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 121 transitions. Word has length 66 [2021-05-03 00:37:13,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:37:13,215 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 121 transitions. [2021-05-03 00:37:13,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 11 states have (on average 3.090909090909091) internal successors, (34), 7 states have internal predecessors, (34), 5 states have call successors, (14), 7 states have call predecessors, (14), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2021-05-03 00:37:13,216 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 121 transitions. [2021-05-03 00:37:13,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-05-03 00:37:13,217 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:37:13,218 INFO L523 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:37:13,218 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-03 00:37:13,218 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:37:13,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:37:13,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1818938389, now seen corresponding path program 1 times [2021-05-03 00:37:13,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:37:13,219 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2029126042] [2021-05-03 00:37:13,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:37:13,222 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-03 00:37:13,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:37:13,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-03 00:37:13,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:37:13,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2021-05-03 00:37:13,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:37:13,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-05-03 00:37:13,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:37:13,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-03 00:37:13,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:37:13,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-05-03 00:37:13,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:37:13,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-05-03 00:37:13,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:37:13,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-05-03 00:37:13,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:37:13,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2021-05-03 00:37:13,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:37:13,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-05-03 00:37:13,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:37:13,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2021-05-03 00:37:13,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:37:13,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2021-05-03 00:37:13,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:37:13,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-05-03 00:37:13,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:37:13,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2021-05-03 00:37:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-03 00:37:13,554 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-05-03 00:37:13,555 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-03 00:37:13,555 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2029126042] [2021-05-03 00:37:13,555 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [2029126042] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-03 00:37:13,555 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-03 00:37:13,556 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-05-03 00:37:13,556 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010242424] [2021-05-03 00:37:13,556 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-05-03 00:37:13,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-03 00:37:13,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-05-03 00:37:13,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2021-05-03 00:37:13,558 INFO L87 Difference]: Start difference. First operand 95 states and 121 transitions. Second operand has 17 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 11 states have internal predecessors, (40), 8 states have call successors, (16), 7 states have call predecessors, (16), 4 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2021-05-03 00:37:14,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-03 00:37:14,629 INFO L93 Difference]: Finished difference Result 152 states and 194 transitions. [2021-05-03 00:37:14,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-05-03 00:37:14,630 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 11 states have internal predecessors, (40), 8 states have call successors, (16), 7 states have call predecessors, (16), 4 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) Word has length 79 [2021-05-03 00:37:14,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-03 00:37:14,631 INFO L225 Difference]: With dead ends: 152 [2021-05-03 00:37:14,632 INFO L226 Difference]: Without dead ends: 99 [2021-05-03 00:37:14,633 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 577.7ms TimeCoverageRelationStatistics Valid=141, Invalid=729, Unknown=0, NotChecked=0, Total=870 [2021-05-03 00:37:14,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2021-05-03 00:37:14,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2021-05-03 00:37:14,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 58 states have (on average 1.1551724137931034) internal successors, (67), 62 states have internal predecessors, (67), 25 states have call successors, (25), 11 states have call predecessors, (25), 13 states have return successors, (33), 23 states have call predecessors, (33), 23 states have call successors, (33) [2021-05-03 00:37:14,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 125 transitions. [2021-05-03 00:37:14,654 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 125 transitions. Word has length 79 [2021-05-03 00:37:14,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-03 00:37:14,654 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 125 transitions. [2021-05-03 00:37:14,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 17 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 11 states have internal predecessors, (40), 8 states have call successors, (16), 7 states have call predecessors, (16), 4 states have return successors, (13), 7 states have call predecessors, (13), 6 states have call successors, (13) [2021-05-03 00:37:14,655 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 125 transitions. [2021-05-03 00:37:14,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-05-03 00:37:14,658 INFO L515 BasicCegarLoop]: Found error trace [2021-05-03 00:37:14,658 INFO L523 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-03 00:37:14,658 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-03 00:37:14,659 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-03 00:37:14,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-03 00:37:14,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1854783018, now seen corresponding path program 1 times [2021-05-03 00:37:14,659 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-03 00:37:14,660 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [100614243] [2021-05-03 00:37:14,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-03 00:37:14,666 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-03 00:37:14,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-05-03 00:37:14,729 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-05-03 00:37:14,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-05-03 00:37:14,791 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-05-03 00:37:14,850 INFO L173 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2021-05-03 00:37:14,851 INFO L624 BasicCegarLoop]: Counterexample might be feasible [2021-05-03 00:37:14,852 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-03 00:37:14,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.05 12:37:14 BoogieIcfgContainer [2021-05-03 00:37:14,880 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-03 00:37:14,881 INFO L168 Benchmark]: Toolchain (without parser) took 6724.92 ms. Allocated memory was 182.5 MB in the beginning and 281.0 MB in the end (delta: 98.6 MB). Free memory was 148.0 MB in the beginning and 225.6 MB in the end (delta: -77.6 MB). Peak memory consumption was 22.5 MB. Max. memory is 8.0 GB. [2021-05-03 00:37:14,882 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 182.5 MB. Free memory is still 164.8 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-05-03 00:37:14,882 INFO L168 Benchmark]: CACSL2BoogieTranslator took 309.18 ms. Allocated memory is still 182.5 MB. Free memory was 147.9 MB in the beginning and 166.2 MB in the end (delta: -18.3 MB). Peak memory consumption was 16.8 MB. Max. memory is 8.0 GB. [2021-05-03 00:37:14,883 INFO L168 Benchmark]: Boogie Preprocessor took 67.82 ms. Allocated memory is still 182.5 MB. Free memory was 166.2 MB in the beginning and 163.9 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-05-03 00:37:14,883 INFO L168 Benchmark]: RCFGBuilder took 666.03 ms. Allocated memory is still 182.5 MB. Free memory was 163.6 MB in the beginning and 129.0 MB in the end (delta: 34.6 MB). Peak memory consumption was 34.6 MB. Max. memory is 8.0 GB. [2021-05-03 00:37:14,883 INFO L168 Benchmark]: TraceAbstraction took 5664.23 ms. Allocated memory was 182.5 MB in the beginning and 281.0 MB in the end (delta: 98.6 MB). Free memory was 128.6 MB in the beginning and 225.6 MB in the end (delta: -97.0 MB). Peak memory consumption was 2.5 MB. Max. memory is 8.0 GB. [2021-05-03 00:37:14,886 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.12 ms. Allocated memory is still 182.5 MB. Free memory is still 164.8 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 309.18 ms. Allocated memory is still 182.5 MB. Free memory was 147.9 MB in the beginning and 166.2 MB in the end (delta: -18.3 MB). Peak memory consumption was 16.8 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 67.82 ms. Allocated memory is still 182.5 MB. Free memory was 166.2 MB in the beginning and 163.9 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 666.03 ms. Allocated memory is still 182.5 MB. Free memory was 163.6 MB in the beginning and 129.0 MB in the end (delta: 34.6 MB). Peak memory consumption was 34.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 5664.23 ms. Allocated memory was 182.5 MB in the beginning and 281.0 MB in the end (delta: 98.6 MB). Free memory was 128.6 MB in the beginning and 225.6 MB in the end (delta: -97.0 MB). Peak memory consumption was 2.5 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L110] CALL, EXPR nondet_tree() [L25] COND FALSE !(__VERIFIER_nondet_bool()) [L28] struct node *n = (struct node *)malloc(sizeof(struct node)); [L29] n->data = __VERIFIER_nondet_int() [L30] CALL, EXPR nondet_tree() [L25] COND TRUE __VERIFIER_nondet_bool() [L26] return 0; [L30] RET, EXPR nondet_tree() [L30] n->left = nondet_tree() [L31] CALL, EXPR nondet_tree() [L25] COND TRUE __VERIFIER_nondet_bool() [L26] return 0; [L31] RET, EXPR nondet_tree() [L31] n->right = nondet_tree() [L32] return n; [L110] RET, EXPR nondet_tree() [L110] CALL task(nondet_tree()) [L86] CALL, EXPR min(t) [L37] COND FALSE !(!n) [L40] EXPR n->data [L40] int a = n->data; [L41] EXPR n->left [L41] CALL, EXPR min(n->left) [L37] COND TRUE !n [L38] return 2147483647; [L41] RET, EXPR min(n->left) [L41] int b = min(n->left); [L42] EXPR n->right [L42] CALL, EXPR min(n->right) [L37] COND TRUE !n [L38] return 2147483647; [L42] RET, EXPR min(n->right) [L42] int c = min(n->right); [L43] COND TRUE b <= a && b <= c [L43] return b; [L86] RET, EXPR min(t) [L86] int a = min(t); [L87] int b; [L89] CALL, EXPR size(t) [L81] COND FALSE !(!t) [L82] EXPR t->left [L82] CALL, EXPR size(t->left) [L81] COND TRUE !t [L81] return 0; [L82] RET, EXPR size(t->left) [L82] EXPR t->right [L82] CALL, EXPR size(t->right) [L81] COND TRUE !t [L81] return 0; [L82] RET, EXPR size(t->right) [L82] return size(t->left) + size(t->right) + 1; [L89] RET, EXPR size(t) [L89] int n = size(t); [L90] CALL assume_cycle_if_not(n != 0) [L9] COND FALSE !(!cond) [L90] RET assume_cycle_if_not(n != 0) [L91] EXPR, FCALL calloc(n, sizeof(int)) [L91] int *x = calloc(n, sizeof(int)); [L92] CALL tree_inorder(t, x, n) [L70] COND FALSE !(!t) [L73] EXPR t->left [L73] CALL, EXPR tree_inorder(t->left, a, i) [L70] COND TRUE !t [L71] return i; [L73] RET, EXPR tree_inorder(t->left, a, i) [L73] i = tree_inorder(t->left, a, i) [L74] EXPR i++ [L74] EXPR t->data [L74] a[i++] = t->data [L75] EXPR t->right [L75] CALL, EXPR tree_inorder(t->right, a, i) [L70] COND TRUE !t [L71] return i; [L75] RET, EXPR tree_inorder(t->right, a, i) [L75] i = tree_inorder(t->right, a, i) [L76] return i; [L92] RET tree_inorder(t, x, n) [L93] EXPR x[0] [L93] CALL __VERIFIER_assert(a == x[0]) [L16] COND TRUE !cond [L16] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 13 procedures, 101 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 5573.7ms, OverallIterations: 5, TraceHistogramMax: 3, EmptinessCheckTime: 24.6ms, AutomataDifference: 3688.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 23.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 344 SDtfs, 659 SDslu, 1525 SDs, 0 SdLazy, 2163 SolverSat, 606 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1682.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 152 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1548.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=0, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 106.8ms AutomataMinimizationTime, 4 MinimizatonAttempts, 17 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, 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...