/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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.1.25-3af5e1f
[2020-09-04 13:23:22,516 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-09-04 13:23:22,520 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-09-04 13:23:22,561 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-09-04 13:23:22,561 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-09-04 13:23:22,569 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-09-04 13:23:22,572 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-09-04 13:23:22,576 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-09-04 13:23:22,579 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-09-04 13:23:22,582 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-09-04 13:23:22,583 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-09-04 13:23:22,585 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-09-04 13:23:22,585 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-09-04 13:23:22,588 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-09-04 13:23:22,591 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-09-04 13:23:22,592 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-09-04 13:23:22,594 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-09-04 13:23:22,595 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-09-04 13:23:22,596 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-09-04 13:23:22,605 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-09-04 13:23:22,607 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-09-04 13:23:22,608 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-09-04 13:23:22,609 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-09-04 13:23:22,610 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-09-04 13:23:22,622 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-09-04 13:23:22,628 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-09-04 13:23:22,628 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-09-04 13:23:22,629 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-09-04 13:23:22,630 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-09-04 13:23:22,635 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-09-04 13:23:22,635 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-09-04 13:23:22,636 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-09-04 13:23:22,637 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-09-04 13:23:22,639 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-09-04 13:23:22,640 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-09-04 13:23:22,640 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-09-04 13:23:22,641 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-09-04 13:23:22,641 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-09-04 13:23:22,642 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-09-04 13:23:22,643 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-09-04 13:23:22,644 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-09-04 13:23:22,645 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf
[2020-09-04 13:23:22,687 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-09-04 13:23:22,688 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-09-04 13:23:22,690 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-09-04 13:23:22,690 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-09-04 13:23:22,690 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-09-04 13:23:22,691 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-09-04 13:23:22,691 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-09-04 13:23:22,691 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-09-04 13:23:22,691 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-09-04 13:23:22,691 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-09-04 13:23:22,692 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-09-04 13:23:22,693 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-09-04 13:23:22,693 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-09-04 13:23:22,693 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-09-04 13:23:22,693 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-09-04 13:23:22,694 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-09-04 13:23:22,694 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-09-04 13:23:22,694 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-09-04 13:23:22,694 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-09-04 13:23:22,695 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-09-04 13:23:22,695 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-09-04 13:23:22,695 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-09-04 13:23:22,695 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-09-04 13:23:22,695 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2020-09-04 13:23:22,696 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-09-04 13:23:22,696 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-09-04 13:23:22,696 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-09-04 13:23:22,696 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-09-04 13:23:22,696 INFO  L138        SettingsManager]:  * Trace refinement exception blacklist=NONE
[2020-09-04 13:23:22,697 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2020-09-04 13:23:23,184 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2020-09-04 13:23:23,203 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-09-04 13:23:23,208 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-09-04 13:23:23,209 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-09-04 13:23:23,210 INFO  L275        PluginConnector]: CDTParser initialized
[2020-09-04 13:23:23,211 INFO  L429   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/tree_del_rec.c
[2020-09-04 13:23:23,286 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/42f80d440/7cc8938ffda74d10b8b55d0d4d90cbba/FLAG6217b3a47
[2020-09-04 13:23:23,890 INFO  L306              CDTParser]: Found 1 translation units.
[2020-09-04 13:23:23,891 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/verifythis/tree_del_rec.c
[2020-09-04 13:23:23,903 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/42f80d440/7cc8938ffda74d10b8b55d0d4d90cbba/FLAG6217b3a47
[2020-09-04 13:23:24,189 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/42f80d440/7cc8938ffda74d10b8b55d0d4d90cbba
[2020-09-04 13:23:24,201 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-09-04 13:23:24,203 INFO  L131        ToolchainWalker]: Walking toolchain with 4 elements.
[2020-09-04 13:23:24,204 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-09-04 13:23:24,204 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-09-04 13:23:24,208 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-09-04 13:23:24,210 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 01:23:24" (1/1) ...
[2020-09-04 13:23:24,214 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d644d5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:23:24, skipping insertion in model container
[2020-09-04 13:23:24,214 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 01:23:24" (1/1) ...
[2020-09-04 13:23:24,224 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-09-04 13:23:24,257 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-09-04 13:23:24,469 WARN  L1484              CHandler]: Possible shadowing of function min
[2020-09-04 13:23:24,471 WARN  L1484              CHandler]: Possible shadowing of function min
[2020-09-04 13:23:24,487 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-09-04 13:23:24,507 INFO  L203         MainTranslator]: Completed pre-run
[2020-09-04 13:23:24,630 WARN  L1484              CHandler]: Possible shadowing of function min
[2020-09-04 13:23:24,634 WARN  L1484              CHandler]: Possible shadowing of function min
[2020-09-04 13:23:24,645 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-09-04 13:23:24,675 INFO  L208         MainTranslator]: Completed translation
[2020-09-04 13:23:24,676 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:23:24 WrapperNode
[2020-09-04 13:23:24,676 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-09-04 13:23:24,677 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-09-04 13:23:24,677 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-09-04 13:23:24,677 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-09-04 13:23:24,691 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:23:24" (1/1) ...
[2020-09-04 13:23:24,691 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:23:24" (1/1) ...
[2020-09-04 13:23:24,708 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:23:24" (1/1) ...
[2020-09-04 13:23:24,709 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:23:24" (1/1) ...
[2020-09-04 13:23:24,745 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:23:24" (1/1) ...
[2020-09-04 13:23:24,752 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:23:24" (1/1) ...
[2020-09-04 13:23:24,756 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:23:24" (1/1) ...
[2020-09-04 13:23:24,760 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-09-04 13:23:24,761 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-09-04 13:23:24,761 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-09-04 13:23:24,761 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-09-04 13:23:24,763 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:23:24" (1/1) ...
No working directory specified, using /storage/repos/ultimate-2/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-09-04 13:23:24,838 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2020-09-04 13:23:24,838 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-09-04 13:23:24,838 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_cycle_if_not
[2020-09-04 13:23:24,839 INFO  L138     BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2020-09-04 13:23:24,839 INFO  L138     BoogieDeclarations]: Found implementation of procedure nondet_tree
[2020-09-04 13:23:24,839 INFO  L138     BoogieDeclarations]: Found implementation of procedure min
[2020-09-04 13:23:24,839 INFO  L138     BoogieDeclarations]: Found implementation of procedure tree_del
[2020-09-04 13:23:24,839 INFO  L138     BoogieDeclarations]: Found implementation of procedure tree_inorder
[2020-09-04 13:23:24,840 INFO  L138     BoogieDeclarations]: Found implementation of procedure size
[2020-09-04 13:23:24,840 INFO  L138     BoogieDeclarations]: Found implementation of procedure task
[2020-09-04 13:23:24,840 INFO  L138     BoogieDeclarations]: Found implementation of procedure main
[2020-09-04 13:23:24,840 INFO  L138     BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit
[2020-09-04 13:23:24,841 INFO  L130     BoogieDeclarations]: Found specification of procedure calloc
[2020-09-04 13:23:24,841 INFO  L130     BoogieDeclarations]: Found specification of procedure malloc
[2020-09-04 13:23:24,841 INFO  L130     BoogieDeclarations]: Found specification of procedure free
[2020-09-04 13:23:24,841 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2020-09-04 13:23:24,841 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool
[2020-09-04 13:23:24,842 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_cycle_if_not
[2020-09-04 13:23:24,846 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_error
[2020-09-04 13:23:24,846 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2020-09-04 13:23:24,846 INFO  L130     BoogieDeclarations]: Found specification of procedure nondet_tree
[2020-09-04 13:23:24,846 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2020-09-04 13:23:24,847 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-09-04 13:23:24,847 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2020-09-04 13:23:24,847 INFO  L130     BoogieDeclarations]: Found specification of procedure min
[2020-09-04 13:23:24,847 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2020-09-04 13:23:24,847 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2020-09-04 13:23:24,847 INFO  L130     BoogieDeclarations]: Found specification of procedure tree_del
[2020-09-04 13:23:24,847 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-09-04 13:23:24,848 INFO  L130     BoogieDeclarations]: Found specification of procedure tree_inorder
[2020-09-04 13:23:24,848 INFO  L130     BoogieDeclarations]: Found specification of procedure size
[2020-09-04 13:23:24,848 INFO  L130     BoogieDeclarations]: Found specification of procedure task
[2020-09-04 13:23:24,848 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-09-04 13:23:24,848 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.meminit
[2020-09-04 13:23:24,848 INFO  L130     BoogieDeclarations]: Found specification of procedure main
[2020-09-04 13:23:24,849 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2020-09-04 13:23:24,849 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-09-04 13:23:25,438 INFO  L290             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-09-04 13:23:25,438 INFO  L295             CfgBuilder]: Removed 2 assume(true) statements.
[2020-09-04 13:23:25,444 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 01:23:25 BoogieIcfgContainer
[2020-09-04 13:23:25,444 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-09-04 13:23:25,446 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-09-04 13:23:25,446 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-09-04 13:23:25,450 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-09-04 13:23:25,450 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 01:23:24" (1/3) ...
[2020-09-04 13:23:25,451 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ea86a45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 01:23:25, skipping insertion in model container
[2020-09-04 13:23:25,451 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:23:24" (2/3) ...
[2020-09-04 13:23:25,452 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ea86a45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 01:23:25, skipping insertion in model container
[2020-09-04 13:23:25,452 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 01:23:25" (3/3) ...
[2020-09-04 13:23:25,454 INFO  L109   eAbstractionObserver]: Analyzing ICFG tree_del_rec.c
[2020-09-04 13:23:25,467 INFO  L157   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2020-09-04 13:23:25,478 INFO  L169   ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2020-09-04 13:23:25,499 INFO  L251      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2020-09-04 13:23:25,528 INFO  L375      AbstractCegarLoop]: Interprodecural is true
[2020-09-04 13:23:25,528 INFO  L376      AbstractCegarLoop]: Hoare is true
[2020-09-04 13:23:25,528 INFO  L377      AbstractCegarLoop]: Compute interpolants for FPandBP
[2020-09-04 13:23:25,528 INFO  L378      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-09-04 13:23:25,529 INFO  L379      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-09-04 13:23:25,529 INFO  L380      AbstractCegarLoop]: Difference is false
[2020-09-04 13:23:25,529 INFO  L381      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-09-04 13:23:25,529 INFO  L385      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-09-04 13:23:25,555 INFO  L276                IsEmpty]: Start isEmpty. Operand 97 states.
[2020-09-04 13:23:25,567 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2020-09-04 13:23:25,567 INFO  L414         BasicCegarLoop]: Found error trace
[2020-09-04 13:23:25,569 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]
[2020-09-04 13:23:25,569 INFO  L427      AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-09-04 13:23:25,577 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-09-04 13:23:25,578 INFO  L82        PathProgramCache]: Analyzing trace with hash -1057238675, now seen corresponding path program 1 times
[2020-09-04 13:23:25,591 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-09-04 13:23:25,592 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185425440]
[2020-09-04 13:23:25,592 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-09-04 13:23:25,781 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:23:25,929 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-09-04 13:23:25,932 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:23:25,959 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2020-09-04 13:23:25,962 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:23:25,967 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11
[2020-09-04 13:23:25,969 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:23:25,975 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2020-09-04 13:23:25,986 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:23:26,023 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23
[2020-09-04 13:23:26,030 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:23:26,093 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29
[2020-09-04 13:23:26,096 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:23:26,127 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34
[2020-09-04 13:23:26,130 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:23:26,146 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-09-04 13:23:26,148 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185425440]
[2020-09-04 13:23:26,149 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-09-04 13:23:26,149 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2020-09-04 13:23:26,150 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176580579]
[2020-09-04 13:23:26,157 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 11 states
[2020-09-04 13:23:26,158 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-09-04 13:23:26,176 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2020-09-04 13:23:26,177 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2020-09-04 13:23:26,180 INFO  L87              Difference]: Start difference. First operand 97 states. Second operand 11 states.
[2020-09-04 13:23:27,003 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-09-04 13:23:27,004 INFO  L93              Difference]: Finished difference Result 171 states and 229 transitions.
[2020-09-04 13:23:27,004 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2020-09-04 13:23:27,006 INFO  L78                 Accepts]: Start accepts. Automaton has 11 states. Word has length 44
[2020-09-04 13:23:27,007 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-09-04 13:23:27,027 INFO  L225             Difference]: With dead ends: 171
[2020-09-04 13:23:27,028 INFO  L226             Difference]: Without dead ends: 96
[2020-09-04 13:23:27,035 INFO  L675         BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272
[2020-09-04 13:23:27,064 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 96 states.
[2020-09-04 13:23:27,113 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90.
[2020-09-04 13:23:27,116 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 90 states.
[2020-09-04 13:23:27,120 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 114 transitions.
[2020-09-04 13:23:27,123 INFO  L78                 Accepts]: Start accepts. Automaton has 90 states and 114 transitions. Word has length 44
[2020-09-04 13:23:27,124 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-09-04 13:23:27,124 INFO  L479      AbstractCegarLoop]: Abstraction has 90 states and 114 transitions.
[2020-09-04 13:23:27,124 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 11 states.
[2020-09-04 13:23:27,125 INFO  L276                IsEmpty]: Start isEmpty. Operand 90 states and 114 transitions.
[2020-09-04 13:23:27,128 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 57
[2020-09-04 13:23:27,128 INFO  L414         BasicCegarLoop]: Found error trace
[2020-09-04 13:23:27,129 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]
[2020-09-04 13:23:27,129 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-09-04 13:23:27,129 INFO  L427      AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-09-04 13:23:27,130 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-09-04 13:23:27,130 INFO  L82        PathProgramCache]: Analyzing trace with hash 1861604494, now seen corresponding path program 1 times
[2020-09-04 13:23:27,130 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-09-04 13:23:27,131 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362573345]
[2020-09-04 13:23:27,131 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-09-04 13:23:27,169 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:23:27,257 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-09-04 13:23:27,259 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:23:27,283 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2020-09-04 13:23:27,289 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:23:27,320 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11
[2020-09-04 13:23:27,323 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:23:27,327 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17
[2020-09-04 13:23:27,335 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:23:27,391 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-09-04 13:23:27,394 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:23:27,398 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8
[2020-09-04 13:23:27,400 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:23:27,405 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35
[2020-09-04 13:23:27,406 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:23:27,422 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41
[2020-09-04 13:23:27,424 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:23:27,450 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46
[2020-09-04 13:23:27,452 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:23:27,465 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2020-09-04 13:23:27,466 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362573345]
[2020-09-04 13:23:27,466 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357523932]
[2020-09-04 13:23:27,466 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
No working directory specified, using /storage/repos/ultimate-2/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-09-04 13:23:27,590 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:23:27,594 INFO  L263         TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 25 conjunts are in the unsatisfiable core
[2020-09-04 13:23:27,605 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2020-09-04 13:23:27,710 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2020-09-04 13:23:27,711 INFO  L220   FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2020-09-04 13:23:27,711 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 13
[2020-09-04 13:23:27,713 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004259808]
[2020-09-04 13:23:27,714 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 13 states
[2020-09-04 13:23:27,714 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-09-04 13:23:27,714 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2020-09-04 13:23:27,715 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156
[2020-09-04 13:23:27,715 INFO  L87              Difference]: Start difference. First operand 90 states and 114 transitions. Second operand 13 states.
[2020-09-04 13:23:28,557 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-09-04 13:23:28,558 INFO  L93              Difference]: Finished difference Result 162 states and 208 transitions.
[2020-09-04 13:23:28,558 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2020-09-04 13:23:28,559 INFO  L78                 Accepts]: Start accepts. Automaton has 13 states. Word has length 56
[2020-09-04 13:23:28,559 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-09-04 13:23:28,564 INFO  L225             Difference]: With dead ends: 162
[2020-09-04 13:23:28,564 INFO  L226             Difference]: Without dead ends: 95
[2020-09-04 13:23:28,566 INFO  L675         BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420
[2020-09-04 13:23:28,567 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 95 states.
[2020-09-04 13:23:28,589 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92.
[2020-09-04 13:23:28,590 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 92 states.
[2020-09-04 13:23:28,594 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 117 transitions.
[2020-09-04 13:23:28,595 INFO  L78                 Accepts]: Start accepts. Automaton has 92 states and 117 transitions. Word has length 56
[2020-09-04 13:23:28,595 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-09-04 13:23:28,595 INFO  L479      AbstractCegarLoop]: Abstraction has 92 states and 117 transitions.
[2020-09-04 13:23:28,596 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 13 states.
[2020-09-04 13:23:28,596 INFO  L276                IsEmpty]: Start isEmpty. Operand 92 states and 117 transitions.
[2020-09-04 13:23:28,601 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2020-09-04 13:23:28,601 INFO  L414         BasicCegarLoop]: Found error trace
[2020-09-04 13:23:28,601 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]
[2020-09-04 13:23:28,816 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1
[2020-09-04 13:23:28,817 INFO  L427      AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-09-04 13:23:28,817 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-09-04 13:23:28,818 INFO  L82        PathProgramCache]: Analyzing trace with hash 1883823467, now seen corresponding path program 1 times
[2020-09-04 13:23:28,818 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-09-04 13:23:28,819 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625369723]
[2020-09-04 13:23:28,819 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-09-04 13:23:28,849 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:23:28,908 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-09-04 13:23:28,909 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:23:28,927 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2020-09-04 13:23:28,942 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:23:28,991 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2020-09-04 13:23:28,995 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:23:29,000 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2020-09-04 13:23:29,003 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:23:29,008 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2020-09-04 13:23:29,010 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:23:29,038 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27
[2020-09-04 13:23:29,043 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:23:29,048 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-09-04 13:23:29,049 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:23:29,051 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8
[2020-09-04 13:23:29,051 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:23:29,053 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45
[2020-09-04 13:23:29,054 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:23:29,074 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2020-09-04 13:23:29,076 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:23:29,104 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56
[2020-09-04 13:23:29,106 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:23:29,114 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked.
[2020-09-04 13:23:29,115 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625369723]
[2020-09-04 13:23:29,116 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-09-04 13:23:29,116 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2020-09-04 13:23:29,116 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92482245]
[2020-09-04 13:23:29,117 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 13 states
[2020-09-04 13:23:29,117 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-09-04 13:23:29,117 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2020-09-04 13:23:29,118 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156
[2020-09-04 13:23:29,118 INFO  L87              Difference]: Start difference. First operand 92 states and 117 transitions. Second operand 13 states.
[2020-09-04 13:23:29,962 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-09-04 13:23:29,962 INFO  L93              Difference]: Finished difference Result 161 states and 207 transitions.
[2020-09-04 13:23:29,963 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2020-09-04 13:23:29,963 INFO  L78                 Accepts]: Start accepts. Automaton has 13 states. Word has length 66
[2020-09-04 13:23:29,963 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-09-04 13:23:29,967 INFO  L225             Difference]: With dead ends: 161
[2020-09-04 13:23:29,967 INFO  L226             Difference]: Without dead ends: 97
[2020-09-04 13:23:29,968 INFO  L675         BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420
[2020-09-04 13:23:29,969 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 97 states.
[2020-09-04 13:23:29,983 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94.
[2020-09-04 13:23:29,983 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 94 states.
[2020-09-04 13:23:29,985 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 120 transitions.
[2020-09-04 13:23:29,985 INFO  L78                 Accepts]: Start accepts. Automaton has 94 states and 120 transitions. Word has length 66
[2020-09-04 13:23:29,985 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-09-04 13:23:29,986 INFO  L479      AbstractCegarLoop]: Abstraction has 94 states and 120 transitions.
[2020-09-04 13:23:29,986 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 13 states.
[2020-09-04 13:23:29,986 INFO  L276                IsEmpty]: Start isEmpty. Operand 94 states and 120 transitions.
[2020-09-04 13:23:29,988 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 80
[2020-09-04 13:23:29,988 INFO  L414         BasicCegarLoop]: Found error trace
[2020-09-04 13:23:29,988 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]
[2020-09-04 13:23:29,988 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-09-04 13:23:29,989 INFO  L427      AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-09-04 13:23:29,989 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-09-04 13:23:29,989 INFO  L82        PathProgramCache]: Analyzing trace with hash 1030140767, now seen corresponding path program 1 times
[2020-09-04 13:23:29,990 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-09-04 13:23:29,990 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962734434]
[2020-09-04 13:23:29,990 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-09-04 13:23:30,029 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:23:30,096 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2020-09-04 13:23:30,097 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:23:30,114 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5
[2020-09-04 13:23:30,124 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:23:30,167 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1
[2020-09-04 13:23:30,171 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:23:30,175 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6
[2020-09-04 13:23:30,177 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:23:30,182 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21
[2020-09-04 13:23:30,187 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:23:30,193 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-09-04 13:23:30,194 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:23:30,195 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8
[2020-09-04 13:23:30,196 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:23:30,198 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40
[2020-09-04 13:23:30,203 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:23:30,210 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2020-09-04 13:23:30,211 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:23:30,213 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8
[2020-09-04 13:23:30,213 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:23:30,215 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58
[2020-09-04 13:23:30,217 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:23:30,229 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64
[2020-09-04 13:23:30,231 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:23:30,251 INFO  L375   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69
[2020-09-04 13:23:30,254 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-09-04 13:23:30,288 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked.
[2020-09-04 13:23:30,288 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962734434]
[2020-09-04 13:23:30,289 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-09-04 13:23:30,289 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2020-09-04 13:23:30,289 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087468747]
[2020-09-04 13:23:30,290 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 13 states
[2020-09-04 13:23:30,290 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-09-04 13:23:30,290 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2020-09-04 13:23:30,291 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156
[2020-09-04 13:23:30,291 INFO  L87              Difference]: Start difference. First operand 94 states and 120 transitions. Second operand 13 states.
[2020-09-04 13:23:31,197 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-09-04 13:23:31,198 INFO  L93              Difference]: Finished difference Result 149 states and 191 transitions.
[2020-09-04 13:23:31,198 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2020-09-04 13:23:31,198 INFO  L78                 Accepts]: Start accepts. Automaton has 13 states. Word has length 79
[2020-09-04 13:23:31,200 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-09-04 13:23:31,203 INFO  L225             Difference]: With dead ends: 149
[2020-09-04 13:23:31,203 INFO  L226             Difference]: Without dead ends: 97
[2020-09-04 13:23:31,204 INFO  L675         BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462
[2020-09-04 13:23:31,205 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 97 states.
[2020-09-04 13:23:31,217 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96.
[2020-09-04 13:23:31,217 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 96 states.
[2020-09-04 13:23:31,219 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 123 transitions.
[2020-09-04 13:23:31,219 INFO  L78                 Accepts]: Start accepts. Automaton has 96 states and 123 transitions. Word has length 79
[2020-09-04 13:23:31,220 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-09-04 13:23:31,220 INFO  L479      AbstractCegarLoop]: Abstraction has 96 states and 123 transitions.
[2020-09-04 13:23:31,220 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 13 states.
[2020-09-04 13:23:31,220 INFO  L276                IsEmpty]: Start isEmpty. Operand 96 states and 123 transitions.
[2020-09-04 13:23:31,222 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 92
[2020-09-04 13:23:31,223 INFO  L414         BasicCegarLoop]: Found error trace
[2020-09-04 13:23:31,224 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]
[2020-09-04 13:23:31,224 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-09-04 13:23:31,224 INFO  L427      AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-09-04 13:23:31,225 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-09-04 13:23:31,225 INFO  L82        PathProgramCache]: Analyzing trace with hash -299285422, now seen corresponding path program 1 times
[2020-09-04 13:23:31,225 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-09-04 13:23:31,225 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552974450]
[2020-09-04 13:23:31,226 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-09-04 13:23:31,279 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-09-04 13:23:31,279 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-09-04 13:23:31,326 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-09-04 13:23:31,327 INFO  L221             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2020-09-04 13:23:31,371 INFO  L174   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-09-04 13:23:31,371 INFO  L520         BasicCegarLoop]: Counterexample might be feasible
[2020-09-04 13:23:31,372 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2020-09-04 13:23:31,439 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 01:23:31 BoogieIcfgContainer
[2020-09-04 13:23:31,439 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-09-04 13:23:31,443 INFO  L168              Benchmark]: Toolchain (without parser) took 7238.63 ms. Allocated memory was 138.9 MB in the beginning and 295.2 MB in the end (delta: 156.2 MB). Free memory was 101.2 MB in the beginning and 230.4 MB in the end (delta: -129.2 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB.
[2020-09-04 13:23:31,444 INFO  L168              Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 138.9 MB. Free memory was 120.5 MB in the beginning and 120.0 MB in the end (delta: 419.4 kB). Peak memory consumption was 419.4 kB. Max. memory is 7.1 GB.
[2020-09-04 13:23:31,445 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 472.94 ms. Allocated memory was 138.9 MB in the beginning and 201.3 MB in the end (delta: 62.4 MB). Free memory was 100.8 MB in the beginning and 177.4 MB in the end (delta: -76.6 MB). Peak memory consumption was 22.5 MB. Max. memory is 7.1 GB.
[2020-09-04 13:23:31,446 INFO  L168              Benchmark]: Boogie Preprocessor took 83.07 ms. Allocated memory is still 201.3 MB. Free memory was 177.4 MB in the beginning and 175.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB.
[2020-09-04 13:23:31,447 INFO  L168              Benchmark]: RCFGBuilder took 683.48 ms. Allocated memory is still 201.3 MB. Free memory was 175.5 MB in the beginning and 141.0 MB in the end (delta: 34.5 MB). Peak memory consumption was 34.5 MB. Max. memory is 7.1 GB.
[2020-09-04 13:23:31,448 INFO  L168              Benchmark]: TraceAbstraction took 5993.47 ms. Allocated memory was 201.3 MB in the beginning and 295.2 MB in the end (delta: 93.8 MB). Free memory was 140.0 MB in the beginning and 230.4 MB in the end (delta: -90.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB.
[2020-09-04 13:23:31,452 INFO  L336   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.24 ms. Allocated memory is still 138.9 MB. Free memory was 120.5 MB in the beginning and 120.0 MB in the end (delta: 419.4 kB). Peak memory consumption was 419.4 kB. Max. memory is 7.1 GB.
 * CACSL2BoogieTranslator took 472.94 ms. Allocated memory was 138.9 MB in the beginning and 201.3 MB in the end (delta: 62.4 MB). Free memory was 100.8 MB in the beginning and 177.4 MB in the end (delta: -76.6 MB). Peak memory consumption was 22.5 MB. Max. memory is 7.1 GB.
 * Boogie Preprocessor took 83.07 ms. Allocated memory is still 201.3 MB. Free memory was 177.4 MB in the beginning and 175.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB.
 * RCFGBuilder took 683.48 ms. Allocated memory is still 201.3 MB. Free memory was 175.5 MB in the beginning and 141.0 MB in the end (delta: 34.5 MB). Peak memory consumption was 34.5 MB. Max. memory is 7.1 GB.
 * TraceAbstraction took 5993.47 ms. Allocated memory was 201.3 MB in the beginning and 295.2 MB in the end (delta: 93.8 MB). Free memory was 140.0 MB in the beginning and 230.4 MB in the end (delta: -90.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 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: 
[L100]  CALL, EXPR   nondet_tree()
[L23]   COND FALSE   !(__VERIFIER_nondet_bool())
[L26]                struct node *n = (struct node *)malloc(sizeof(struct node));
[L27]                n->data = __VERIFIER_nondet_int()
[L28]   CALL, EXPR   nondet_tree()
[L23]   COND TRUE    __VERIFIER_nondet_bool()
[L24]                return 0;
        VAL          [\result={0:0}]
[L28]   RET, EXPR    nondet_tree()
        VAL          [malloc(sizeof(struct node))={-1:0}, n={-1:0}, nondet_tree()={0:0}]
[L28]                n->left = nondet_tree()
[L29]   CALL, EXPR   nondet_tree()
[L23]   COND TRUE    __VERIFIER_nondet_bool()
[L24]                return 0;
        VAL          [\result={0:0}]
[L29]   RET, EXPR    nondet_tree()
        VAL          [malloc(sizeof(struct node))={-1:0}, n={-1:0}, nondet_tree()={0:0}]
[L29]                n->right = nondet_tree()
[L30]                return n;
        VAL          [\result={-1:0}, malloc(sizeof(struct node))={-1:0}, n={-1:0}]
[L100]  RET, EXPR    nondet_tree()
        VAL          [nondet_tree()={-1:0}]
[L100]  CALL         task(nondet_tree())
        VAL          [t={-1:0}]
[L76]   CALL, EXPR   min(t)
        VAL          [n={-1:0}]
[L35]   COND FALSE   !(!n)
[L38]   EXPR         n->data
[L38]                int a = n->data;
[L39]   EXPR         n->left
        VAL          [a=2147483647, n={-1:0}, n={-1:0}, n->left={0:0}]
[L39]   CALL, EXPR   min(n->left)
        VAL          [n={0:0}]
[L35]   COND TRUE    !n
[L36]                return 2147483647;
        VAL          [\result=2147483647, n={0:0}, n={0:0}]
[L39]   RET, EXPR    min(n->left)
        VAL          [a=2147483647, min(n->left)=2147483647, n={-1:0}, n={-1:0}, n->left={0:0}]
[L39]                int b = min(n->left);
[L40]   EXPR         n->right
        VAL          [a=2147483647, b=2147483647, n={-1:0}, n={-1:0}, n->right={0:0}]
[L40]   CALL, EXPR   min(n->right)
        VAL          [n={0:0}]
[L35]   COND TRUE    !n
[L36]                return 2147483647;
        VAL          [\result=2147483647, n={0:0}, n={0:0}]
[L40]   RET, EXPR    min(n->right)
        VAL          [a=2147483647, b=2147483647, min(n->right)=2147483647, n={-1:0}, n={-1:0}, n->right={0:0}]
[L40]                int c = min(n->right);
[L41]   COND TRUE    b <= a && b <= c
[L41]                return b;
        VAL          [\result=2147483647, a=2147483647, b=2147483647, c=2147483647, n={-1:0}, n={-1:0}]
[L76]   RET, EXPR    min(t)
        VAL          [min(t)=2147483647, t={-1:0}, t={-1:0}]
[L76]                int a = min(t);
[L77]                int b;
        VAL          [a=2147483647, b={2:0}, t={-1:0}, t={-1:0}]
[L79]   CALL, EXPR   size(t)
        VAL          [t={-1:0}]
[L71]   COND FALSE   !(!t)
[L72]   EXPR         t->left
        VAL          [t={-1:0}, t={-1:0}, t->left={0:0}]
[L72]   CALL, EXPR   size(t->left)
        VAL          [t={0:0}]
[L71]   COND TRUE    !t
[L71]                return 0;
        VAL          [\result=0, t={0:0}, t={0:0}]
[L72]   RET, EXPR    size(t->left)
        VAL          [size(t->left)=0, t={-1:0}, t={-1:0}, t->left={0:0}]
[L72]   EXPR         t->right
        VAL          [size(t->left)=0, t={-1:0}, t={-1:0}, t->left={0:0}, t->right={0:0}]
[L72]   CALL, EXPR   size(t->right)
        VAL          [t={0:0}]
[L71]   COND TRUE    !t
[L71]                return 0;
        VAL          [\result=0, t={0:0}, t={0:0}]
[L72]   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}]
[L72]                return size(t->left) + size(t->right) + 1;
[L79]   RET, EXPR    size(t)
        VAL          [a=2147483647, b={2:0}, size(t)=1, t={-1:0}, t={-1:0}]
[L79]                int n = size(t);
[L80]   CALL         assume_cycle_if_not(n != 0)
        VAL          [\old(cond)=1]
[L9]    COND FALSE   !(!cond)
        VAL          [\old(cond)=1, cond=1]
[L80]   RET          assume_cycle_if_not(n != 0)
        VAL          [a=2147483647, b={2:0}, n=1, t={-1:0}, t={-1:0}]
[L81]   EXPR, FCALL  calloc(n, sizeof(int))
        VAL          [a=2147483647, b={2:0}, calloc(n, sizeof(int))={-2:0}, n=1, t={-1:0}, t={-1:0}]
[L81]                int *x = calloc(n, sizeof(int));
        VAL          [a=2147483647, b={2:0}, calloc(n, sizeof(int))={-2:0}, n=1, t={-1:0}, t={-1:0}, x={-2:0}]
[L82]   CALL         tree_inorder(t, x, n)
        VAL          [\old(i)=1, a={-2:0}, t={-1:0}]
[L60]   COND FALSE   !(!t)
[L63]   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}]
[L63]   CALL, EXPR   tree_inorder(t->left,  a, i)
        VAL          [\old(i)=1, a={-2:0}, t={0:0}]
[L60]   COND TRUE    !t
[L61]                return i;
        VAL          [\old(i)=1, \result=1, a={-2:0}, a={-2:0}, i=1, t={0:0}, t={0:0}]
[L63]   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]
[L63]                i = tree_inorder(t->left,  a, i)
[L64]   EXPR         i++
[L64]   EXPR         t->data
[L64]                a[i++] = t->data
[L65]   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}]
[L65]   CALL, EXPR   tree_inorder(t->right, a, i)
        VAL          [\old(i)=2, a={-2:0}, t={0:0}]
[L60]   COND TRUE    !t
[L61]                return i;
        VAL          [\old(i)=2, \result=2, a={-2:0}, a={-2:0}, i=2, t={0:0}, t={0:0}]
[L65]   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]
[L65]                i = tree_inorder(t->right, a, i)
[L66]                return i;
        VAL          [\old(i)=1, \result=2, a={-2:0}, a={-2:0}, i=2, t={-1:0}, t={-1:0}]
[L82]   RET          tree_inorder(t, x, n)
        VAL          [a=2147483647, b={2:0}, calloc(n, sizeof(int))={-2:0}, n=1, t={-1:0}, t={-1:0}, tree_inorder(t, x, n)=2, x={-2:0}]
[L83]   EXPR         x[0]
        VAL          [a=2147483647, b={2:0}, calloc(n, sizeof(int))={-2:0}, n=1, t={-1:0}, t={-1:0}, x={-2:0}, x[0]=0]
[L83]   CALL         __VERIFIER_assert(a == x[0])
        VAL          [\old(cond)=0]
[L14]   COND TRUE    !cond
        VAL          [\old(cond)=0, cond=0]
[L14]                __VERIFIER_error()
        VAL          [\old(cond)=0, cond=0]

  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 12 procedures, 97 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 5.8s, OverallIterations: 5, TraceHistogramMax: 3, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 352 SDtfs, 538 SDslu, 1447 SDs, 0 SdLazy, 1825 SolverSat, 530 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 199 GetRequests, 124 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred 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.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 392 NumberOfCodeBlocks, 392 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 296 ConstructedInterpolants, 0 QuantifiedInterpolants, 54946 SizeOfPredicates, 6 NumberOfNonLiveVariables, 256 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 74/78 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...