/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/verifythis/tree_del_rec.c


--------------------------------------------------------------------------------


This is Ultimate 0.2.0-b8ad66e
[2020-10-23 18:21:13,497 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-10-23 18:21:13,503 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-10-23 18:21:13,562 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-10-23 18:21:13,563 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-10-23 18:21:13,566 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-10-23 18:21:13,571 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-10-23 18:21:13,579 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-10-23 18:21:13,583 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-10-23 18:21:13,589 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-10-23 18:21:13,590 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-10-23 18:21:13,592 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-10-23 18:21:13,592 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-10-23 18:21:13,595 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-10-23 18:21:13,598 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-10-23 18:21:13,600 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-10-23 18:21:13,601 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-10-23 18:21:13,602 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-10-23 18:21:13,626 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-10-23 18:21:13,634 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-10-23 18:21:13,639 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-10-23 18:21:13,640 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-10-23 18:21:13,642 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-10-23 18:21:13,645 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-10-23 18:21:13,651 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-10-23 18:21:13,652 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-10-23 18:21:13,655 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-10-23 18:21:13,656 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-10-23 18:21:13,657 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-10-23 18:21:13,659 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-10-23 18:21:13,659 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-10-23 18:21:13,660 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-10-23 18:21:13,663 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-10-23 18:21:13,664 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-10-23 18:21:13,665 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-10-23 18:21:13,665 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-10-23 18:21:13,666 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-10-23 18:21:13,666 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-10-23 18:21:13,666 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-10-23 18:21:13,667 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-10-23 18:21:13,668 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-10-23 18:21:13,669 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf
[2020-10-23 18:21:13,727 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-10-23 18:21:13,727 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-10-23 18:21:13,732 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-10-23 18:21:13,733 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-10-23 18:21:13,733 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-10-23 18:21:13,733 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-10-23 18:21:13,734 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-10-23 18:21:13,734 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-10-23 18:21:13,734 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-10-23 18:21:13,735 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-10-23 18:21:13,736 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-10-23 18:21:13,736 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-10-23 18:21:13,736 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-10-23 18:21:13,737 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-10-23 18:21:13,737 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-10-23 18:21:13,737 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-10-23 18:21:13,737 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-10-23 18:21:13,737 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-10-23 18:21:13,738 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-10-23 18:21:13,738 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-10-23 18:21:13,738 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-10-23 18:21:13,739 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-10-23 18:21:13,739 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-10-23 18:21:13,739 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2020-10-23 18:21:13,739 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-10-23 18:21:13,740 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-10-23 18:21:13,740 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-10-23 18:21:13,740 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-10-23 18:21:13,740 INFO  L138        SettingsManager]:  * Trace refinement exception blacklist=NONE
[2020-10-23 18:21:13,740 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
[2020-10-23 18:21:14,123 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2020-10-23 18:21:14,152 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-10-23 18:21:14,155 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-10-23 18:21:14,157 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-10-23 18:21:14,158 INFO  L275        PluginConnector]: CDTParser initialized
[2020-10-23 18:21:14,159 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/tree_del_rec.c
[2020-10-23 18:21:14,246 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87e23b337/cddc45d371a94cf7818480ab95c87337/FLAGfc8719ba0
[2020-10-23 18:21:14,912 INFO  L306              CDTParser]: Found 1 translation units.
[2020-10-23 18:21:14,912 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_rec.c
[2020-10-23 18:21:14,922 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87e23b337/cddc45d371a94cf7818480ab95c87337/FLAGfc8719ba0
[2020-10-23 18:21:15,271 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87e23b337/cddc45d371a94cf7818480ab95c87337
[2020-10-23 18:21:15,275 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-10-23 18:21:15,283 INFO  L131        ToolchainWalker]: Walking toolchain with 4 elements.
[2020-10-23 18:21:15,288 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-10-23 18:21:15,288 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-10-23 18:21:15,293 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-10-23 18:21:15,293 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:21:15" (1/1) ...
[2020-10-23 18:21:15,298 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c5a6fb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:21:15, skipping insertion in model container
[2020-10-23 18:21:15,298 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 06:21:15" (1/1) ...
[2020-10-23 18:21:15,307 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-10-23 18:21:15,335 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-10-23 18:21:15,505 WARN  L1500              CHandler]: Possible shadowing of function min
[2020-10-23 18:21:15,507 WARN  L1500              CHandler]: Possible shadowing of function min
[2020-10-23 18:21:15,526 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-23 18:21:15,543 INFO  L203         MainTranslator]: Completed pre-run
[2020-10-23 18:21:15,565 WARN  L1500              CHandler]: Possible shadowing of function min
[2020-10-23 18:21:15,566 WARN  L1500              CHandler]: Possible shadowing of function min
[2020-10-23 18:21:15,585 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-10-23 18:21:15,624 INFO  L208         MainTranslator]: Completed translation
[2020-10-23 18:21:15,625 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:21:15 WrapperNode
[2020-10-23 18:21:15,626 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-10-23 18:21:15,628 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-10-23 18:21:15,628 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-10-23 18:21:15,628 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-10-23 18:21:15,642 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:21:15" (1/1) ...
[2020-10-23 18:21:15,643 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:21:15" (1/1) ...
[2020-10-23 18:21:15,672 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:21:15" (1/1) ...
[2020-10-23 18:21:15,673 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:21:15" (1/1) ...
[2020-10-23 18:21:15,710 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:21:15" (1/1) ...
[2020-10-23 18:21:15,717 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:21:15" (1/1) ...
[2020-10-23 18:21:15,720 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:21:15" (1/1) ...
[2020-10-23 18:21:15,725 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-10-23 18:21:15,726 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-10-23 18:21:15,726 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-10-23 18:21:15,726 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-10-23 18:21:15,727 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:21:15" (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-10-23 18:21:15,809 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2020-10-23 18:21:15,809 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-10-23 18:21:15,810 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_cycle_if_not
[2020-10-23 18:21:15,810 INFO  L138     BoogieDeclarations]: Found implementation of procedure reach_error
[2020-10-23 18:21:15,811 INFO  L138     BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2020-10-23 18:21:15,811 INFO  L138     BoogieDeclarations]: Found implementation of procedure nondet_tree
[2020-10-23 18:21:15,811 INFO  L138     BoogieDeclarations]: Found implementation of procedure min
[2020-10-23 18:21:15,812 INFO  L138     BoogieDeclarations]: Found implementation of procedure tree_del
[2020-10-23 18:21:15,812 INFO  L138     BoogieDeclarations]: Found implementation of procedure tree_inorder
[2020-10-23 18:21:15,813 INFO  L138     BoogieDeclarations]: Found implementation of procedure size
[2020-10-23 18:21:15,813 INFO  L138     BoogieDeclarations]: Found implementation of procedure task
[2020-10-23 18:21:15,814 INFO  L138     BoogieDeclarations]: Found implementation of procedure main
[2020-10-23 18:21:15,814 INFO  L138     BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit
[2020-10-23 18:21:15,814 INFO  L130     BoogieDeclarations]: Found specification of procedure calloc
[2020-10-23 18:21:15,815 INFO  L130     BoogieDeclarations]: Found specification of procedure malloc
[2020-10-23 18:21:15,815 INFO  L130     BoogieDeclarations]: Found specification of procedure free
[2020-10-23 18:21:15,815 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2020-10-23 18:21:15,815 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool
[2020-10-23 18:21:15,815 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_cycle_if_not
[2020-10-23 18:21:15,815 INFO  L130     BoogieDeclarations]: Found specification of procedure abort
[2020-10-23 18:21:15,816 INFO  L130     BoogieDeclarations]: Found specification of procedure __assert_fail
[2020-10-23 18:21:15,816 INFO  L130     BoogieDeclarations]: Found specification of procedure reach_error
[2020-10-23 18:21:15,816 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-10-23 18:21:15,816 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2020-10-23 18:21:15,816 INFO  L130     BoogieDeclarations]: Found specification of procedure nondet_tree
[2020-10-23 18:21:15,816 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2020-10-23 18:21:15,816 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-10-23 18:21:15,816 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2020-10-23 18:21:15,816 INFO  L130     BoogieDeclarations]: Found specification of procedure min
[2020-10-23 18:21:15,816 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2020-10-23 18:21:15,817 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2020-10-23 18:21:15,817 INFO  L130     BoogieDeclarations]: Found specification of procedure tree_del
[2020-10-23 18:21:15,817 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-10-23 18:21:15,817 INFO  L130     BoogieDeclarations]: Found specification of procedure tree_inorder
[2020-10-23 18:21:15,817 INFO  L130     BoogieDeclarations]: Found specification of procedure size
[2020-10-23 18:21:15,817 INFO  L130     BoogieDeclarations]: Found specification of procedure task
[2020-10-23 18:21:15,817 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.meminit
[2020-10-23 18:21:15,817 INFO  L130     BoogieDeclarations]: Found specification of procedure main
[2020-10-23 18:21:15,817 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2020-10-23 18:21:15,817 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2020-10-23 18:21:15,818 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-10-23 18:21:16,632 INFO  L293             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-10-23 18:21:16,632 INFO  L298             CfgBuilder]: Removed 2 assume(true) statements.
[2020-10-23 18:21:16,635 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:21:16 BoogieIcfgContainer
[2020-10-23 18:21:16,635 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-10-23 18:21:16,638 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-10-23 18:21:16,638 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-10-23 18:21:16,642 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-10-23 18:21:16,642 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 06:21:15" (1/3) ...
[2020-10-23 18:21:16,643 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b8fec85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:21:16, skipping insertion in model container
[2020-10-23 18:21:16,643 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 06:21:15" (2/3) ...
[2020-10-23 18:21:16,644 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b8fec85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 06:21:16, skipping insertion in model container
[2020-10-23 18:21:16,644 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 06:21:16" (3/3) ...
[2020-10-23 18:21:16,646 INFO  L111   eAbstractionObserver]: Analyzing ICFG tree_del_rec.c
[2020-10-23 18:21:16,664 INFO  L164   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2020-10-23 18:21:16,671 INFO  L176   ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2020-10-23 18:21:16,686 INFO  L253      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2020-10-23 18:21:16,727 INFO  L377      AbstractCegarLoop]: Interprodecural is true
[2020-10-23 18:21:16,727 INFO  L378      AbstractCegarLoop]: Hoare is true
[2020-10-23 18:21:16,728 INFO  L379      AbstractCegarLoop]: Compute interpolants for FPandBP
[2020-10-23 18:21:16,728 INFO  L380      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-10-23 18:21:16,728 INFO  L381      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-10-23 18:21:16,728 INFO  L382      AbstractCegarLoop]: Difference is false
[2020-10-23 18:21:16,728 INFO  L383      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-10-23 18:21:16,728 INFO  L387      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-10-23 18:21:16,752 INFO  L276                IsEmpty]: Start isEmpty. Operand 101 states.
[2020-10-23 18:21:16,760 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 46
[2020-10-23 18:21:16,761 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-23 18:21:16,762 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-23 18:21:16,762 INFO  L429      AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-23 18:21:16,768 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-23 18:21:16,768 INFO  L82        PathProgramCache]: Analyzing trace with hash 608013235, now seen corresponding path program 1 times
[2020-10-23 18:21:16,777 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-23 18:21:16,778 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089144554]
[2020-10-23 18:21:16,778 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-23 18:21:16,992 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-23 18:21:17,129 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-10-23 18:21:17,133 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-23 18:21:17,163 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2020-10-23 18:21:17,167 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-23 18:21:17,172 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11
[2020-10-23 18:21:17,174 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-23 18:21:17,177 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2020-10-23 18:21:17,182 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-23 18:21:17,207 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2020-10-23 18:21:17,211 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-23 18:21:17,263 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29
[2020-10-23 18:21:17,266 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-23 18:21:17,292 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34
[2020-10-23 18:21:17,296 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-23 18:21:17,316 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-10-23 18:21:17,317 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089144554]
[2020-10-23 18:21:17,318 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-23 18:21:17,319 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2020-10-23 18:21:17,319 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426349513]
[2020-10-23 18:21:17,325 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 11 states
[2020-10-23 18:21:17,325 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-23 18:21:17,340 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2020-10-23 18:21:17,341 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2020-10-23 18:21:17,343 INFO  L87              Difference]: Start difference. First operand 101 states. Second operand 11 states.
[2020-10-23 18:21:18,310 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-23 18:21:18,311 INFO  L93              Difference]: Finished difference Result 176 states and 235 transitions.
[2020-10-23 18:21:18,311 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2020-10-23 18:21:18,313 INFO  L78                 Accepts]: Start accepts. Automaton has 11 states. Word has length 45
[2020-10-23 18:21:18,314 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-23 18:21:18,328 INFO  L225             Difference]: With dead ends: 176
[2020-10-23 18:21:18,328 INFO  L226             Difference]: Without dead ends: 97
[2020-10-23 18:21:18,333 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272
[2020-10-23 18:21:18,354 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 97 states.
[2020-10-23 18:21:18,396 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 91.
[2020-10-23 18:21:18,398 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 91 states.
[2020-10-23 18:21:18,401 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 115 transitions.
[2020-10-23 18:21:18,403 INFO  L78                 Accepts]: Start accepts. Automaton has 91 states and 115 transitions. Word has length 45
[2020-10-23 18:21:18,403 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-23 18:21:18,404 INFO  L481      AbstractCegarLoop]: Abstraction has 91 states and 115 transitions.
[2020-10-23 18:21:18,404 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 11 states.
[2020-10-23 18:21:18,404 INFO  L276                IsEmpty]: Start isEmpty. Operand 91 states and 115 transitions.
[2020-10-23 18:21:18,407 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 58
[2020-10-23 18:21:18,408 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-23 18:21:18,408 INFO  L422         BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-23 18:21:18,408 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-10-23 18:21:18,409 INFO  L429      AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-23 18:21:18,409 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-23 18:21:18,410 INFO  L82        PathProgramCache]: Analyzing trace with hash 2111601266, now seen corresponding path program 1 times
[2020-10-23 18:21:18,410 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-23 18:21:18,410 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566230063]
[2020-10-23 18:21:18,411 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-23 18:21:18,444 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-23 18:21:18,553 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-10-23 18:21:18,556 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-23 18:21:18,583 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2020-10-23 18:21:18,589 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-23 18:21:18,620 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11
[2020-10-23 18:21:18,624 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-23 18:21:18,627 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2020-10-23 18:21:18,634 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-23 18:21:18,691 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-10-23 18:21:18,694 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-23 18:21:18,698 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8
[2020-10-23 18:21:18,700 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-23 18:21:18,704 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35
[2020-10-23 18:21:18,706 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-23 18:21:18,725 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41
[2020-10-23 18:21:18,726 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-23 18:21:18,750 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46
[2020-10-23 18:21:18,753 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-23 18:21:18,762 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2020-10-23 18:21:18,763 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566230063]
[2020-10-23 18:21:18,763 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112690863]
[2020-10-23 18:21:18,763 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2020-10-23 18:21:18,882 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-23 18:21:18,900 INFO  L263         TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 25 conjunts are in the unsatisfiable core
[2020-10-23 18:21:18,917 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2020-10-23 18:21:19,023 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2020-10-23 18:21:19,024 INFO  L219   FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2020-10-23 18:21:19,024 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 13
[2020-10-23 18:21:19,025 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561775212]
[2020-10-23 18:21:19,027 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 13 states
[2020-10-23 18:21:19,027 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-23 18:21:19,028 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2020-10-23 18:21:19,028 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156
[2020-10-23 18:21:19,028 INFO  L87              Difference]: Start difference. First operand 91 states and 115 transitions. Second operand 13 states.
[2020-10-23 18:21:20,235 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-23 18:21:20,236 INFO  L93              Difference]: Finished difference Result 164 states and 210 transitions.
[2020-10-23 18:21:20,237 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2020-10-23 18:21:20,237 INFO  L78                 Accepts]: Start accepts. Automaton has 13 states. Word has length 57
[2020-10-23 18:21:20,237 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-23 18:21:20,240 INFO  L225             Difference]: With dead ends: 164
[2020-10-23 18:21:20,241 INFO  L226             Difference]: Without dead ends: 96
[2020-10-23 18:21:20,243 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420
[2020-10-23 18:21:20,244 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 96 states.
[2020-10-23 18:21:20,264 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 93.
[2020-10-23 18:21:20,264 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 93 states.
[2020-10-23 18:21:20,267 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 118 transitions.
[2020-10-23 18:21:20,267 INFO  L78                 Accepts]: Start accepts. Automaton has 93 states and 118 transitions. Word has length 57
[2020-10-23 18:21:20,267 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-23 18:21:20,267 INFO  L481      AbstractCegarLoop]: Abstraction has 93 states and 118 transitions.
[2020-10-23 18:21:20,268 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 13 states.
[2020-10-23 18:21:20,268 INFO  L276                IsEmpty]: Start isEmpty. Operand 93 states and 118 transitions.
[2020-10-23 18:21:20,271 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 68
[2020-10-23 18:21:20,271 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-23 18:21:20,271 INFO  L422         BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-23 18:21:20,485 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1
[2020-10-23 18:21:20,486 INFO  L429      AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-23 18:21:20,487 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-23 18:21:20,487 INFO  L82        PathProgramCache]: Analyzing trace with hash -1898064043, now seen corresponding path program 1 times
[2020-10-23 18:21:20,488 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-23 18:21:20,488 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860576266]
[2020-10-23 18:21:20,489 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-23 18:21:20,534 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-23 18:21:20,652 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-10-23 18:21:20,655 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-23 18:21:20,677 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2020-10-23 18:21:20,687 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-23 18:21:20,740 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2020-10-23 18:21:20,745 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-23 18:21:20,748 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2020-10-23 18:21:20,751 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-23 18:21:20,769 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2020-10-23 18:21:20,775 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-23 18:21:20,809 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2020-10-23 18:21:20,813 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-23 18:21:20,825 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-10-23 18:21:20,831 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-23 18:21:20,833 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8
[2020-10-23 18:21:20,838 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-23 18:21:20,846 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45
[2020-10-23 18:21:20,848 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-23 18:21:20,875 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2020-10-23 18:21:20,877 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-23 18:21:20,906 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2020-10-23 18:21:20,908 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-23 18:21:20,927 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked.
[2020-10-23 18:21:20,928 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860576266]
[2020-10-23 18:21:20,929 INFO  L219   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-10-23 18:21:20,929 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2020-10-23 18:21:20,929 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499735408]
[2020-10-23 18:21:20,930 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 13 states
[2020-10-23 18:21:20,930 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-23 18:21:20,930 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2020-10-23 18:21:20,931 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156
[2020-10-23 18:21:20,931 INFO  L87              Difference]: Start difference. First operand 93 states and 118 transitions. Second operand 13 states.
[2020-10-23 18:21:22,080 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-23 18:21:22,080 INFO  L93              Difference]: Finished difference Result 163 states and 209 transitions.
[2020-10-23 18:21:22,081 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2020-10-23 18:21:22,081 INFO  L78                 Accepts]: Start accepts. Automaton has 13 states. Word has length 67
[2020-10-23 18:21:22,082 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-23 18:21:22,088 INFO  L225             Difference]: With dead ends: 163
[2020-10-23 18:21:22,089 INFO  L226             Difference]: Without dead ends: 98
[2020-10-23 18:21:22,093 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420
[2020-10-23 18:21:22,094 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 98 states.
[2020-10-23 18:21:22,127 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 95.
[2020-10-23 18:21:22,128 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 95 states.
[2020-10-23 18:21:22,133 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 121 transitions.
[2020-10-23 18:21:22,134 INFO  L78                 Accepts]: Start accepts. Automaton has 95 states and 121 transitions. Word has length 67
[2020-10-23 18:21:22,134 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-23 18:21:22,135 INFO  L481      AbstractCegarLoop]: Abstraction has 95 states and 121 transitions.
[2020-10-23 18:21:22,135 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 13 states.
[2020-10-23 18:21:22,135 INFO  L276                IsEmpty]: Start isEmpty. Operand 95 states and 121 transitions.
[2020-10-23 18:21:22,146 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 81
[2020-10-23 18:21:22,147 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-23 18:21:22,147 INFO  L422         BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-23 18:21:22,147 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-10-23 18:21:22,148 INFO  L429      AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-23 18:21:22,148 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-23 18:21:22,148 INFO  L82        PathProgramCache]: Analyzing trace with hash -330780866, now seen corresponding path program 1 times
[2020-10-23 18:21:22,149 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-23 18:21:22,152 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308369629]
[2020-10-23 18:21:22,152 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-23 18:21:22,191 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-23 18:21:22,279 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-10-23 18:21:22,282 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-23 18:21:22,312 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2020-10-23 18:21:22,321 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-23 18:21:22,361 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2020-10-23 18:21:22,364 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-23 18:21:22,367 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2020-10-23 18:21:22,369 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-23 18:21:22,372 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2020-10-23 18:21:22,378 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-23 18:21:22,449 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-10-23 18:21:22,451 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-23 18:21:22,453 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8
[2020-10-23 18:21:22,455 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-23 18:21:22,458 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40
[2020-10-23 18:21:22,462 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-23 18:21:22,467 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-10-23 18:21:22,468 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-23 18:21:22,469 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8
[2020-10-23 18:21:22,470 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-23 18:21:22,472 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58
[2020-10-23 18:21:22,473 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-23 18:21:22,491 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64
[2020-10-23 18:21:22,493 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-23 18:21:22,517 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69
[2020-10-23 18:21:22,519 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-23 18:21:22,570 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked.
[2020-10-23 18:21:22,571 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308369629]
[2020-10-23 18:21:22,571 INFO  L353   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596707062]
[2020-10-23 18:21:22,571 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2020-10-23 18:21:22,697 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-10-23 18:21:22,700 INFO  L263         TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 31 conjunts are in the unsatisfiable core
[2020-10-23 18:21:22,707 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2020-10-23 18:21:22,807 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked.
[2020-10-23 18:21:22,807 INFO  L219   FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2020-10-23 18:21:22,808 INFO  L232   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 17
[2020-10-23 18:21:22,808 INFO  L155   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222146449]
[2020-10-23 18:21:22,809 INFO  L461      AbstractCegarLoop]: Interpolant automaton has 17 states
[2020-10-23 18:21:22,809 INFO  L142   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-10-23 18:21:22,810 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2020-10-23 18:21:22,810 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272
[2020-10-23 18:21:22,810 INFO  L87              Difference]: Start difference. First operand 95 states and 121 transitions. Second operand 17 states.
[2020-10-23 18:21:24,269 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-10-23 18:21:24,269 INFO  L93              Difference]: Finished difference Result 151 states and 193 transitions.
[2020-10-23 18:21:24,270 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2020-10-23 18:21:24,270 INFO  L78                 Accepts]: Start accepts. Automaton has 17 states. Word has length 80
[2020-10-23 18:21:24,271 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-10-23 18:21:24,276 INFO  L225             Difference]: With dead ends: 151
[2020-10-23 18:21:24,277 INFO  L226             Difference]: Without dead ends: 98
[2020-10-23 18:21:24,278 INFO  L677         BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=144, Invalid=726, Unknown=0, NotChecked=0, Total=870
[2020-10-23 18:21:24,279 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 98 states.
[2020-10-23 18:21:24,294 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97.
[2020-10-23 18:21:24,294 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 97 states.
[2020-10-23 18:21:24,296 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 124 transitions.
[2020-10-23 18:21:24,296 INFO  L78                 Accepts]: Start accepts. Automaton has 97 states and 124 transitions. Word has length 80
[2020-10-23 18:21:24,296 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-10-23 18:21:24,297 INFO  L481      AbstractCegarLoop]: Abstraction has 97 states and 124 transitions.
[2020-10-23 18:21:24,297 INFO  L482      AbstractCegarLoop]: Interpolant automaton has 17 states.
[2020-10-23 18:21:24,297 INFO  L276                IsEmpty]: Start isEmpty. Operand 97 states and 124 transitions.
[2020-10-23 18:21:24,299 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 93
[2020-10-23 18:21:24,299 INFO  L414         BasicCegarLoop]: Found error trace
[2020-10-23 18:21:24,299 INFO  L422         BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-10-23 18:21:24,513 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2020-10-23 18:21:24,514 INFO  L429      AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-10-23 18:21:24,515 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-10-23 18:21:24,515 INFO  L82        PathProgramCache]: Analyzing trace with hash -1397967645, now seen corresponding path program 1 times
[2020-10-23 18:21:24,515 INFO  L162   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-10-23 18:21:24,516 INFO  L353   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037637982]
[2020-10-23 18:21:24,516 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-10-23 18:21:24,572 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-23 18:21:24,573 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-23 18:21:24,617 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-10-23 18:21:24,618 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-10-23 18:21:24,664 INFO  L173   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-10-23 18:21:24,664 INFO  L523         BasicCegarLoop]: Counterexample might be feasible
[2020-10-23 18:21:24,664 WARN  L518      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-10-23 18:21:24,743 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 06:21:24 BoogieIcfgContainer
[2020-10-23 18:21:24,743 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-10-23 18:21:24,746 INFO  L168              Benchmark]: Toolchain (without parser) took 9467.20 ms. Allocated memory was 152.0 MB in the beginning and 219.2 MB in the end (delta: 67.1 MB). Free memory was 127.3 MB in the beginning and 115.6 MB in the end (delta: 11.7 MB). Peak memory consumption was 79.5 MB. Max. memory is 8.0 GB.
[2020-10-23 18:21:24,747 INFO  L168              Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 152.0 MB. Free memory is still 125.0 MB. There was no memory consumed. Max. memory is 8.0 GB.
[2020-10-23 18:21:24,747 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 338.35 ms. Allocated memory is still 152.0 MB. Free memory was 126.7 MB in the beginning and 114.9 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB.
[2020-10-23 18:21:24,748 INFO  L168              Benchmark]: Boogie Preprocessor took 97.42 ms. Allocated memory is still 152.0 MB. Free memory was 114.9 MB in the beginning and 112.6 MB in the end (delta: 2.3 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB.
[2020-10-23 18:21:24,749 INFO  L168              Benchmark]: RCFGBuilder took 909.50 ms. Allocated memory is still 152.0 MB. Free memory was 112.6 MB in the beginning and 110.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 11.3 MB. Max. memory is 8.0 GB.
[2020-10-23 18:21:24,750 INFO  L168              Benchmark]: TraceAbstraction took 8105.36 ms. Allocated memory was 152.0 MB in the beginning and 219.2 MB in the end (delta: 67.1 MB). Free memory was 110.4 MB in the beginning and 115.6 MB in the end (delta: -5.2 MB). Peak memory consumption was 61.9 MB. Max. memory is 8.0 GB.
[2020-10-23 18:21:24,754 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.18 ms. Allocated memory is still 152.0 MB. Free memory is still 125.0 MB. There was no memory consumed. Max. memory is 8.0 GB.
 * CACSL2BoogieTranslator took 338.35 ms. Allocated memory is still 152.0 MB. Free memory was 126.7 MB in the beginning and 114.9 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB.
 * Boogie Preprocessor took 97.42 ms. Allocated memory is still 152.0 MB. Free memory was 114.9 MB in the beginning and 112.6 MB in the end (delta: 2.3 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB.
 * RCFGBuilder took 909.50 ms. Allocated memory is still 152.0 MB. Free memory was 112.6 MB in the beginning and 110.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 11.3 MB. Max. memory is 8.0 GB.
 * TraceAbstraction took 8105.36 ms. Allocated memory was 152.0 MB in the beginning and 219.2 MB in the end (delta: 67.1 MB). Free memory was 110.4 MB in the beginning and 115.6 MB in the end (delta: -5.2 MB). Peak memory consumption was 61.9 MB. Max. memory is 8.0 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - CounterExampleResult [Line: 14]: a call of __VERIFIER_error() is reachable
    a call of __VERIFIER_error() is reachable
We found a FailurePath: 
[L102]  CALL, EXPR   nondet_tree()
[L25]   COND FALSE   !(__VERIFIER_nondet_bool())
[L28]                struct node *n = (struct node *)malloc(sizeof(struct node));
[L29]                n->data = __VERIFIER_nondet_int()
[L30]   CALL, EXPR   nondet_tree()
[L25]   COND TRUE    __VERIFIER_nondet_bool()
[L26]                return 0;
        VAL          [\result={0:0}]
[L30]   RET, EXPR    nondet_tree()
        VAL          [malloc(sizeof(struct node))={-1:0}, n={-1:0}, nondet_tree()={0:0}]
[L30]                n->left = nondet_tree()
[L31]   CALL, EXPR   nondet_tree()
[L25]   COND TRUE    __VERIFIER_nondet_bool()
[L26]                return 0;
        VAL          [\result={0:0}]
[L31]   RET, EXPR    nondet_tree()
        VAL          [malloc(sizeof(struct node))={-1:0}, n={-1:0}, nondet_tree()={0:0}]
[L31]                n->right = nondet_tree()
[L32]                return n;
        VAL          [\result={-1:0}, malloc(sizeof(struct node))={-1:0}, n={-1:0}]
[L102]  RET, EXPR    nondet_tree()
        VAL          [nondet_tree()={-1:0}]
[L102]  CALL         task(nondet_tree())
        VAL          [t={-1:0}]
[L78]   CALL, EXPR   min(t)
        VAL          [n={-1:0}]
[L37]   COND FALSE   !(!n)
[L40]   EXPR         n->data
[L40]                int a = n->data;
[L41]   EXPR         n->left
        VAL          [a=2147483647, n={-1:0}, n={-1:0}, n->left={0:0}]
[L41]   CALL, EXPR   min(n->left)
        VAL          [n={0:0}]
[L37]   COND TRUE    !n
[L38]                return 2147483647;
        VAL          [\result=2147483647, n={0:0}, n={0:0}]
[L41]   RET, EXPR    min(n->left)
        VAL          [a=2147483647, min(n->left)=2147483647, n={-1:0}, n={-1:0}, n->left={0:0}]
[L41]                int b = min(n->left);
[L42]   EXPR         n->right
        VAL          [a=2147483647, b=2147483647, n={-1:0}, n={-1:0}, n->right={0:0}]
[L42]   CALL, EXPR   min(n->right)
        VAL          [n={0:0}]
[L37]   COND TRUE    !n
[L38]                return 2147483647;
        VAL          [\result=2147483647, n={0:0}, n={0:0}]
[L42]   RET, EXPR    min(n->right)
        VAL          [a=2147483647, b=2147483647, min(n->right)=2147483647, n={-1:0}, n={-1:0}, n->right={0:0}]
[L42]                int c = min(n->right);
[L43]   COND TRUE    b <= a && b <= c
[L43]                return b;
        VAL          [\result=2147483647, a=2147483647, b=2147483647, c=2147483647, n={-1:0}, n={-1:0}]
[L78]   RET, EXPR    min(t)
        VAL          [min(t)=2147483647, t={-1:0}, t={-1:0}]
[L78]                int a = min(t);
[L79]                int b;
        VAL          [a=2147483647, b={3:0}, t={-1:0}, t={-1:0}]
[L81]   CALL, EXPR   size(t)
        VAL          [t={-1:0}]
[L73]   COND FALSE   !(!t)
[L74]   EXPR         t->left
        VAL          [t={-1:0}, t={-1:0}, t->left={0:0}]
[L74]   CALL, EXPR   size(t->left)
        VAL          [t={0:0}]
[L73]   COND TRUE    !t
[L73]                return 0;
        VAL          [\result=0, t={0:0}, t={0:0}]
[L74]   RET, EXPR    size(t->left)
        VAL          [size(t->left)=0, t={-1:0}, t={-1:0}, t->left={0:0}]
[L74]   EXPR         t->right
        VAL          [size(t->left)=0, t={-1:0}, t={-1:0}, t->left={0:0}, t->right={0:0}]
[L74]   CALL, EXPR   size(t->right)
        VAL          [t={0:0}]
[L73]   COND TRUE    !t
[L73]                return 0;
        VAL          [\result=0, t={0:0}, t={0:0}]
[L74]   RET, EXPR    size(t->right)
        VAL          [size(t->left)=0, size(t->right)=0, t={-1:0}, t={-1:0}, t->left={0:0}, t->right={0:0}]
[L74]                return size(t->left) + size(t->right) + 1;
[L81]   RET, EXPR    size(t)
        VAL          [a=2147483647, b={3:0}, size(t)=1, t={-1:0}, t={-1:0}]
[L81]                int n = size(t);
[L82]   CALL         assume_cycle_if_not(n != 0)
        VAL          [\old(cond)=1]
[L9]    COND FALSE   !(!cond)
        VAL          [\old(cond)=1, cond=1]
[L82]   RET          assume_cycle_if_not(n != 0)
        VAL          [a=2147483647, b={3:0}, n=1, t={-1:0}, t={-1:0}]
[L83]   EXPR, FCALL  calloc(n, sizeof(int))
        VAL          [a=2147483647, b={3:0}, calloc(n, sizeof(int))={-2:0}, n=1, t={-1:0}, t={-1:0}]
[L83]                int *x = calloc(n, sizeof(int));
        VAL          [a=2147483647, b={3:0}, calloc(n, sizeof(int))={-2:0}, n=1, t={-1:0}, t={-1:0}, x={-2:0}]
[L84]   CALL         tree_inorder(t, x, n)
        VAL          [\old(i)=1, a={-2:0}, t={-1:0}]
[L62]   COND FALSE   !(!t)
[L65]   EXPR         t->left
        VAL          [\old(i)=1, a={-2:0}, a={-2:0}, i=1, t={-1:0}, t={-1:0}, t->left={0:0}]
[L65]   CALL, EXPR   tree_inorder(t->left,  a, i)
        VAL          [\old(i)=1, a={-2:0}, t={0:0}]
[L62]   COND TRUE    !t
[L63]                return i;
        VAL          [\old(i)=1, \result=1, a={-2:0}, a={-2:0}, i=1, t={0:0}, t={0:0}]
[L65]   RET, EXPR    tree_inorder(t->left,  a, i)
        VAL          [\old(i)=1, a={-2:0}, a={-2:0}, i=1, t={-1:0}, t={-1:0}, t->left={0:0}, tree_inorder(t->left,  a, i)=1]
[L65]                i = tree_inorder(t->left,  a, i)
[L66]   EXPR         i++
[L66]   EXPR         t->data
[L66]                a[i++] = t->data
[L67]   EXPR         t->right
        VAL          [\old(i)=1, a={-2:0}, a={-2:0}, i=2, t={-1:0}, t={-1:0}, t->right={0:0}]
[L67]   CALL, EXPR   tree_inorder(t->right, a, i)
        VAL          [\old(i)=2, a={-2:0}, t={0:0}]
[L62]   COND TRUE    !t
[L63]                return i;
        VAL          [\old(i)=2, \result=2, a={-2:0}, a={-2:0}, i=2, t={0:0}, t={0:0}]
[L67]   RET, EXPR    tree_inorder(t->right, a, i)
        VAL          [\old(i)=1, a={-2:0}, a={-2:0}, i=2, t={-1:0}, t={-1:0}, t->right={0:0}, tree_inorder(t->right, a, i)=2]
[L67]                i = tree_inorder(t->right, a, i)
[L68]                return i;
        VAL          [\old(i)=1, \result=2, a={-2:0}, a={-2:0}, i=2, t={-1:0}, t={-1:0}]
[L84]   RET          tree_inorder(t, x, n)
        VAL          [a=2147483647, b={3:0}, calloc(n, sizeof(int))={-2:0}, n=1, t={-1:0}, t={-1:0}, tree_inorder(t, x, n)=2, x={-2:0}]
[L85]   EXPR         x[0]
        VAL          [a=2147483647, b={3:0}, calloc(n, sizeof(int))={-2:0}, n=1, t={-1:0}, t={-1:0}, x={-2:0}, x[0]=0]
[L85]   CALL         __VERIFIER_assert(a == x[0])
        VAL          [\old(cond)=0]
[L16]   COND TRUE    !cond
        VAL          [\old(cond)=0, cond=0]
[L16]   CALL         reach_error()
[L14]                __assert_fail("0", "tree_del_rec.c", 14, "reach_error")

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 13 procedures, 101 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 7.9s, OverallIterations: 5, TraceHistogramMax: 3, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 356 SDtfs, 567 SDslu, 1599 SDs, 0 SdLazy, 2017 SolverSat, 562 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 286 GetRequests, 201 SyntacticMatches, 4 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=101occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 13 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 478 NumberOfCodeBlocks, 478 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 380 ConstructedInterpolants, 0 QuantifiedInterpolants, 79926 SizeOfPredicates, 14 NumberOfNonLiveVariables, 737 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 103/111 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
Received shutdown request...