/usr/bin/java -ea -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_incorrect.c


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


This is Ultimate 0.1.25-46f3038-m
[2020-07-08 12:18:24,207 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-07-08 12:18:24,210 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-07-08 12:18:24,229 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-07-08 12:18:24,230 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-07-08 12:18:24,232 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-07-08 12:18:24,234 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-07-08 12:18:24,247 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-07-08 12:18:24,249 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-07-08 12:18:24,250 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-07-08 12:18:24,252 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-07-08 12:18:24,256 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-07-08 12:18:24,257 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-07-08 12:18:24,259 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-07-08 12:18:24,260 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-07-08 12:18:24,261 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-07-08 12:18:24,262 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-07-08 12:18:24,263 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-07-08 12:18:24,264 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-07-08 12:18:24,266 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-07-08 12:18:24,267 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-07-08 12:18:24,268 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-07-08 12:18:24,269 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-07-08 12:18:24,270 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-07-08 12:18:24,272 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-07-08 12:18:24,272 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-07-08 12:18:24,272 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-07-08 12:18:24,273 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-07-08 12:18:24,274 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-07-08 12:18:24,275 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-07-08 12:18:24,275 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-07-08 12:18:24,276 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-07-08 12:18:24,276 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-07-08 12:18:24,277 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-07-08 12:18:24,278 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-07-08 12:18:24,278 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-07-08 12:18:24,279 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-07-08 12:18:24,279 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-07-08 12:18:24,279 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-07-08 12:18:24,280 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-07-08 12:18:24,281 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-07-08 12:18:24,282 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-07-08 12:18:24,296 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-07-08 12:18:24,297 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-07-08 12:18:24,298 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-07-08 12:18:24,298 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2020-07-08 12:18:24,298 INFO  L138        SettingsManager]:  * Use SBE=true
[2020-07-08 12:18:24,299 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-07-08 12:18:24,299 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-07-08 12:18:24,299 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-07-08 12:18:24,299 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-07-08 12:18:24,299 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-07-08 12:18:24,300 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-07-08 12:18:24,300 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-07-08 12:18:24,300 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-07-08 12:18:24,300 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-07-08 12:18:24,300 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-07-08 12:18:24,300 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-07-08 12:18:24,301 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-07-08 12:18:24,301 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-07-08 12:18:24,301 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2020-07-08 12:18:24,301 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-07-08 12:18:24,301 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-07-08 12:18:24,302 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-07-08 12:18:24,302 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-07-08 12:18:24,302 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2020-07-08 12:18:24,302 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-07-08 12:18:24,302 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2020-07-08 12:18:24,303 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-07-08 12:18:24,303 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-07-08 12:18:24,303 INFO  L138        SettingsManager]:  * Trace refinement exception blacklist=NONE
[2020-07-08 12:18:24,303 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2020-07-08 12:18:24,582 INFO  L81    nceAwareModelManager]: Repository-Root is: /tmp
[2020-07-08 12:18:24,596 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-07-08 12:18:24,599 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-07-08 12:18:24,601 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-07-08 12:18:24,601 INFO  L275        PluginConnector]: CDTParser initialized
[2020-07-08 12:18:24,602 INFO  L429   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/tree_del_rec_incorrect.c
[2020-07-08 12:18:24,667 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/375eccf62/2945f349e82e45b8a94542654cb4e45f/FLAGcf02a46b6
[2020-07-08 12:18:25,158 INFO  L306              CDTParser]: Found 1 translation units.
[2020-07-08 12:18:25,159 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_rec_incorrect.c
[2020-07-08 12:18:25,166 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/375eccf62/2945f349e82e45b8a94542654cb4e45f/FLAGcf02a46b6
[2020-07-08 12:18:25,546 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/375eccf62/2945f349e82e45b8a94542654cb4e45f
[2020-07-08 12:18:25,555 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-07-08 12:18:25,557 INFO  L131        ToolchainWalker]: Walking toolchain with 4 elements.
[2020-07-08 12:18:25,558 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-07-08 12:18:25,558 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-07-08 12:18:25,562 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-07-08 12:18:25,564 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:18:25" (1/1) ...
[2020-07-08 12:18:25,567 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11474de2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:18:25, skipping insertion in model container
[2020-07-08 12:18:25,568 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:18:25" (1/1) ...
[2020-07-08 12:18:25,576 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-07-08 12:18:25,605 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-07-08 12:18:25,800 WARN  L1484              CHandler]: Possible shadowing of function min
[2020-07-08 12:18:25,803 WARN  L1484              CHandler]: Possible shadowing of function min
[2020-07-08 12:18:25,828 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-07-08 12:18:25,851 INFO  L203         MainTranslator]: Completed pre-run
[2020-07-08 12:18:25,958 WARN  L1484              CHandler]: Possible shadowing of function min
[2020-07-08 12:18:25,960 WARN  L1484              CHandler]: Possible shadowing of function min
[2020-07-08 12:18:25,973 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-07-08 12:18:25,996 INFO  L208         MainTranslator]: Completed translation
[2020-07-08 12:18:25,996 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:18:25 WrapperNode
[2020-07-08 12:18:25,996 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-07-08 12:18:25,997 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-07-08 12:18:25,997 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-07-08 12:18:25,997 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-07-08 12:18:26,008 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:18:25" (1/1) ...
[2020-07-08 12:18:26,009 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:18:25" (1/1) ...
[2020-07-08 12:18:26,020 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:18:25" (1/1) ...
[2020-07-08 12:18:26,021 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:18:25" (1/1) ...
[2020-07-08 12:18:26,045 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:18:25" (1/1) ...
[2020-07-08 12:18:26,051 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:18:25" (1/1) ...
[2020-07-08 12:18:26,054 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:18:25" (1/1) ...
[2020-07-08 12:18:26,059 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-07-08 12:18:26,059 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-07-08 12:18:26,060 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-07-08 12:18:26,060 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-07-08 12:18:26,061 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:18:25" (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-07-08 12:18:26,125 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2020-07-08 12:18:26,125 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-07-08 12:18:26,125 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2020-07-08 12:18:26,125 INFO  L138     BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2020-07-08 12:18:26,126 INFO  L138     BoogieDeclarations]: Found implementation of procedure nondet_tree
[2020-07-08 12:18:26,126 INFO  L138     BoogieDeclarations]: Found implementation of procedure min
[2020-07-08 12:18:26,126 INFO  L138     BoogieDeclarations]: Found implementation of procedure tree_del
[2020-07-08 12:18:26,126 INFO  L138     BoogieDeclarations]: Found implementation of procedure tree_inorder
[2020-07-08 12:18:26,126 INFO  L138     BoogieDeclarations]: Found implementation of procedure size
[2020-07-08 12:18:26,126 INFO  L138     BoogieDeclarations]: Found implementation of procedure task
[2020-07-08 12:18:26,127 INFO  L138     BoogieDeclarations]: Found implementation of procedure main
[2020-07-08 12:18:26,127 INFO  L138     BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit
[2020-07-08 12:18:26,127 INFO  L130     BoogieDeclarations]: Found specification of procedure calloc
[2020-07-08 12:18:26,127 INFO  L130     BoogieDeclarations]: Found specification of procedure malloc
[2020-07-08 12:18:26,127 INFO  L130     BoogieDeclarations]: Found specification of procedure free
[2020-07-08 12:18:26,128 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2020-07-08 12:18:26,128 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool
[2020-07-08 12:18:26,128 INFO  L130     BoogieDeclarations]: Found specification of procedure abort
[2020-07-08 12:18:26,128 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2020-07-08 12:18:26,128 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_error
[2020-07-08 12:18:26,128 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2020-07-08 12:18:26,129 INFO  L130     BoogieDeclarations]: Found specification of procedure nondet_tree
[2020-07-08 12:18:26,129 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2020-07-08 12:18:26,129 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-07-08 12:18:26,129 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2020-07-08 12:18:26,129 INFO  L130     BoogieDeclarations]: Found specification of procedure min
[2020-07-08 12:18:26,129 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2020-07-08 12:18:26,129 INFO  L130     BoogieDeclarations]: Found specification of procedure tree_del
[2020-07-08 12:18:26,130 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2020-07-08 12:18:26,130 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-07-08 12:18:26,130 INFO  L130     BoogieDeclarations]: Found specification of procedure tree_inorder
[2020-07-08 12:18:26,130 INFO  L130     BoogieDeclarations]: Found specification of procedure size
[2020-07-08 12:18:26,130 INFO  L130     BoogieDeclarations]: Found specification of procedure task
[2020-07-08 12:18:26,130 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-07-08 12:18:26,130 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.meminit
[2020-07-08 12:18:26,130 INFO  L130     BoogieDeclarations]: Found specification of procedure main
[2020-07-08 12:18:26,130 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2020-07-08 12:18:26,131 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-07-08 12:18:26,877 INFO  L290             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-07-08 12:18:26,878 INFO  L295             CfgBuilder]: Removed 1 assume(true) statements.
[2020-07-08 12:18:26,889 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:18:26 BoogieIcfgContainer
[2020-07-08 12:18:26,889 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-07-08 12:18:26,891 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-07-08 12:18:26,891 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-07-08 12:18:26,895 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-07-08 12:18:26,895 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 12:18:25" (1/3) ...
[2020-07-08 12:18:26,896 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4259b196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:18:26, skipping insertion in model container
[2020-07-08 12:18:26,897 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:18:25" (2/3) ...
[2020-07-08 12:18:26,897 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4259b196 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:18:26, skipping insertion in model container
[2020-07-08 12:18:26,898 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:18:26" (3/3) ...
[2020-07-08 12:18:26,900 INFO  L109   eAbstractionObserver]: Analyzing ICFG tree_del_rec_incorrect.c
[2020-07-08 12:18:26,911 INFO  L157   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2020-07-08 12:18:26,926 INFO  L169   ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2020-07-08 12:18:26,941 INFO  L251      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2020-07-08 12:18:26,962 INFO  L375      AbstractCegarLoop]: Interprodecural is true
[2020-07-08 12:18:26,962 INFO  L376      AbstractCegarLoop]: Hoare is true
[2020-07-08 12:18:26,962 INFO  L377      AbstractCegarLoop]: Compute interpolants for FPandBP
[2020-07-08 12:18:26,963 INFO  L378      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-07-08 12:18:26,963 INFO  L379      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-07-08 12:18:26,963 INFO  L380      AbstractCegarLoop]: Difference is false
[2020-07-08 12:18:26,963 INFO  L381      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-07-08 12:18:26,963 INFO  L385      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-07-08 12:18:26,984 INFO  L276                IsEmpty]: Start isEmpty. Operand 95 states.
[2020-07-08 12:18:26,994 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2020-07-08 12:18:26,994 INFO  L414         BasicCegarLoop]: Found error trace
[2020-07-08 12:18:26,996 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-07-08 12:18:26,996 INFO  L427      AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-08 12:18:27,002 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-07-08 12:18:27,003 INFO  L82        PathProgramCache]: Analyzing trace with hash 1217563597, now seen corresponding path program 1 times
[2020-07-08 12:18:27,014 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-07-08 12:18:27,014 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780437857]
[2020-07-08 12:18:27,015 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-08 12:18:27,154 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 12:18:27,262 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 12:18:27,277 INFO  L280        TraceCheckUtils]: 0: Hoare triple {125#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {98#true} is VALID
[2020-07-08 12:18:27,278 INFO  L280        TraceCheckUtils]: 1: Hoare triple {98#true} assume true; {98#true} is VALID
[2020-07-08 12:18:27,279 INFO  L275        TraceCheckUtils]: 2: Hoare quadruple {98#true} {98#true} #167#return; {98#true} is VALID
[2020-07-08 12:18:27,306 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 12:18:27,314 INFO  L280        TraceCheckUtils]: 0: Hoare triple {126#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {98#true} is VALID
[2020-07-08 12:18:27,315 INFO  L280        TraceCheckUtils]: 1: Hoare triple {98#true} assume true; {98#true} is VALID
[2020-07-08 12:18:27,315 INFO  L275        TraceCheckUtils]: 2: Hoare quadruple {98#true} {98#true} #123#return; {98#true} is VALID
[2020-07-08 12:18:27,317 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 12:18:27,323 INFO  L280        TraceCheckUtils]: 0: Hoare triple {98#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {98#true} is VALID
[2020-07-08 12:18:27,323 INFO  L280        TraceCheckUtils]: 1: Hoare triple {98#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {98#true} is VALID
[2020-07-08 12:18:27,324 INFO  L280        TraceCheckUtils]: 2: Hoare triple {98#true} assume true; {98#true} is VALID
[2020-07-08 12:18:27,324 INFO  L275        TraceCheckUtils]: 3: Hoare quadruple {98#true} {98#true} #137#return; {98#true} is VALID
[2020-07-08 12:18:27,326 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 12:18:27,332 INFO  L280        TraceCheckUtils]: 0: Hoare triple {98#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {98#true} is VALID
[2020-07-08 12:18:27,332 INFO  L280        TraceCheckUtils]: 1: Hoare triple {98#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {98#true} is VALID
[2020-07-08 12:18:27,333 INFO  L280        TraceCheckUtils]: 2: Hoare triple {98#true} assume true; {98#true} is VALID
[2020-07-08 12:18:27,333 INFO  L275        TraceCheckUtils]: 3: Hoare quadruple {98#true} {98#true} #139#return; {98#true} is VALID
[2020-07-08 12:18:27,335 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 12:18:27,340 INFO  L280        TraceCheckUtils]: 0: Hoare triple {98#true} ~cond := #in~cond; {98#true} is VALID
[2020-07-08 12:18:27,342 INFO  L280        TraceCheckUtils]: 1: Hoare triple {98#true} assume 0 == ~cond;assume false; {99#false} is VALID
[2020-07-08 12:18:27,342 INFO  L280        TraceCheckUtils]: 2: Hoare triple {99#false} assume true; {99#false} is VALID
[2020-07-08 12:18:27,343 INFO  L275        TraceCheckUtils]: 3: Hoare quadruple {99#false} {98#true} #141#return; {99#false} is VALID
[2020-07-08 12:18:27,376 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 12:18:27,390 INFO  L280        TraceCheckUtils]: 0: Hoare triple {127#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {98#true} is VALID
[2020-07-08 12:18:27,390 INFO  L280        TraceCheckUtils]: 1: Hoare triple {98#true} assume true; {98#true} is VALID
[2020-07-08 12:18:27,391 INFO  L275        TraceCheckUtils]: 2: Hoare quadruple {98#true} {99#false} #143#return; {99#false} is VALID
[2020-07-08 12:18:27,415 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 12:18:27,424 INFO  L280        TraceCheckUtils]: 0: Hoare triple {128#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {98#true} is VALID
[2020-07-08 12:18:27,424 INFO  L280        TraceCheckUtils]: 1: Hoare triple {98#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {98#true} is VALID
[2020-07-08 12:18:27,425 INFO  L280        TraceCheckUtils]: 2: Hoare triple {98#true} assume true; {98#true} is VALID
[2020-07-08 12:18:27,425 INFO  L275        TraceCheckUtils]: 3: Hoare quadruple {98#true} {99#false} #145#return; {99#false} is VALID
[2020-07-08 12:18:27,427 INFO  L263        TraceCheckUtils]: 0: Hoare triple {98#true} call ULTIMATE.init(); {125#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID
[2020-07-08 12:18:27,427 INFO  L280        TraceCheckUtils]: 1: Hoare triple {125#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {98#true} is VALID
[2020-07-08 12:18:27,428 INFO  L280        TraceCheckUtils]: 2: Hoare triple {98#true} assume true; {98#true} is VALID
[2020-07-08 12:18:27,428 INFO  L275        TraceCheckUtils]: 3: Hoare quadruple {98#true} {98#true} #167#return; {98#true} is VALID
[2020-07-08 12:18:27,428 INFO  L263        TraceCheckUtils]: 4: Hoare triple {98#true} call #t~ret39 := main(); {98#true} is VALID
[2020-07-08 12:18:27,430 INFO  L263        TraceCheckUtils]: 5: Hoare triple {98#true} call #t~ret38.base, #t~ret38.offset := nondet_tree(); {126#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID
[2020-07-08 12:18:27,430 INFO  L280        TraceCheckUtils]: 6: Hoare triple {126#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {98#true} is VALID
[2020-07-08 12:18:27,431 INFO  L280        TraceCheckUtils]: 7: Hoare triple {98#true} assume true; {98#true} is VALID
[2020-07-08 12:18:27,431 INFO  L275        TraceCheckUtils]: 8: Hoare quadruple {98#true} {98#true} #123#return; {98#true} is VALID
[2020-07-08 12:18:27,431 INFO  L263        TraceCheckUtils]: 9: Hoare triple {98#true} call task(#t~ret38.base, #t~ret38.offset); {98#true} is VALID
[2020-07-08 12:18:27,432 INFO  L280        TraceCheckUtils]: 10: Hoare triple {98#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {98#true} is VALID
[2020-07-08 12:18:27,432 INFO  L263        TraceCheckUtils]: 11: Hoare triple {98#true} call #t~ret25 := min(~t.base, ~t.offset); {98#true} is VALID
[2020-07-08 12:18:27,432 INFO  L280        TraceCheckUtils]: 12: Hoare triple {98#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {98#true} is VALID
[2020-07-08 12:18:27,433 INFO  L280        TraceCheckUtils]: 13: Hoare triple {98#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {98#true} is VALID
[2020-07-08 12:18:27,433 INFO  L280        TraceCheckUtils]: 14: Hoare triple {98#true} assume true; {98#true} is VALID
[2020-07-08 12:18:27,433 INFO  L275        TraceCheckUtils]: 15: Hoare quadruple {98#true} {98#true} #137#return; {98#true} is VALID
[2020-07-08 12:18:27,434 INFO  L280        TraceCheckUtils]: 16: Hoare triple {98#true} assume -2147483648 <= #t~ret25 && #t~ret25 <= 2147483647;~a~1 := #t~ret25;havoc #t~ret25;call ~#b~1.base, ~#b~1.offset := #Ultimate.allocOnStack(4); {98#true} is VALID
[2020-07-08 12:18:27,434 INFO  L263        TraceCheckUtils]: 17: Hoare triple {98#true} call #t~ret26 := size(~t.base, ~t.offset); {98#true} is VALID
[2020-07-08 12:18:27,434 INFO  L280        TraceCheckUtils]: 18: Hoare triple {98#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {98#true} is VALID
[2020-07-08 12:18:27,435 INFO  L280        TraceCheckUtils]: 19: Hoare triple {98#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {98#true} is VALID
[2020-07-08 12:18:27,435 INFO  L280        TraceCheckUtils]: 20: Hoare triple {98#true} assume true; {98#true} is VALID
[2020-07-08 12:18:27,435 INFO  L275        TraceCheckUtils]: 21: Hoare quadruple {98#true} {98#true} #139#return; {98#true} is VALID
[2020-07-08 12:18:27,436 INFO  L280        TraceCheckUtils]: 22: Hoare triple {98#true} assume -2147483648 <= #t~ret26 && #t~ret26 <= 2147483647;~n~1 := #t~ret26;havoc #t~ret26; {98#true} is VALID
[2020-07-08 12:18:27,436 INFO  L263        TraceCheckUtils]: 23: Hoare triple {98#true} call assume_abort_if_not((if 0 != ~n~1 then 1 else 0)); {98#true} is VALID
[2020-07-08 12:18:27,436 INFO  L280        TraceCheckUtils]: 24: Hoare triple {98#true} ~cond := #in~cond; {98#true} is VALID
[2020-07-08 12:18:27,437 INFO  L280        TraceCheckUtils]: 25: Hoare triple {98#true} assume 0 == ~cond;assume false; {99#false} is VALID
[2020-07-08 12:18:27,437 INFO  L280        TraceCheckUtils]: 26: Hoare triple {99#false} assume true; {99#false} is VALID
[2020-07-08 12:18:27,438 INFO  L275        TraceCheckUtils]: 27: Hoare quadruple {99#false} {98#true} #141#return; {99#false} is VALID
[2020-07-08 12:18:27,438 INFO  L280        TraceCheckUtils]: 28: Hoare triple {99#false} call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(4 * ~n~1); {99#false} is VALID
[2020-07-08 12:18:27,438 INFO  L263        TraceCheckUtils]: 29: Hoare triple {99#false} call #Ultimate.meminit(#t~malloc27.base, #t~malloc27.offset, ~n~1, 4, 4 * ~n~1); {127#(= |#memory_int| |old(#memory_int)|)} is VALID
[2020-07-08 12:18:27,439 INFO  L280        TraceCheckUtils]: 30: Hoare triple {127#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {98#true} is VALID
[2020-07-08 12:18:27,439 INFO  L280        TraceCheckUtils]: 31: Hoare triple {98#true} assume true; {98#true} is VALID
[2020-07-08 12:18:27,440 INFO  L275        TraceCheckUtils]: 32: Hoare quadruple {98#true} {99#false} #143#return; {99#false} is VALID
[2020-07-08 12:18:27,440 INFO  L280        TraceCheckUtils]: 33: Hoare triple {99#false} ~x~0.base, ~x~0.offset := #t~malloc27.base, #t~malloc27.offset; {99#false} is VALID
[2020-07-08 12:18:27,440 INFO  L263        TraceCheckUtils]: 34: Hoare triple {99#false} call #t~ret28 := tree_inorder(~t.base, ~t.offset, ~x~0.base, ~x~0.offset, ~n~1); {128#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID
[2020-07-08 12:18:27,441 INFO  L280        TraceCheckUtils]: 35: Hoare triple {128#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {98#true} is VALID
[2020-07-08 12:18:27,441 INFO  L280        TraceCheckUtils]: 36: Hoare triple {98#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {98#true} is VALID
[2020-07-08 12:18:27,441 INFO  L280        TraceCheckUtils]: 37: Hoare triple {98#true} assume true; {98#true} is VALID
[2020-07-08 12:18:27,441 INFO  L275        TraceCheckUtils]: 38: Hoare quadruple {98#true} {99#false} #145#return; {99#false} is VALID
[2020-07-08 12:18:27,442 INFO  L280        TraceCheckUtils]: 39: Hoare triple {99#false} assume -2147483648 <= #t~ret28 && #t~ret28 <= 2147483647;havoc #t~ret28;call #t~mem29 := read~int(~x~0.base, ~x~0.offset, 4); {99#false} is VALID
[2020-07-08 12:18:27,442 INFO  L263        TraceCheckUtils]: 40: Hoare triple {99#false} call __VERIFIER_assert((if ~a~1 == #t~mem29 then 1 else 0)); {99#false} is VALID
[2020-07-08 12:18:27,442 INFO  L280        TraceCheckUtils]: 41: Hoare triple {99#false} ~cond := #in~cond; {99#false} is VALID
[2020-07-08 12:18:27,443 INFO  L280        TraceCheckUtils]: 42: Hoare triple {99#false} assume 0 == ~cond; {99#false} is VALID
[2020-07-08 12:18:27,443 INFO  L280        TraceCheckUtils]: 43: Hoare triple {99#false} assume !false; {99#false} is VALID
[2020-07-08 12:18:27,451 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-07-08 12:18:27,452 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780437857]
[2020-07-08 12:18:27,453 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-08 12:18:27,453 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2020-07-08 12:18:27,454 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146641028]
[2020-07-08 12:18:27,461 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 44
[2020-07-08 12:18:27,464 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2020-07-08 12:18:27,469 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states.
[2020-07-08 12:18:27,547 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-08 12:18:27,548 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 6 states
[2020-07-08 12:18:27,548 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-07-08 12:18:27,557 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2020-07-08 12:18:27,559 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2020-07-08 12:18:27,561 INFO  L87              Difference]: Start difference. First operand 95 states. Second operand 6 states.
[2020-07-08 12:18:28,942 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-08 12:18:28,942 INFO  L93              Difference]: Finished difference Result 165 states and 215 transitions.
[2020-07-08 12:18:28,943 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2020-07-08 12:18:28,943 INFO  L78                 Accepts]: Start accepts. Automaton has 6 states. Word has length 44
[2020-07-08 12:18:28,943 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-08 12:18:28,945 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2020-07-08 12:18:28,967 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 215 transitions.
[2020-07-08 12:18:28,967 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2020-07-08 12:18:28,981 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 215 transitions.
[2020-07-08 12:18:28,982 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 215 transitions.
[2020-07-08 12:18:29,359 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 215 edges. 215 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-08 12:18:29,379 INFO  L225             Difference]: With dead ends: 165
[2020-07-08 12:18:29,380 INFO  L226             Difference]: Without dead ends: 93
[2020-07-08 12:18:29,385 INFO  L675         BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2020-07-08 12:18:29,406 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 93 states.
[2020-07-08 12:18:29,488 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 87.
[2020-07-08 12:18:29,488 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-08 12:18:29,489 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand 87 states.
[2020-07-08 12:18:29,490 INFO  L74              IsIncluded]: Start isIncluded. First operand 93 states. Second operand 87 states.
[2020-07-08 12:18:29,490 INFO  L87              Difference]: Start difference. First operand 93 states. Second operand 87 states.
[2020-07-08 12:18:29,502 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-08 12:18:29,503 INFO  L93              Difference]: Finished difference Result 93 states and 119 transitions.
[2020-07-08 12:18:29,503 INFO  L276                IsEmpty]: Start isEmpty. Operand 93 states and 119 transitions.
[2020-07-08 12:18:29,506 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-08 12:18:29,507 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2020-07-08 12:18:29,507 INFO  L74              IsIncluded]: Start isIncluded. First operand 87 states. Second operand 93 states.
[2020-07-08 12:18:29,507 INFO  L87              Difference]: Start difference. First operand 87 states. Second operand 93 states.
[2020-07-08 12:18:29,517 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-08 12:18:29,517 INFO  L93              Difference]: Finished difference Result 93 states and 119 transitions.
[2020-07-08 12:18:29,517 INFO  L276                IsEmpty]: Start isEmpty. Operand 93 states and 119 transitions.
[2020-07-08 12:18:29,520 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-08 12:18:29,520 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2020-07-08 12:18:29,520 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2020-07-08 12:18:29,521 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-08 12:18:29,521 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 87 states.
[2020-07-08 12:18:29,527 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 108 transitions.
[2020-07-08 12:18:29,529 INFO  L78                 Accepts]: Start accepts. Automaton has 87 states and 108 transitions. Word has length 44
[2020-07-08 12:18:29,530 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-07-08 12:18:29,530 INFO  L479      AbstractCegarLoop]: Abstraction has 87 states and 108 transitions.
[2020-07-08 12:18:29,530 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 6 states.
[2020-07-08 12:18:29,530 INFO  L276                IsEmpty]: Start isEmpty. Operand 87 states and 108 transitions.
[2020-07-08 12:18:29,532 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2020-07-08 12:18:29,533 INFO  L414         BasicCegarLoop]: Found error trace
[2020-07-08 12:18:29,533 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-07-08 12:18:29,533 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-07-08 12:18:29,533 INFO  L427      AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-08 12:18:29,534 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-07-08 12:18:29,534 INFO  L82        PathProgramCache]: Analyzing trace with hash -471380145, now seen corresponding path program 1 times
[2020-07-08 12:18:29,534 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-07-08 12:18:29,535 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062234745]
[2020-07-08 12:18:29,535 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-08 12:18:29,593 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 12:18:29,720 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 12:18:29,726 INFO  L280        TraceCheckUtils]: 0: Hoare triple {697#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {668#true} is VALID
[2020-07-08 12:18:29,726 INFO  L280        TraceCheckUtils]: 1: Hoare triple {668#true} assume true; {668#true} is VALID
[2020-07-08 12:18:29,727 INFO  L275        TraceCheckUtils]: 2: Hoare quadruple {668#true} {668#true} #167#return; {668#true} is VALID
[2020-07-08 12:18:29,751 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 12:18:29,756 INFO  L280        TraceCheckUtils]: 0: Hoare triple {698#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {668#true} is VALID
[2020-07-08 12:18:29,757 INFO  L280        TraceCheckUtils]: 1: Hoare triple {668#true} assume true; {668#true} is VALID
[2020-07-08 12:18:29,757 INFO  L275        TraceCheckUtils]: 2: Hoare quadruple {668#true} {668#true} #123#return; {668#true} is VALID
[2020-07-08 12:18:29,758 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 12:18:29,762 INFO  L280        TraceCheckUtils]: 0: Hoare triple {668#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {668#true} is VALID
[2020-07-08 12:18:29,763 INFO  L280        TraceCheckUtils]: 1: Hoare triple {668#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {668#true} is VALID
[2020-07-08 12:18:29,763 INFO  L280        TraceCheckUtils]: 2: Hoare triple {668#true} assume true; {668#true} is VALID
[2020-07-08 12:18:29,763 INFO  L275        TraceCheckUtils]: 3: Hoare quadruple {668#true} {668#true} #137#return; {668#true} is VALID
[2020-07-08 12:18:29,765 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 12:18:29,783 INFO  L280        TraceCheckUtils]: 0: Hoare triple {668#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {668#true} is VALID
[2020-07-08 12:18:29,784 INFO  L280        TraceCheckUtils]: 1: Hoare triple {668#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {699#(= 0 |size_#res|)} is VALID
[2020-07-08 12:18:29,785 INFO  L280        TraceCheckUtils]: 2: Hoare triple {699#(= 0 |size_#res|)} assume true; {699#(= 0 |size_#res|)} is VALID
[2020-07-08 12:18:29,786 INFO  L275        TraceCheckUtils]: 3: Hoare quadruple {699#(= 0 |size_#res|)} {668#true} #139#return; {684#(= 0 |task_#t~ret26|)} is VALID
[2020-07-08 12:18:29,789 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 12:18:29,818 INFO  L280        TraceCheckUtils]: 0: Hoare triple {668#true} ~cond := #in~cond; {700#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID
[2020-07-08 12:18:29,819 INFO  L280        TraceCheckUtils]: 1: Hoare triple {700#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {701#(not (= 0 |assume_abort_if_not_#in~cond|))} is VALID
[2020-07-08 12:18:29,820 INFO  L280        TraceCheckUtils]: 2: Hoare triple {701#(not (= 0 |assume_abort_if_not_#in~cond|))} assume true; {701#(not (= 0 |assume_abort_if_not_#in~cond|))} is VALID
[2020-07-08 12:18:29,821 INFO  L275        TraceCheckUtils]: 3: Hoare quadruple {701#(not (= 0 |assume_abort_if_not_#in~cond|))} {685#(= 0 task_~n~1)} #141#return; {669#false} is VALID
[2020-07-08 12:18:29,833 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 12:18:29,837 INFO  L280        TraceCheckUtils]: 0: Hoare triple {702#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {668#true} is VALID
[2020-07-08 12:18:29,838 INFO  L280        TraceCheckUtils]: 1: Hoare triple {668#true} assume true; {668#true} is VALID
[2020-07-08 12:18:29,838 INFO  L275        TraceCheckUtils]: 2: Hoare quadruple {668#true} {669#false} #143#return; {669#false} is VALID
[2020-07-08 12:18:29,859 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 12:18:29,863 INFO  L280        TraceCheckUtils]: 0: Hoare triple {703#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {668#true} is VALID
[2020-07-08 12:18:29,864 INFO  L280        TraceCheckUtils]: 1: Hoare triple {668#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {668#true} is VALID
[2020-07-08 12:18:29,864 INFO  L280        TraceCheckUtils]: 2: Hoare triple {668#true} assume true; {668#true} is VALID
[2020-07-08 12:18:29,864 INFO  L275        TraceCheckUtils]: 3: Hoare quadruple {668#true} {669#false} #145#return; {669#false} is VALID
[2020-07-08 12:18:29,865 INFO  L263        TraceCheckUtils]: 0: Hoare triple {668#true} call ULTIMATE.init(); {697#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID
[2020-07-08 12:18:29,866 INFO  L280        TraceCheckUtils]: 1: Hoare triple {697#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {668#true} is VALID
[2020-07-08 12:18:29,866 INFO  L280        TraceCheckUtils]: 2: Hoare triple {668#true} assume true; {668#true} is VALID
[2020-07-08 12:18:29,866 INFO  L275        TraceCheckUtils]: 3: Hoare quadruple {668#true} {668#true} #167#return; {668#true} is VALID
[2020-07-08 12:18:29,867 INFO  L263        TraceCheckUtils]: 4: Hoare triple {668#true} call #t~ret39 := main(); {668#true} is VALID
[2020-07-08 12:18:29,868 INFO  L263        TraceCheckUtils]: 5: Hoare triple {668#true} call #t~ret38.base, #t~ret38.offset := nondet_tree(); {698#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID
[2020-07-08 12:18:29,869 INFO  L280        TraceCheckUtils]: 6: Hoare triple {698#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {668#true} is VALID
[2020-07-08 12:18:29,869 INFO  L280        TraceCheckUtils]: 7: Hoare triple {668#true} assume true; {668#true} is VALID
[2020-07-08 12:18:29,869 INFO  L275        TraceCheckUtils]: 8: Hoare quadruple {668#true} {668#true} #123#return; {668#true} is VALID
[2020-07-08 12:18:29,870 INFO  L263        TraceCheckUtils]: 9: Hoare triple {668#true} call task(#t~ret38.base, #t~ret38.offset); {668#true} is VALID
[2020-07-08 12:18:29,870 INFO  L280        TraceCheckUtils]: 10: Hoare triple {668#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {668#true} is VALID
[2020-07-08 12:18:29,870 INFO  L263        TraceCheckUtils]: 11: Hoare triple {668#true} call #t~ret25 := min(~t.base, ~t.offset); {668#true} is VALID
[2020-07-08 12:18:29,870 INFO  L280        TraceCheckUtils]: 12: Hoare triple {668#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {668#true} is VALID
[2020-07-08 12:18:29,871 INFO  L280        TraceCheckUtils]: 13: Hoare triple {668#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {668#true} is VALID
[2020-07-08 12:18:29,871 INFO  L280        TraceCheckUtils]: 14: Hoare triple {668#true} assume true; {668#true} is VALID
[2020-07-08 12:18:29,871 INFO  L275        TraceCheckUtils]: 15: Hoare quadruple {668#true} {668#true} #137#return; {668#true} is VALID
[2020-07-08 12:18:29,872 INFO  L280        TraceCheckUtils]: 16: Hoare triple {668#true} assume -2147483648 <= #t~ret25 && #t~ret25 <= 2147483647;~a~1 := #t~ret25;havoc #t~ret25;call ~#b~1.base, ~#b~1.offset := #Ultimate.allocOnStack(4); {668#true} is VALID
[2020-07-08 12:18:29,872 INFO  L263        TraceCheckUtils]: 17: Hoare triple {668#true} call #t~ret26 := size(~t.base, ~t.offset); {668#true} is VALID
[2020-07-08 12:18:29,872 INFO  L280        TraceCheckUtils]: 18: Hoare triple {668#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {668#true} is VALID
[2020-07-08 12:18:29,873 INFO  L280        TraceCheckUtils]: 19: Hoare triple {668#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {699#(= 0 |size_#res|)} is VALID
[2020-07-08 12:18:29,874 INFO  L280        TraceCheckUtils]: 20: Hoare triple {699#(= 0 |size_#res|)} assume true; {699#(= 0 |size_#res|)} is VALID
[2020-07-08 12:18:29,875 INFO  L275        TraceCheckUtils]: 21: Hoare quadruple {699#(= 0 |size_#res|)} {668#true} #139#return; {684#(= 0 |task_#t~ret26|)} is VALID
[2020-07-08 12:18:29,876 INFO  L280        TraceCheckUtils]: 22: Hoare triple {684#(= 0 |task_#t~ret26|)} assume -2147483648 <= #t~ret26 && #t~ret26 <= 2147483647;~n~1 := #t~ret26;havoc #t~ret26; {685#(= 0 task_~n~1)} is VALID
[2020-07-08 12:18:29,876 INFO  L263        TraceCheckUtils]: 23: Hoare triple {685#(= 0 task_~n~1)} call assume_abort_if_not((if 0 != ~n~1 then 1 else 0)); {668#true} is VALID
[2020-07-08 12:18:29,877 INFO  L280        TraceCheckUtils]: 24: Hoare triple {668#true} ~cond := #in~cond; {700#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID
[2020-07-08 12:18:29,878 INFO  L280        TraceCheckUtils]: 25: Hoare triple {700#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {701#(not (= 0 |assume_abort_if_not_#in~cond|))} is VALID
[2020-07-08 12:18:29,878 INFO  L280        TraceCheckUtils]: 26: Hoare triple {701#(not (= 0 |assume_abort_if_not_#in~cond|))} assume true; {701#(not (= 0 |assume_abort_if_not_#in~cond|))} is VALID
[2020-07-08 12:18:29,879 INFO  L275        TraceCheckUtils]: 27: Hoare quadruple {701#(not (= 0 |assume_abort_if_not_#in~cond|))} {685#(= 0 task_~n~1)} #141#return; {669#false} is VALID
[2020-07-08 12:18:29,880 INFO  L280        TraceCheckUtils]: 28: Hoare triple {669#false} call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(4 * ~n~1); {669#false} is VALID
[2020-07-08 12:18:29,880 INFO  L263        TraceCheckUtils]: 29: Hoare triple {669#false} call #Ultimate.meminit(#t~malloc27.base, #t~malloc27.offset, ~n~1, 4, 4 * ~n~1); {702#(= |#memory_int| |old(#memory_int)|)} is VALID
[2020-07-08 12:18:29,880 INFO  L280        TraceCheckUtils]: 30: Hoare triple {702#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {668#true} is VALID
[2020-07-08 12:18:29,880 INFO  L280        TraceCheckUtils]: 31: Hoare triple {668#true} assume true; {668#true} is VALID
[2020-07-08 12:18:29,881 INFO  L275        TraceCheckUtils]: 32: Hoare quadruple {668#true} {669#false} #143#return; {669#false} is VALID
[2020-07-08 12:18:29,881 INFO  L280        TraceCheckUtils]: 33: Hoare triple {669#false} ~x~0.base, ~x~0.offset := #t~malloc27.base, #t~malloc27.offset; {669#false} is VALID
[2020-07-08 12:18:29,881 INFO  L263        TraceCheckUtils]: 34: Hoare triple {669#false} call #t~ret28 := tree_inorder(~t.base, ~t.offset, ~x~0.base, ~x~0.offset, ~n~1); {703#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID
[2020-07-08 12:18:29,882 INFO  L280        TraceCheckUtils]: 35: Hoare triple {703#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {668#true} is VALID
[2020-07-08 12:18:29,882 INFO  L280        TraceCheckUtils]: 36: Hoare triple {668#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {668#true} is VALID
[2020-07-08 12:18:29,882 INFO  L280        TraceCheckUtils]: 37: Hoare triple {668#true} assume true; {668#true} is VALID
[2020-07-08 12:18:29,882 INFO  L275        TraceCheckUtils]: 38: Hoare quadruple {668#true} {669#false} #145#return; {669#false} is VALID
[2020-07-08 12:18:29,883 INFO  L280        TraceCheckUtils]: 39: Hoare triple {669#false} assume -2147483648 <= #t~ret28 && #t~ret28 <= 2147483647;havoc #t~ret28;call #t~mem29 := read~int(~x~0.base, ~x~0.offset, 4); {669#false} is VALID
[2020-07-08 12:18:29,883 INFO  L263        TraceCheckUtils]: 40: Hoare triple {669#false} call __VERIFIER_assert((if ~a~1 == #t~mem29 then 1 else 0)); {669#false} is VALID
[2020-07-08 12:18:29,883 INFO  L280        TraceCheckUtils]: 41: Hoare triple {669#false} ~cond := #in~cond; {669#false} is VALID
[2020-07-08 12:18:29,883 INFO  L280        TraceCheckUtils]: 42: Hoare triple {669#false} assume 0 == ~cond; {669#false} is VALID
[2020-07-08 12:18:29,884 INFO  L280        TraceCheckUtils]: 43: Hoare triple {669#false} assume !false; {669#false} is VALID
[2020-07-08 12:18:29,887 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-07-08 12:18:29,887 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062234745]
[2020-07-08 12:18:29,887 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-08 12:18:29,888 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2020-07-08 12:18:29,888 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251132912]
[2020-07-08 12:18:29,890 INFO  L78                 Accepts]: Start accepts. Automaton has 11 states. Word has length 44
[2020-07-08 12:18:29,890 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2020-07-08 12:18:29,890 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states.
[2020-07-08 12:18:29,939 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-08 12:18:29,939 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 11 states
[2020-07-08 12:18:29,939 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-07-08 12:18:29,940 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2020-07-08 12:18:29,940 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2020-07-08 12:18:29,940 INFO  L87              Difference]: Start difference. First operand 87 states and 108 transitions. Second operand 11 states.
[2020-07-08 12:18:32,268 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-08 12:18:32,268 INFO  L93              Difference]: Finished difference Result 151 states and 194 transitions.
[2020-07-08 12:18:32,268 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2020-07-08 12:18:32,269 INFO  L78                 Accepts]: Start accepts. Automaton has 11 states. Word has length 44
[2020-07-08 12:18:32,269 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-08 12:18:32,269 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2020-07-08 12:18:32,278 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 194 transitions.
[2020-07-08 12:18:32,278 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2020-07-08 12:18:32,287 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 194 transitions.
[2020-07-08 12:18:32,288 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 194 transitions.
[2020-07-08 12:18:32,602 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-08 12:18:32,613 INFO  L225             Difference]: With dead ends: 151
[2020-07-08 12:18:32,613 INFO  L226             Difference]: Without dead ends: 95
[2020-07-08 12:18:32,617 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-07-08 12:18:32,618 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 95 states.
[2020-07-08 12:18:32,689 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 89.
[2020-07-08 12:18:32,690 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-08 12:18:32,690 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand 89 states.
[2020-07-08 12:18:32,690 INFO  L74              IsIncluded]: Start isIncluded. First operand 95 states. Second operand 89 states.
[2020-07-08 12:18:32,690 INFO  L87              Difference]: Start difference. First operand 95 states. Second operand 89 states.
[2020-07-08 12:18:32,700 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-08 12:18:32,701 INFO  L93              Difference]: Finished difference Result 95 states and 123 transitions.
[2020-07-08 12:18:32,701 INFO  L276                IsEmpty]: Start isEmpty. Operand 95 states and 123 transitions.
[2020-07-08 12:18:32,708 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-08 12:18:32,708 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2020-07-08 12:18:32,709 INFO  L74              IsIncluded]: Start isIncluded. First operand 89 states. Second operand 95 states.
[2020-07-08 12:18:32,709 INFO  L87              Difference]: Start difference. First operand 89 states. Second operand 95 states.
[2020-07-08 12:18:32,721 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-08 12:18:32,721 INFO  L93              Difference]: Finished difference Result 95 states and 123 transitions.
[2020-07-08 12:18:32,722 INFO  L276                IsEmpty]: Start isEmpty. Operand 95 states and 123 transitions.
[2020-07-08 12:18:32,724 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-08 12:18:32,724 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2020-07-08 12:18:32,725 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2020-07-08 12:18:32,725 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-08 12:18:32,725 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 89 states.
[2020-07-08 12:18:32,731 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 112 transitions.
[2020-07-08 12:18:32,731 INFO  L78                 Accepts]: Start accepts. Automaton has 89 states and 112 transitions. Word has length 44
[2020-07-08 12:18:32,732 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-07-08 12:18:32,732 INFO  L479      AbstractCegarLoop]: Abstraction has 89 states and 112 transitions.
[2020-07-08 12:18:32,732 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 11 states.
[2020-07-08 12:18:32,732 INFO  L276                IsEmpty]: Start isEmpty. Operand 89 states and 112 transitions.
[2020-07-08 12:18:32,740 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 57
[2020-07-08 12:18:32,740 INFO  L414         BasicCegarLoop]: Found error trace
[2020-07-08 12:18:32,741 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-07-08 12:18:32,741 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-07-08 12:18:32,741 INFO  L427      AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-08 12:18:32,741 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-07-08 12:18:32,742 INFO  L82        PathProgramCache]: Analyzing trace with hash 800610240, now seen corresponding path program 1 times
[2020-07-08 12:18:32,742 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-07-08 12:18:32,742 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379878350]
[2020-07-08 12:18:32,743 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-08 12:18:32,807 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 12:18:32,927 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 12:18:32,934 INFO  L280        TraceCheckUtils]: 0: Hoare triple {1288#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1246#true} is VALID
[2020-07-08 12:18:32,935 INFO  L280        TraceCheckUtils]: 1: Hoare triple {1246#true} assume true; {1246#true} is VALID
[2020-07-08 12:18:32,935 INFO  L275        TraceCheckUtils]: 2: Hoare quadruple {1246#true} {1246#true} #167#return; {1246#true} is VALID
[2020-07-08 12:18:32,958 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 12:18:32,989 INFO  L280        TraceCheckUtils]: 0: Hoare triple {1289#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {1290#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} is VALID
[2020-07-08 12:18:32,990 INFO  L280        TraceCheckUtils]: 1: Hoare triple {1290#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} assume true; {1290#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} is VALID
[2020-07-08 12:18:32,996 INFO  L275        TraceCheckUtils]: 2: Hoare quadruple {1290#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} {1246#true} #123#return; {1254#(and (= 0 |main_#t~ret38.offset|) (= 0 |main_#t~ret38.base|))} is VALID
[2020-07-08 12:18:32,999 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 12:18:33,004 INFO  L280        TraceCheckUtils]: 0: Hoare triple {1246#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {1246#true} is VALID
[2020-07-08 12:18:33,004 INFO  L280        TraceCheckUtils]: 1: Hoare triple {1246#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {1246#true} is VALID
[2020-07-08 12:18:33,005 INFO  L280        TraceCheckUtils]: 2: Hoare triple {1246#true} assume true; {1246#true} is VALID
[2020-07-08 12:18:33,006 INFO  L275        TraceCheckUtils]: 3: Hoare quadruple {1246#true} {1256#(and (= 0 task_~t.offset) (= 0 task_~t.base))} #137#return; {1256#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID
[2020-07-08 12:18:33,012 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 12:18:33,093 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 12:18:33,104 INFO  L280        TraceCheckUtils]: 0: Hoare triple {1246#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1246#true} is VALID
[2020-07-08 12:18:33,104 INFO  L280        TraceCheckUtils]: 1: Hoare triple {1246#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1246#true} is VALID
[2020-07-08 12:18:33,105 INFO  L280        TraceCheckUtils]: 2: Hoare triple {1246#true} assume true; {1246#true} is VALID
[2020-07-08 12:18:33,106 INFO  L275        TraceCheckUtils]: 3: Hoare quadruple {1246#true} {1292#(or (and (= |size_#in~t.offset| size_~t.offset) (not (= 0 size_~t.offset))) (not (= 0 |size_#in~t.base|)))} #163#return; {1292#(or (and (= |size_#in~t.offset| size_~t.offset) (not (= 0 size_~t.offset))) (not (= 0 |size_#in~t.base|)))} is VALID
[2020-07-08 12:18:33,108 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 12:18:33,112 INFO  L280        TraceCheckUtils]: 0: Hoare triple {1246#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1246#true} is VALID
[2020-07-08 12:18:33,112 INFO  L280        TraceCheckUtils]: 1: Hoare triple {1246#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1246#true} is VALID
[2020-07-08 12:18:33,113 INFO  L280        TraceCheckUtils]: 2: Hoare triple {1246#true} assume true; {1246#true} is VALID
[2020-07-08 12:18:33,114 INFO  L275        TraceCheckUtils]: 3: Hoare quadruple {1246#true} {1297#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #165#return; {1297#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID
[2020-07-08 12:18:33,115 INFO  L280        TraceCheckUtils]: 0: Hoare triple {1246#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1291#(and (or (= 0 size_~t.offset) (= |size_#in~t.offset| size_~t.offset)) (= |size_#in~t.base| size_~t.base))} is VALID
[2020-07-08 12:18:33,116 INFO  L280        TraceCheckUtils]: 1: Hoare triple {1291#(and (or (= 0 size_~t.offset) (= |size_#in~t.offset| size_~t.offset)) (= |size_#in~t.base| size_~t.base))} assume !(~t.base == 0 && ~t.offset == 0);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 4); {1292#(or (and (= |size_#in~t.offset| size_~t.offset) (not (= 0 size_~t.offset))) (not (= 0 |size_#in~t.base|)))} is VALID
[2020-07-08 12:18:33,116 INFO  L263        TraceCheckUtils]: 2: Hoare triple {1292#(or (and (= |size_#in~t.offset| size_~t.offset) (not (= 0 size_~t.offset))) (not (= 0 |size_#in~t.base|)))} call #t~ret22 := size(#t~mem21.base, #t~mem21.offset); {1246#true} is VALID
[2020-07-08 12:18:33,117 INFO  L280        TraceCheckUtils]: 3: Hoare triple {1246#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1246#true} is VALID
[2020-07-08 12:18:33,117 INFO  L280        TraceCheckUtils]: 4: Hoare triple {1246#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1246#true} is VALID
[2020-07-08 12:18:33,117 INFO  L280        TraceCheckUtils]: 5: Hoare triple {1246#true} assume true; {1246#true} is VALID
[2020-07-08 12:18:33,118 INFO  L275        TraceCheckUtils]: 6: Hoare quadruple {1246#true} {1292#(or (and (= |size_#in~t.offset| size_~t.offset) (not (= 0 size_~t.offset))) (not (= 0 |size_#in~t.base|)))} #163#return; {1292#(or (and (= |size_#in~t.offset| size_~t.offset) (not (= 0 size_~t.offset))) (not (= 0 |size_#in~t.base|)))} is VALID
[2020-07-08 12:18:33,119 INFO  L280        TraceCheckUtils]: 7: Hoare triple {1292#(or (and (= |size_#in~t.offset| size_~t.offset) (not (= 0 size_~t.offset))) (not (= 0 |size_#in~t.base|)))} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~t.base, 8 + ~t.offset, 4); {1297#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID
[2020-07-08 12:18:33,120 INFO  L263        TraceCheckUtils]: 8: Hoare triple {1297#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} call #t~ret24 := size(#t~mem23.base, #t~mem23.offset); {1246#true} is VALID
[2020-07-08 12:18:33,120 INFO  L280        TraceCheckUtils]: 9: Hoare triple {1246#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1246#true} is VALID
[2020-07-08 12:18:33,120 INFO  L280        TraceCheckUtils]: 10: Hoare triple {1246#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1246#true} is VALID
[2020-07-08 12:18:33,121 INFO  L280        TraceCheckUtils]: 11: Hoare triple {1246#true} assume true; {1246#true} is VALID
[2020-07-08 12:18:33,122 INFO  L275        TraceCheckUtils]: 12: Hoare quadruple {1246#true} {1297#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #165#return; {1297#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID
[2020-07-08 12:18:33,123 INFO  L280        TraceCheckUtils]: 13: Hoare triple {1297#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume -2147483648 <= #t~ret24 && #t~ret24 <= 2147483647;#res := 1 + (#t~ret22 + #t~ret24);havoc #t~mem21.base, #t~mem21.offset;havoc #t~mem23.base, #t~mem23.offset;havoc #t~ret24;havoc #t~ret22; {1297#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID
[2020-07-08 12:18:33,123 INFO  L280        TraceCheckUtils]: 14: Hoare triple {1297#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume true; {1297#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID
[2020-07-08 12:18:33,125 INFO  L275        TraceCheckUtils]: 15: Hoare quadruple {1297#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} {1256#(and (= 0 task_~t.offset) (= 0 task_~t.base))} #139#return; {1247#false} is VALID
[2020-07-08 12:18:33,126 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 12:18:33,130 INFO  L280        TraceCheckUtils]: 0: Hoare triple {1246#true} ~cond := #in~cond; {1246#true} is VALID
[2020-07-08 12:18:33,130 INFO  L280        TraceCheckUtils]: 1: Hoare triple {1246#true} assume !(0 == ~cond); {1246#true} is VALID
[2020-07-08 12:18:33,130 INFO  L280        TraceCheckUtils]: 2: Hoare triple {1246#true} assume true; {1246#true} is VALID
[2020-07-08 12:18:33,131 INFO  L275        TraceCheckUtils]: 3: Hoare quadruple {1246#true} {1247#false} #141#return; {1247#false} is VALID
[2020-07-08 12:18:33,148 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 12:18:33,152 INFO  L280        TraceCheckUtils]: 0: Hoare triple {1302#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1246#true} is VALID
[2020-07-08 12:18:33,153 INFO  L280        TraceCheckUtils]: 1: Hoare triple {1246#true} assume true; {1246#true} is VALID
[2020-07-08 12:18:33,153 INFO  L275        TraceCheckUtils]: 2: Hoare quadruple {1246#true} {1247#false} #143#return; {1247#false} is VALID
[2020-07-08 12:18:33,193 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 12:18:33,197 INFO  L280        TraceCheckUtils]: 0: Hoare triple {1303#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {1246#true} is VALID
[2020-07-08 12:18:33,197 INFO  L280        TraceCheckUtils]: 1: Hoare triple {1246#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {1246#true} is VALID
[2020-07-08 12:18:33,198 INFO  L280        TraceCheckUtils]: 2: Hoare triple {1246#true} assume true; {1246#true} is VALID
[2020-07-08 12:18:33,198 INFO  L275        TraceCheckUtils]: 3: Hoare quadruple {1246#true} {1247#false} #145#return; {1247#false} is VALID
[2020-07-08 12:18:33,199 INFO  L263        TraceCheckUtils]: 0: Hoare triple {1246#true} call ULTIMATE.init(); {1288#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID
[2020-07-08 12:18:33,200 INFO  L280        TraceCheckUtils]: 1: Hoare triple {1288#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1246#true} is VALID
[2020-07-08 12:18:33,200 INFO  L280        TraceCheckUtils]: 2: Hoare triple {1246#true} assume true; {1246#true} is VALID
[2020-07-08 12:18:33,200 INFO  L275        TraceCheckUtils]: 3: Hoare quadruple {1246#true} {1246#true} #167#return; {1246#true} is VALID
[2020-07-08 12:18:33,200 INFO  L263        TraceCheckUtils]: 4: Hoare triple {1246#true} call #t~ret39 := main(); {1246#true} is VALID
[2020-07-08 12:18:33,201 INFO  L263        TraceCheckUtils]: 5: Hoare triple {1246#true} call #t~ret38.base, #t~ret38.offset := nondet_tree(); {1289#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID
[2020-07-08 12:18:33,202 INFO  L280        TraceCheckUtils]: 6: Hoare triple {1289#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {1290#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} is VALID
[2020-07-08 12:18:33,203 INFO  L280        TraceCheckUtils]: 7: Hoare triple {1290#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} assume true; {1290#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} is VALID
[2020-07-08 12:18:33,205 INFO  L275        TraceCheckUtils]: 8: Hoare quadruple {1290#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} {1246#true} #123#return; {1254#(and (= 0 |main_#t~ret38.offset|) (= 0 |main_#t~ret38.base|))} is VALID
[2020-07-08 12:18:33,206 INFO  L263        TraceCheckUtils]: 9: Hoare triple {1254#(and (= 0 |main_#t~ret38.offset|) (= 0 |main_#t~ret38.base|))} call task(#t~ret38.base, #t~ret38.offset); {1255#(and (= 0 |task_#in~t.offset|) (= |task_#in~t.base| 0))} is VALID
[2020-07-08 12:18:33,207 INFO  L280        TraceCheckUtils]: 10: Hoare triple {1255#(and (= 0 |task_#in~t.offset|) (= |task_#in~t.base| 0))} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1256#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID
[2020-07-08 12:18:33,207 INFO  L263        TraceCheckUtils]: 11: Hoare triple {1256#(and (= 0 task_~t.offset) (= 0 task_~t.base))} call #t~ret25 := min(~t.base, ~t.offset); {1246#true} is VALID
[2020-07-08 12:18:33,207 INFO  L280        TraceCheckUtils]: 12: Hoare triple {1246#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {1246#true} is VALID
[2020-07-08 12:18:33,207 INFO  L280        TraceCheckUtils]: 13: Hoare triple {1246#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {1246#true} is VALID
[2020-07-08 12:18:33,208 INFO  L280        TraceCheckUtils]: 14: Hoare triple {1246#true} assume true; {1246#true} is VALID
[2020-07-08 12:18:33,209 INFO  L275        TraceCheckUtils]: 15: Hoare quadruple {1246#true} {1256#(and (= 0 task_~t.offset) (= 0 task_~t.base))} #137#return; {1256#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID
[2020-07-08 12:18:33,210 INFO  L280        TraceCheckUtils]: 16: Hoare triple {1256#(and (= 0 task_~t.offset) (= 0 task_~t.base))} assume -2147483648 <= #t~ret25 && #t~ret25 <= 2147483647;~a~1 := #t~ret25;havoc #t~ret25;call ~#b~1.base, ~#b~1.offset := #Ultimate.allocOnStack(4); {1256#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID
[2020-07-08 12:18:33,210 INFO  L263        TraceCheckUtils]: 17: Hoare triple {1256#(and (= 0 task_~t.offset) (= 0 task_~t.base))} call #t~ret26 := size(~t.base, ~t.offset); {1246#true} is VALID
[2020-07-08 12:18:33,210 INFO  L280        TraceCheckUtils]: 18: Hoare triple {1246#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1291#(and (or (= 0 size_~t.offset) (= |size_#in~t.offset| size_~t.offset)) (= |size_#in~t.base| size_~t.base))} is VALID
[2020-07-08 12:18:33,211 INFO  L280        TraceCheckUtils]: 19: Hoare triple {1291#(and (or (= 0 size_~t.offset) (= |size_#in~t.offset| size_~t.offset)) (= |size_#in~t.base| size_~t.base))} assume !(~t.base == 0 && ~t.offset == 0);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 4); {1292#(or (and (= |size_#in~t.offset| size_~t.offset) (not (= 0 size_~t.offset))) (not (= 0 |size_#in~t.base|)))} is VALID
[2020-07-08 12:18:33,211 INFO  L263        TraceCheckUtils]: 20: Hoare triple {1292#(or (and (= |size_#in~t.offset| size_~t.offset) (not (= 0 size_~t.offset))) (not (= 0 |size_#in~t.base|)))} call #t~ret22 := size(#t~mem21.base, #t~mem21.offset); {1246#true} is VALID
[2020-07-08 12:18:33,212 INFO  L280        TraceCheckUtils]: 21: Hoare triple {1246#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1246#true} is VALID
[2020-07-08 12:18:33,212 INFO  L280        TraceCheckUtils]: 22: Hoare triple {1246#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1246#true} is VALID
[2020-07-08 12:18:33,212 INFO  L280        TraceCheckUtils]: 23: Hoare triple {1246#true} assume true; {1246#true} is VALID
[2020-07-08 12:18:33,213 INFO  L275        TraceCheckUtils]: 24: Hoare quadruple {1246#true} {1292#(or (and (= |size_#in~t.offset| size_~t.offset) (not (= 0 size_~t.offset))) (not (= 0 |size_#in~t.base|)))} #163#return; {1292#(or (and (= |size_#in~t.offset| size_~t.offset) (not (= 0 size_~t.offset))) (not (= 0 |size_#in~t.base|)))} is VALID
[2020-07-08 12:18:33,214 INFO  L280        TraceCheckUtils]: 25: Hoare triple {1292#(or (and (= |size_#in~t.offset| size_~t.offset) (not (= 0 size_~t.offset))) (not (= 0 |size_#in~t.base|)))} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~t.base, 8 + ~t.offset, 4); {1297#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID
[2020-07-08 12:18:33,214 INFO  L263        TraceCheckUtils]: 26: Hoare triple {1297#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} call #t~ret24 := size(#t~mem23.base, #t~mem23.offset); {1246#true} is VALID
[2020-07-08 12:18:33,215 INFO  L280        TraceCheckUtils]: 27: Hoare triple {1246#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1246#true} is VALID
[2020-07-08 12:18:33,215 INFO  L280        TraceCheckUtils]: 28: Hoare triple {1246#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1246#true} is VALID
[2020-07-08 12:18:33,215 INFO  L280        TraceCheckUtils]: 29: Hoare triple {1246#true} assume true; {1246#true} is VALID
[2020-07-08 12:18:33,217 INFO  L275        TraceCheckUtils]: 30: Hoare quadruple {1246#true} {1297#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #165#return; {1297#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID
[2020-07-08 12:18:33,218 INFO  L280        TraceCheckUtils]: 31: Hoare triple {1297#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume -2147483648 <= #t~ret24 && #t~ret24 <= 2147483647;#res := 1 + (#t~ret22 + #t~ret24);havoc #t~mem21.base, #t~mem21.offset;havoc #t~mem23.base, #t~mem23.offset;havoc #t~ret24;havoc #t~ret22; {1297#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID
[2020-07-08 12:18:33,218 INFO  L280        TraceCheckUtils]: 32: Hoare triple {1297#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume true; {1297#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID
[2020-07-08 12:18:33,221 INFO  L275        TraceCheckUtils]: 33: Hoare quadruple {1297#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} {1256#(and (= 0 task_~t.offset) (= 0 task_~t.base))} #139#return; {1247#false} is VALID
[2020-07-08 12:18:33,222 INFO  L280        TraceCheckUtils]: 34: Hoare triple {1247#false} assume -2147483648 <= #t~ret26 && #t~ret26 <= 2147483647;~n~1 := #t~ret26;havoc #t~ret26; {1247#false} is VALID
[2020-07-08 12:18:33,222 INFO  L263        TraceCheckUtils]: 35: Hoare triple {1247#false} call assume_abort_if_not((if 0 != ~n~1 then 1 else 0)); {1246#true} is VALID
[2020-07-08 12:18:33,222 INFO  L280        TraceCheckUtils]: 36: Hoare triple {1246#true} ~cond := #in~cond; {1246#true} is VALID
[2020-07-08 12:18:33,223 INFO  L280        TraceCheckUtils]: 37: Hoare triple {1246#true} assume !(0 == ~cond); {1246#true} is VALID
[2020-07-08 12:18:33,223 INFO  L280        TraceCheckUtils]: 38: Hoare triple {1246#true} assume true; {1246#true} is VALID
[2020-07-08 12:18:33,223 INFO  L275        TraceCheckUtils]: 39: Hoare quadruple {1246#true} {1247#false} #141#return; {1247#false} is VALID
[2020-07-08 12:18:33,223 INFO  L280        TraceCheckUtils]: 40: Hoare triple {1247#false} call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(4 * ~n~1); {1247#false} is VALID
[2020-07-08 12:18:33,224 INFO  L263        TraceCheckUtils]: 41: Hoare triple {1247#false} call #Ultimate.meminit(#t~malloc27.base, #t~malloc27.offset, ~n~1, 4, 4 * ~n~1); {1302#(= |#memory_int| |old(#memory_int)|)} is VALID
[2020-07-08 12:18:33,224 INFO  L280        TraceCheckUtils]: 42: Hoare triple {1302#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1246#true} is VALID
[2020-07-08 12:18:33,224 INFO  L280        TraceCheckUtils]: 43: Hoare triple {1246#true} assume true; {1246#true} is VALID
[2020-07-08 12:18:33,224 INFO  L275        TraceCheckUtils]: 44: Hoare quadruple {1246#true} {1247#false} #143#return; {1247#false} is VALID
[2020-07-08 12:18:33,225 INFO  L280        TraceCheckUtils]: 45: Hoare triple {1247#false} ~x~0.base, ~x~0.offset := #t~malloc27.base, #t~malloc27.offset; {1247#false} is VALID
[2020-07-08 12:18:33,225 INFO  L263        TraceCheckUtils]: 46: Hoare triple {1247#false} call #t~ret28 := tree_inorder(~t.base, ~t.offset, ~x~0.base, ~x~0.offset, ~n~1); {1303#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID
[2020-07-08 12:18:33,225 INFO  L280        TraceCheckUtils]: 47: Hoare triple {1303#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {1246#true} is VALID
[2020-07-08 12:18:33,225 INFO  L280        TraceCheckUtils]: 48: Hoare triple {1246#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {1246#true} is VALID
[2020-07-08 12:18:33,225 INFO  L280        TraceCheckUtils]: 49: Hoare triple {1246#true} assume true; {1246#true} is VALID
[2020-07-08 12:18:33,226 INFO  L275        TraceCheckUtils]: 50: Hoare quadruple {1246#true} {1247#false} #145#return; {1247#false} is VALID
[2020-07-08 12:18:33,226 INFO  L280        TraceCheckUtils]: 51: Hoare triple {1247#false} assume -2147483648 <= #t~ret28 && #t~ret28 <= 2147483647;havoc #t~ret28;call #t~mem29 := read~int(~x~0.base, ~x~0.offset, 4); {1247#false} is VALID
[2020-07-08 12:18:33,226 INFO  L263        TraceCheckUtils]: 52: Hoare triple {1247#false} call __VERIFIER_assert((if ~a~1 == #t~mem29 then 1 else 0)); {1247#false} is VALID
[2020-07-08 12:18:33,226 INFO  L280        TraceCheckUtils]: 53: Hoare triple {1247#false} ~cond := #in~cond; {1247#false} is VALID
[2020-07-08 12:18:33,227 INFO  L280        TraceCheckUtils]: 54: Hoare triple {1247#false} assume 0 == ~cond; {1247#false} is VALID
[2020-07-08 12:18:33,227 INFO  L280        TraceCheckUtils]: 55: Hoare triple {1247#false} assume !false; {1247#false} is VALID
[2020-07-08 12:18:33,233 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2020-07-08 12:18:33,233 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379878350]
[2020-07-08 12:18:33,233 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404871057]
[2020-07-08 12:18:33,234 INFO  L94    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-07-08 12:18:33,324 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 12:18:33,327 INFO  L264         TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 25 conjunts are in the unsatisfiable core
[2020-07-08 12:18:33,346 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 12:18:33,353 INFO  L287         TraceCheckSpWp]: Computing forward predicates...
[2020-07-08 12:18:33,533 INFO  L263        TraceCheckUtils]: 0: Hoare triple {1246#true} call ULTIMATE.init(); {1246#true} is VALID
[2020-07-08 12:18:33,533 INFO  L280        TraceCheckUtils]: 1: Hoare triple {1246#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1246#true} is VALID
[2020-07-08 12:18:33,533 INFO  L280        TraceCheckUtils]: 2: Hoare triple {1246#true} assume true; {1246#true} is VALID
[2020-07-08 12:18:33,534 INFO  L275        TraceCheckUtils]: 3: Hoare quadruple {1246#true} {1246#true} #167#return; {1246#true} is VALID
[2020-07-08 12:18:33,534 INFO  L263        TraceCheckUtils]: 4: Hoare triple {1246#true} call #t~ret39 := main(); {1246#true} is VALID
[2020-07-08 12:18:33,534 INFO  L263        TraceCheckUtils]: 5: Hoare triple {1246#true} call #t~ret38.base, #t~ret38.offset := nondet_tree(); {1246#true} is VALID
[2020-07-08 12:18:33,535 INFO  L280        TraceCheckUtils]: 6: Hoare triple {1246#true} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {1290#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} is VALID
[2020-07-08 12:18:33,536 INFO  L280        TraceCheckUtils]: 7: Hoare triple {1290#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} assume true; {1290#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} is VALID
[2020-07-08 12:18:33,537 INFO  L275        TraceCheckUtils]: 8: Hoare quadruple {1290#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} {1246#true} #123#return; {1254#(and (= 0 |main_#t~ret38.offset|) (= 0 |main_#t~ret38.base|))} is VALID
[2020-07-08 12:18:33,539 INFO  L263        TraceCheckUtils]: 9: Hoare triple {1254#(and (= 0 |main_#t~ret38.offset|) (= 0 |main_#t~ret38.base|))} call task(#t~ret38.base, #t~ret38.offset); {1255#(and (= 0 |task_#in~t.offset|) (= |task_#in~t.base| 0))} is VALID
[2020-07-08 12:18:33,541 INFO  L280        TraceCheckUtils]: 10: Hoare triple {1255#(and (= 0 |task_#in~t.offset|) (= |task_#in~t.base| 0))} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1256#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID
[2020-07-08 12:18:33,541 INFO  L263        TraceCheckUtils]: 11: Hoare triple {1256#(and (= 0 task_~t.offset) (= 0 task_~t.base))} call #t~ret25 := min(~t.base, ~t.offset); {1246#true} is VALID
[2020-07-08 12:18:33,541 INFO  L280        TraceCheckUtils]: 12: Hoare triple {1246#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {1246#true} is VALID
[2020-07-08 12:18:33,541 INFO  L280        TraceCheckUtils]: 13: Hoare triple {1246#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {1246#true} is VALID
[2020-07-08 12:18:33,542 INFO  L280        TraceCheckUtils]: 14: Hoare triple {1246#true} assume true; {1246#true} is VALID
[2020-07-08 12:18:33,544 INFO  L275        TraceCheckUtils]: 15: Hoare quadruple {1246#true} {1256#(and (= 0 task_~t.offset) (= 0 task_~t.base))} #137#return; {1256#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID
[2020-07-08 12:18:33,548 INFO  L280        TraceCheckUtils]: 16: Hoare triple {1256#(and (= 0 task_~t.offset) (= 0 task_~t.base))} assume -2147483648 <= #t~ret25 && #t~ret25 <= 2147483647;~a~1 := #t~ret25;havoc #t~ret25;call ~#b~1.base, ~#b~1.offset := #Ultimate.allocOnStack(4); {1256#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID
[2020-07-08 12:18:33,548 INFO  L263        TraceCheckUtils]: 17: Hoare triple {1256#(and (= 0 task_~t.offset) (= 0 task_~t.base))} call #t~ret26 := size(~t.base, ~t.offset); {1246#true} is VALID
[2020-07-08 12:18:33,551 INFO  L280        TraceCheckUtils]: 18: Hoare triple {1246#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1361#(and (= |size_#in~t.base| size_~t.base) (= |size_#in~t.offset| size_~t.offset))} is VALID
[2020-07-08 12:18:33,554 INFO  L280        TraceCheckUtils]: 19: Hoare triple {1361#(and (= |size_#in~t.base| size_~t.base) (= |size_#in~t.offset| size_~t.offset))} assume !(~t.base == 0 && ~t.offset == 0);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 4); {1297#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID
[2020-07-08 12:18:33,554 INFO  L263        TraceCheckUtils]: 20: Hoare triple {1297#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} call #t~ret22 := size(#t~mem21.base, #t~mem21.offset); {1246#true} is VALID
[2020-07-08 12:18:33,555 INFO  L280        TraceCheckUtils]: 21: Hoare triple {1246#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1246#true} is VALID
[2020-07-08 12:18:33,555 INFO  L280        TraceCheckUtils]: 22: Hoare triple {1246#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1246#true} is VALID
[2020-07-08 12:18:33,556 INFO  L280        TraceCheckUtils]: 23: Hoare triple {1246#true} assume true; {1246#true} is VALID
[2020-07-08 12:18:33,558 INFO  L275        TraceCheckUtils]: 24: Hoare quadruple {1246#true} {1297#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #163#return; {1297#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID
[2020-07-08 12:18:33,558 INFO  L280        TraceCheckUtils]: 25: Hoare triple {1297#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~t.base, 8 + ~t.offset, 4); {1297#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID
[2020-07-08 12:18:33,558 INFO  L263        TraceCheckUtils]: 26: Hoare triple {1297#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} call #t~ret24 := size(#t~mem23.base, #t~mem23.offset); {1246#true} is VALID
[2020-07-08 12:18:33,559 INFO  L280        TraceCheckUtils]: 27: Hoare triple {1246#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1246#true} is VALID
[2020-07-08 12:18:33,559 INFO  L280        TraceCheckUtils]: 28: Hoare triple {1246#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1246#true} is VALID
[2020-07-08 12:18:33,559 INFO  L280        TraceCheckUtils]: 29: Hoare triple {1246#true} assume true; {1246#true} is VALID
[2020-07-08 12:18:33,561 INFO  L275        TraceCheckUtils]: 30: Hoare quadruple {1246#true} {1297#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #165#return; {1297#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID
[2020-07-08 12:18:33,561 INFO  L280        TraceCheckUtils]: 31: Hoare triple {1297#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume -2147483648 <= #t~ret24 && #t~ret24 <= 2147483647;#res := 1 + (#t~ret22 + #t~ret24);havoc #t~mem21.base, #t~mem21.offset;havoc #t~mem23.base, #t~mem23.offset;havoc #t~ret24;havoc #t~ret22; {1297#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID
[2020-07-08 12:18:33,562 INFO  L280        TraceCheckUtils]: 32: Hoare triple {1297#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume true; {1297#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID
[2020-07-08 12:18:33,563 INFO  L275        TraceCheckUtils]: 33: Hoare quadruple {1297#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} {1256#(and (= 0 task_~t.offset) (= 0 task_~t.base))} #139#return; {1247#false} is VALID
[2020-07-08 12:18:33,563 INFO  L280        TraceCheckUtils]: 34: Hoare triple {1247#false} assume -2147483648 <= #t~ret26 && #t~ret26 <= 2147483647;~n~1 := #t~ret26;havoc #t~ret26; {1247#false} is VALID
[2020-07-08 12:18:33,564 INFO  L263        TraceCheckUtils]: 35: Hoare triple {1247#false} call assume_abort_if_not((if 0 != ~n~1 then 1 else 0)); {1247#false} is VALID
[2020-07-08 12:18:33,564 INFO  L280        TraceCheckUtils]: 36: Hoare triple {1247#false} ~cond := #in~cond; {1247#false} is VALID
[2020-07-08 12:18:33,564 INFO  L280        TraceCheckUtils]: 37: Hoare triple {1247#false} assume !(0 == ~cond); {1247#false} is VALID
[2020-07-08 12:18:33,564 INFO  L280        TraceCheckUtils]: 38: Hoare triple {1247#false} assume true; {1247#false} is VALID
[2020-07-08 12:18:33,564 INFO  L275        TraceCheckUtils]: 39: Hoare quadruple {1247#false} {1247#false} #141#return; {1247#false} is VALID
[2020-07-08 12:18:33,565 INFO  L280        TraceCheckUtils]: 40: Hoare triple {1247#false} call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(4 * ~n~1); {1247#false} is VALID
[2020-07-08 12:18:33,565 INFO  L263        TraceCheckUtils]: 41: Hoare triple {1247#false} call #Ultimate.meminit(#t~malloc27.base, #t~malloc27.offset, ~n~1, 4, 4 * ~n~1); {1247#false} is VALID
[2020-07-08 12:18:33,565 INFO  L280        TraceCheckUtils]: 42: Hoare triple {1247#false} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1247#false} is VALID
[2020-07-08 12:18:33,565 INFO  L280        TraceCheckUtils]: 43: Hoare triple {1247#false} assume true; {1247#false} is VALID
[2020-07-08 12:18:33,566 INFO  L275        TraceCheckUtils]: 44: Hoare quadruple {1247#false} {1247#false} #143#return; {1247#false} is VALID
[2020-07-08 12:18:33,566 INFO  L280        TraceCheckUtils]: 45: Hoare triple {1247#false} ~x~0.base, ~x~0.offset := #t~malloc27.base, #t~malloc27.offset; {1247#false} is VALID
[2020-07-08 12:18:33,566 INFO  L263        TraceCheckUtils]: 46: Hoare triple {1247#false} call #t~ret28 := tree_inorder(~t.base, ~t.offset, ~x~0.base, ~x~0.offset, ~n~1); {1247#false} is VALID
[2020-07-08 12:18:33,566 INFO  L280        TraceCheckUtils]: 47: Hoare triple {1247#false} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {1247#false} is VALID
[2020-07-08 12:18:33,567 INFO  L280        TraceCheckUtils]: 48: Hoare triple {1247#false} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {1247#false} is VALID
[2020-07-08 12:18:33,567 INFO  L280        TraceCheckUtils]: 49: Hoare triple {1247#false} assume true; {1247#false} is VALID
[2020-07-08 12:18:33,567 INFO  L275        TraceCheckUtils]: 50: Hoare quadruple {1247#false} {1247#false} #145#return; {1247#false} is VALID
[2020-07-08 12:18:33,570 INFO  L280        TraceCheckUtils]: 51: Hoare triple {1247#false} assume -2147483648 <= #t~ret28 && #t~ret28 <= 2147483647;havoc #t~ret28;call #t~mem29 := read~int(~x~0.base, ~x~0.offset, 4); {1247#false} is VALID
[2020-07-08 12:18:33,570 INFO  L263        TraceCheckUtils]: 52: Hoare triple {1247#false} call __VERIFIER_assert((if ~a~1 == #t~mem29 then 1 else 0)); {1247#false} is VALID
[2020-07-08 12:18:33,570 INFO  L280        TraceCheckUtils]: 53: Hoare triple {1247#false} ~cond := #in~cond; {1247#false} is VALID
[2020-07-08 12:18:33,571 INFO  L280        TraceCheckUtils]: 54: Hoare triple {1247#false} assume 0 == ~cond; {1247#false} is VALID
[2020-07-08 12:18:33,571 INFO  L280        TraceCheckUtils]: 55: Hoare triple {1247#false} assume !false; {1247#false} is VALID
[2020-07-08 12:18:33,577 INFO  L134       CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2020-07-08 12:18:33,577 INFO  L220   FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2020-07-08 12:18:33,577 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 14
[2020-07-08 12:18:33,578 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248140772]
[2020-07-08 12:18:33,579 INFO  L78                 Accepts]: Start accepts. Automaton has 14 states. Word has length 56
[2020-07-08 12:18:33,588 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2020-07-08 12:18:33,588 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states.
[2020-07-08 12:18:33,668 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-08 12:18:33,669 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 14 states
[2020-07-08 12:18:33,669 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-07-08 12:18:33,669 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2020-07-08 12:18:33,670 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182
[2020-07-08 12:18:33,670 INFO  L87              Difference]: Start difference. First operand 89 states and 112 transitions. Second operand 14 states.
[2020-07-08 12:18:37,082 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-08 12:18:37,082 INFO  L93              Difference]: Finished difference Result 161 states and 206 transitions.
[2020-07-08 12:18:37,082 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2020-07-08 12:18:37,082 INFO  L78                 Accepts]: Start accepts. Automaton has 14 states. Word has length 56
[2020-07-08 12:18:37,083 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-08 12:18:37,083 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 14 states.
[2020-07-08 12:18:37,089 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 202 transitions.
[2020-07-08 12:18:37,089 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 14 states.
[2020-07-08 12:18:37,101 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 202 transitions.
[2020-07-08 12:18:37,102 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 202 transitions.
[2020-07-08 12:18:37,434 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 202 edges. 202 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-08 12:18:37,439 INFO  L225             Difference]: With dead ends: 161
[2020-07-08 12:18:37,439 INFO  L226             Difference]: Without dead ends: 94
[2020-07-08 12:18:37,441 INFO  L675         BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462
[2020-07-08 12:18:37,441 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 94 states.
[2020-07-08 12:18:37,518 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91.
[2020-07-08 12:18:37,518 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-08 12:18:37,518 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand 91 states.
[2020-07-08 12:18:37,519 INFO  L74              IsIncluded]: Start isIncluded. First operand 94 states. Second operand 91 states.
[2020-07-08 12:18:37,519 INFO  L87              Difference]: Start difference. First operand 94 states. Second operand 91 states.
[2020-07-08 12:18:37,525 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-08 12:18:37,525 INFO  L93              Difference]: Finished difference Result 94 states and 121 transitions.
[2020-07-08 12:18:37,525 INFO  L276                IsEmpty]: Start isEmpty. Operand 94 states and 121 transitions.
[2020-07-08 12:18:37,526 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-08 12:18:37,526 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2020-07-08 12:18:37,526 INFO  L74              IsIncluded]: Start isIncluded. First operand 91 states. Second operand 94 states.
[2020-07-08 12:18:37,527 INFO  L87              Difference]: Start difference. First operand 91 states. Second operand 94 states.
[2020-07-08 12:18:37,532 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-08 12:18:37,532 INFO  L93              Difference]: Finished difference Result 94 states and 121 transitions.
[2020-07-08 12:18:37,532 INFO  L276                IsEmpty]: Start isEmpty. Operand 94 states and 121 transitions.
[2020-07-08 12:18:37,533 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-08 12:18:37,533 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2020-07-08 12:18:37,533 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2020-07-08 12:18:37,534 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-08 12:18:37,534 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 91 states.
[2020-07-08 12:18:37,538 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 115 transitions.
[2020-07-08 12:18:37,539 INFO  L78                 Accepts]: Start accepts. Automaton has 91 states and 115 transitions. Word has length 56
[2020-07-08 12:18:37,539 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-07-08 12:18:37,539 INFO  L479      AbstractCegarLoop]: Abstraction has 91 states and 115 transitions.
[2020-07-08 12:18:37,539 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 14 states.
[2020-07-08 12:18:37,540 INFO  L276                IsEmpty]: Start isEmpty. Operand 91 states and 115 transitions.
[2020-07-08 12:18:37,540 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 67
[2020-07-08 12:18:37,541 INFO  L414         BasicCegarLoop]: Found error trace
[2020-07-08 12:18:37,541 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-07-08 12:18:37,755 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2
[2020-07-08 12:18:37,755 INFO  L427      AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-08 12:18:37,756 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-07-08 12:18:37,756 INFO  L82        PathProgramCache]: Analyzing trace with hash 487198237, now seen corresponding path program 1 times
[2020-07-08 12:18:37,757 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-07-08 12:18:37,757 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110477519]
[2020-07-08 12:18:37,758 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-08 12:18:37,788 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 12:18:37,888 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 12:18:37,892 INFO  L280        TraceCheckUtils]: 0: Hoare triple {2083#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2031#true} is VALID
[2020-07-08 12:18:37,892 INFO  L280        TraceCheckUtils]: 1: Hoare triple {2031#true} assume true; {2031#true} is VALID
[2020-07-08 12:18:37,893 INFO  L275        TraceCheckUtils]: 2: Hoare quadruple {2031#true} {2031#true} #167#return; {2031#true} is VALID
[2020-07-08 12:18:37,923 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 12:18:37,985 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 12:18:37,994 INFO  L280        TraceCheckUtils]: 0: Hoare triple {2084#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {2031#true} is VALID
[2020-07-08 12:18:37,994 INFO  L280        TraceCheckUtils]: 1: Hoare triple {2031#true} assume true; {2031#true} is VALID
[2020-07-08 12:18:37,995 INFO  L275        TraceCheckUtils]: 2: Hoare quadruple {2031#true} {2085#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} #133#return; {2085#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID
[2020-07-08 12:18:37,998 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 12:18:38,003 INFO  L280        TraceCheckUtils]: 0: Hoare triple {2084#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {2031#true} is VALID
[2020-07-08 12:18:38,004 INFO  L280        TraceCheckUtils]: 1: Hoare triple {2031#true} assume true; {2031#true} is VALID
[2020-07-08 12:18:38,005 INFO  L275        TraceCheckUtils]: 2: Hoare quadruple {2031#true} {2085#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} #135#return; {2085#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID
[2020-07-08 12:18:38,007 INFO  L280        TraceCheckUtils]: 0: Hoare triple {2084#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume !(0 != #t~nondet1 % 256);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~n~0.base, ~n~0.offset := #t~malloc2.base, #t~malloc2.offset;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~n~0.base, ~n~0.offset, 4);havoc #t~nondet3; {2085#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID
[2020-07-08 12:18:38,008 INFO  L263        TraceCheckUtils]: 1: Hoare triple {2085#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} call #t~ret4.base, #t~ret4.offset := nondet_tree(); {2084#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID
[2020-07-08 12:18:38,009 INFO  L280        TraceCheckUtils]: 2: Hoare triple {2084#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {2031#true} is VALID
[2020-07-08 12:18:38,009 INFO  L280        TraceCheckUtils]: 3: Hoare triple {2031#true} assume true; {2031#true} is VALID
[2020-07-08 12:18:38,010 INFO  L275        TraceCheckUtils]: 4: Hoare quadruple {2031#true} {2085#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} #133#return; {2085#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID
[2020-07-08 12:18:38,011 INFO  L280        TraceCheckUtils]: 5: Hoare triple {2085#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} call write~$Pointer$(#t~ret4.base, #t~ret4.offset, ~n~0.base, 4 + ~n~0.offset, 4);havoc #t~ret4.base, #t~ret4.offset; {2085#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID
[2020-07-08 12:18:38,012 INFO  L263        TraceCheckUtils]: 6: Hoare triple {2085#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} call #t~ret5.base, #t~ret5.offset := nondet_tree(); {2084#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID
[2020-07-08 12:18:38,012 INFO  L280        TraceCheckUtils]: 7: Hoare triple {2084#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {2031#true} is VALID
[2020-07-08 12:18:38,012 INFO  L280        TraceCheckUtils]: 8: Hoare triple {2031#true} assume true; {2031#true} is VALID
[2020-07-08 12:18:38,013 INFO  L275        TraceCheckUtils]: 9: Hoare quadruple {2031#true} {2085#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} #135#return; {2085#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID
[2020-07-08 12:18:38,014 INFO  L280        TraceCheckUtils]: 10: Hoare triple {2085#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~n~0.base, 8 + ~n~0.offset, 4);havoc #t~ret5.base, #t~ret5.offset;#res.base, #res.offset := ~n~0.base, ~n~0.offset; {2092#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} is VALID
[2020-07-08 12:18:38,015 INFO  L280        TraceCheckUtils]: 11: Hoare triple {2092#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} assume true; {2092#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} is VALID
[2020-07-08 12:18:38,016 INFO  L275        TraceCheckUtils]: 12: Hoare quadruple {2092#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} {2031#true} #123#return; {2049#(not (= 0 |main_#t~ret38.base|))} is VALID
[2020-07-08 12:18:38,018 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 12:18:38,052 INFO  L280        TraceCheckUtils]: 0: Hoare triple {2031#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2093#(= min_~n.base |min_#in~n.base|)} is VALID
[2020-07-08 12:18:38,053 INFO  L280        TraceCheckUtils]: 1: Hoare triple {2093#(= min_~n.base |min_#in~n.base|)} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2094#(= 0 |min_#in~n.base|)} is VALID
[2020-07-08 12:18:38,053 INFO  L280        TraceCheckUtils]: 2: Hoare triple {2094#(= 0 |min_#in~n.base|)} assume true; {2094#(= 0 |min_#in~n.base|)} is VALID
[2020-07-08 12:18:38,054 INFO  L275        TraceCheckUtils]: 3: Hoare quadruple {2094#(= 0 |min_#in~n.base|)} {2051#(not (= 0 task_~t.base))} #137#return; {2032#false} is VALID
[2020-07-08 12:18:38,058 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 12:18:38,073 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 12:18:38,077 INFO  L280        TraceCheckUtils]: 0: Hoare triple {2031#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2031#true} is VALID
[2020-07-08 12:18:38,078 INFO  L280        TraceCheckUtils]: 1: Hoare triple {2031#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2031#true} is VALID
[2020-07-08 12:18:38,078 INFO  L280        TraceCheckUtils]: 2: Hoare triple {2031#true} assume true; {2031#true} is VALID
[2020-07-08 12:18:38,078 INFO  L275        TraceCheckUtils]: 3: Hoare quadruple {2031#true} {2031#true} #163#return; {2031#true} is VALID
[2020-07-08 12:18:38,079 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 12:18:38,089 INFO  L280        TraceCheckUtils]: 0: Hoare triple {2031#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2031#true} is VALID
[2020-07-08 12:18:38,089 INFO  L280        TraceCheckUtils]: 1: Hoare triple {2031#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2031#true} is VALID
[2020-07-08 12:18:38,090 INFO  L280        TraceCheckUtils]: 2: Hoare triple {2031#true} assume true; {2031#true} is VALID
[2020-07-08 12:18:38,090 INFO  L275        TraceCheckUtils]: 3: Hoare quadruple {2031#true} {2031#true} #165#return; {2031#true} is VALID
[2020-07-08 12:18:38,090 INFO  L280        TraceCheckUtils]: 0: Hoare triple {2031#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2031#true} is VALID
[2020-07-08 12:18:38,091 INFO  L280        TraceCheckUtils]: 1: Hoare triple {2031#true} assume !(~t.base == 0 && ~t.offset == 0);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 4); {2031#true} is VALID
[2020-07-08 12:18:38,091 INFO  L263        TraceCheckUtils]: 2: Hoare triple {2031#true} call #t~ret22 := size(#t~mem21.base, #t~mem21.offset); {2031#true} is VALID
[2020-07-08 12:18:38,091 INFO  L280        TraceCheckUtils]: 3: Hoare triple {2031#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2031#true} is VALID
[2020-07-08 12:18:38,091 INFO  L280        TraceCheckUtils]: 4: Hoare triple {2031#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2031#true} is VALID
[2020-07-08 12:18:38,091 INFO  L280        TraceCheckUtils]: 5: Hoare triple {2031#true} assume true; {2031#true} is VALID
[2020-07-08 12:18:38,092 INFO  L275        TraceCheckUtils]: 6: Hoare quadruple {2031#true} {2031#true} #163#return; {2031#true} is VALID
[2020-07-08 12:18:38,092 INFO  L280        TraceCheckUtils]: 7: Hoare triple {2031#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~t.base, 8 + ~t.offset, 4); {2031#true} is VALID
[2020-07-08 12:18:38,092 INFO  L263        TraceCheckUtils]: 8: Hoare triple {2031#true} call #t~ret24 := size(#t~mem23.base, #t~mem23.offset); {2031#true} is VALID
[2020-07-08 12:18:38,093 INFO  L280        TraceCheckUtils]: 9: Hoare triple {2031#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2031#true} is VALID
[2020-07-08 12:18:38,093 INFO  L280        TraceCheckUtils]: 10: Hoare triple {2031#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2031#true} is VALID
[2020-07-08 12:18:38,093 INFO  L280        TraceCheckUtils]: 11: Hoare triple {2031#true} assume true; {2031#true} is VALID
[2020-07-08 12:18:38,093 INFO  L275        TraceCheckUtils]: 12: Hoare quadruple {2031#true} {2031#true} #165#return; {2031#true} is VALID
[2020-07-08 12:18:38,094 INFO  L280        TraceCheckUtils]: 13: Hoare triple {2031#true} assume -2147483648 <= #t~ret24 && #t~ret24 <= 2147483647;#res := 1 + (#t~ret22 + #t~ret24);havoc #t~mem21.base, #t~mem21.offset;havoc #t~mem23.base, #t~mem23.offset;havoc #t~ret24;havoc #t~ret22; {2031#true} is VALID
[2020-07-08 12:18:38,094 INFO  L280        TraceCheckUtils]: 14: Hoare triple {2031#true} assume true; {2031#true} is VALID
[2020-07-08 12:18:38,095 INFO  L275        TraceCheckUtils]: 15: Hoare quadruple {2031#true} {2032#false} #139#return; {2032#false} is VALID
[2020-07-08 12:18:38,097 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 12:18:38,101 INFO  L280        TraceCheckUtils]: 0: Hoare triple {2031#true} ~cond := #in~cond; {2031#true} is VALID
[2020-07-08 12:18:38,101 INFO  L280        TraceCheckUtils]: 1: Hoare triple {2031#true} assume !(0 == ~cond); {2031#true} is VALID
[2020-07-08 12:18:38,101 INFO  L280        TraceCheckUtils]: 2: Hoare triple {2031#true} assume true; {2031#true} is VALID
[2020-07-08 12:18:38,102 INFO  L275        TraceCheckUtils]: 3: Hoare quadruple {2031#true} {2032#false} #141#return; {2032#false} is VALID
[2020-07-08 12:18:38,116 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 12:18:38,119 INFO  L280        TraceCheckUtils]: 0: Hoare triple {2103#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2031#true} is VALID
[2020-07-08 12:18:38,119 INFO  L280        TraceCheckUtils]: 1: Hoare triple {2031#true} assume true; {2031#true} is VALID
[2020-07-08 12:18:38,120 INFO  L275        TraceCheckUtils]: 2: Hoare quadruple {2031#true} {2032#false} #143#return; {2032#false} is VALID
[2020-07-08 12:18:38,148 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 12:18:38,152 INFO  L280        TraceCheckUtils]: 0: Hoare triple {2104#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {2031#true} is VALID
[2020-07-08 12:18:38,153 INFO  L280        TraceCheckUtils]: 1: Hoare triple {2031#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {2031#true} is VALID
[2020-07-08 12:18:38,153 INFO  L280        TraceCheckUtils]: 2: Hoare triple {2031#true} assume true; {2031#true} is VALID
[2020-07-08 12:18:38,154 INFO  L275        TraceCheckUtils]: 3: Hoare quadruple {2031#true} {2032#false} #145#return; {2032#false} is VALID
[2020-07-08 12:18:38,155 INFO  L263        TraceCheckUtils]: 0: Hoare triple {2031#true} call ULTIMATE.init(); {2083#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID
[2020-07-08 12:18:38,155 INFO  L280        TraceCheckUtils]: 1: Hoare triple {2083#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2031#true} is VALID
[2020-07-08 12:18:38,156 INFO  L280        TraceCheckUtils]: 2: Hoare triple {2031#true} assume true; {2031#true} is VALID
[2020-07-08 12:18:38,156 INFO  L275        TraceCheckUtils]: 3: Hoare quadruple {2031#true} {2031#true} #167#return; {2031#true} is VALID
[2020-07-08 12:18:38,156 INFO  L263        TraceCheckUtils]: 4: Hoare triple {2031#true} call #t~ret39 := main(); {2031#true} is VALID
[2020-07-08 12:18:38,158 INFO  L263        TraceCheckUtils]: 5: Hoare triple {2031#true} call #t~ret38.base, #t~ret38.offset := nondet_tree(); {2084#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID
[2020-07-08 12:18:38,161 INFO  L280        TraceCheckUtils]: 6: Hoare triple {2084#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume !(0 != #t~nondet1 % 256);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~n~0.base, ~n~0.offset := #t~malloc2.base, #t~malloc2.offset;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~n~0.base, ~n~0.offset, 4);havoc #t~nondet3; {2085#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID
[2020-07-08 12:18:38,162 INFO  L263        TraceCheckUtils]: 7: Hoare triple {2085#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} call #t~ret4.base, #t~ret4.offset := nondet_tree(); {2084#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID
[2020-07-08 12:18:38,163 INFO  L280        TraceCheckUtils]: 8: Hoare triple {2084#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {2031#true} is VALID
[2020-07-08 12:18:38,163 INFO  L280        TraceCheckUtils]: 9: Hoare triple {2031#true} assume true; {2031#true} is VALID
[2020-07-08 12:18:38,164 INFO  L275        TraceCheckUtils]: 10: Hoare quadruple {2031#true} {2085#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} #133#return; {2085#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID
[2020-07-08 12:18:38,164 INFO  L280        TraceCheckUtils]: 11: Hoare triple {2085#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} call write~$Pointer$(#t~ret4.base, #t~ret4.offset, ~n~0.base, 4 + ~n~0.offset, 4);havoc #t~ret4.base, #t~ret4.offset; {2085#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID
[2020-07-08 12:18:38,166 INFO  L263        TraceCheckUtils]: 12: Hoare triple {2085#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} call #t~ret5.base, #t~ret5.offset := nondet_tree(); {2084#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID
[2020-07-08 12:18:38,166 INFO  L280        TraceCheckUtils]: 13: Hoare triple {2084#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {2031#true} is VALID
[2020-07-08 12:18:38,166 INFO  L280        TraceCheckUtils]: 14: Hoare triple {2031#true} assume true; {2031#true} is VALID
[2020-07-08 12:18:38,167 INFO  L275        TraceCheckUtils]: 15: Hoare quadruple {2031#true} {2085#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} #135#return; {2085#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID
[2020-07-08 12:18:38,168 INFO  L280        TraceCheckUtils]: 16: Hoare triple {2085#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~n~0.base, 8 + ~n~0.offset, 4);havoc #t~ret5.base, #t~ret5.offset;#res.base, #res.offset := ~n~0.base, ~n~0.offset; {2092#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} is VALID
[2020-07-08 12:18:38,169 INFO  L280        TraceCheckUtils]: 17: Hoare triple {2092#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} assume true; {2092#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} is VALID
[2020-07-08 12:18:38,170 INFO  L275        TraceCheckUtils]: 18: Hoare quadruple {2092#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} {2031#true} #123#return; {2049#(not (= 0 |main_#t~ret38.base|))} is VALID
[2020-07-08 12:18:38,171 INFO  L263        TraceCheckUtils]: 19: Hoare triple {2049#(not (= 0 |main_#t~ret38.base|))} call task(#t~ret38.base, #t~ret38.offset); {2050#(not (= |task_#in~t.base| 0))} is VALID
[2020-07-08 12:18:38,172 INFO  L280        TraceCheckUtils]: 20: Hoare triple {2050#(not (= |task_#in~t.base| 0))} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2051#(not (= 0 task_~t.base))} is VALID
[2020-07-08 12:18:38,173 INFO  L263        TraceCheckUtils]: 21: Hoare triple {2051#(not (= 0 task_~t.base))} call #t~ret25 := min(~t.base, ~t.offset); {2031#true} is VALID
[2020-07-08 12:18:38,173 INFO  L280        TraceCheckUtils]: 22: Hoare triple {2031#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2093#(= min_~n.base |min_#in~n.base|)} is VALID
[2020-07-08 12:18:38,174 INFO  L280        TraceCheckUtils]: 23: Hoare triple {2093#(= min_~n.base |min_#in~n.base|)} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2094#(= 0 |min_#in~n.base|)} is VALID
[2020-07-08 12:18:38,175 INFO  L280        TraceCheckUtils]: 24: Hoare triple {2094#(= 0 |min_#in~n.base|)} assume true; {2094#(= 0 |min_#in~n.base|)} is VALID
[2020-07-08 12:18:38,177 INFO  L275        TraceCheckUtils]: 25: Hoare quadruple {2094#(= 0 |min_#in~n.base|)} {2051#(not (= 0 task_~t.base))} #137#return; {2032#false} is VALID
[2020-07-08 12:18:38,177 INFO  L280        TraceCheckUtils]: 26: Hoare triple {2032#false} assume -2147483648 <= #t~ret25 && #t~ret25 <= 2147483647;~a~1 := #t~ret25;havoc #t~ret25;call ~#b~1.base, ~#b~1.offset := #Ultimate.allocOnStack(4); {2032#false} is VALID
[2020-07-08 12:18:38,181 INFO  L263        TraceCheckUtils]: 27: Hoare triple {2032#false} call #t~ret26 := size(~t.base, ~t.offset); {2031#true} is VALID
[2020-07-08 12:18:38,181 INFO  L280        TraceCheckUtils]: 28: Hoare triple {2031#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2031#true} is VALID
[2020-07-08 12:18:38,181 INFO  L280        TraceCheckUtils]: 29: Hoare triple {2031#true} assume !(~t.base == 0 && ~t.offset == 0);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 4); {2031#true} is VALID
[2020-07-08 12:18:38,182 INFO  L263        TraceCheckUtils]: 30: Hoare triple {2031#true} call #t~ret22 := size(#t~mem21.base, #t~mem21.offset); {2031#true} is VALID
[2020-07-08 12:18:38,182 INFO  L280        TraceCheckUtils]: 31: Hoare triple {2031#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2031#true} is VALID
[2020-07-08 12:18:38,182 INFO  L280        TraceCheckUtils]: 32: Hoare triple {2031#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2031#true} is VALID
[2020-07-08 12:18:38,183 INFO  L280        TraceCheckUtils]: 33: Hoare triple {2031#true} assume true; {2031#true} is VALID
[2020-07-08 12:18:38,183 INFO  L275        TraceCheckUtils]: 34: Hoare quadruple {2031#true} {2031#true} #163#return; {2031#true} is VALID
[2020-07-08 12:18:38,183 INFO  L280        TraceCheckUtils]: 35: Hoare triple {2031#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~t.base, 8 + ~t.offset, 4); {2031#true} is VALID
[2020-07-08 12:18:38,184 INFO  L263        TraceCheckUtils]: 36: Hoare triple {2031#true} call #t~ret24 := size(#t~mem23.base, #t~mem23.offset); {2031#true} is VALID
[2020-07-08 12:18:38,184 INFO  L280        TraceCheckUtils]: 37: Hoare triple {2031#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2031#true} is VALID
[2020-07-08 12:18:38,184 INFO  L280        TraceCheckUtils]: 38: Hoare triple {2031#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2031#true} is VALID
[2020-07-08 12:18:38,184 INFO  L280        TraceCheckUtils]: 39: Hoare triple {2031#true} assume true; {2031#true} is VALID
[2020-07-08 12:18:38,185 INFO  L275        TraceCheckUtils]: 40: Hoare quadruple {2031#true} {2031#true} #165#return; {2031#true} is VALID
[2020-07-08 12:18:38,185 INFO  L280        TraceCheckUtils]: 41: Hoare triple {2031#true} assume -2147483648 <= #t~ret24 && #t~ret24 <= 2147483647;#res := 1 + (#t~ret22 + #t~ret24);havoc #t~mem21.base, #t~mem21.offset;havoc #t~mem23.base, #t~mem23.offset;havoc #t~ret24;havoc #t~ret22; {2031#true} is VALID
[2020-07-08 12:18:38,188 INFO  L280        TraceCheckUtils]: 42: Hoare triple {2031#true} assume true; {2031#true} is VALID
[2020-07-08 12:18:38,188 INFO  L275        TraceCheckUtils]: 43: Hoare quadruple {2031#true} {2032#false} #139#return; {2032#false} is VALID
[2020-07-08 12:18:38,188 INFO  L280        TraceCheckUtils]: 44: Hoare triple {2032#false} assume -2147483648 <= #t~ret26 && #t~ret26 <= 2147483647;~n~1 := #t~ret26;havoc #t~ret26; {2032#false} is VALID
[2020-07-08 12:18:38,188 INFO  L263        TraceCheckUtils]: 45: Hoare triple {2032#false} call assume_abort_if_not((if 0 != ~n~1 then 1 else 0)); {2031#true} is VALID
[2020-07-08 12:18:38,189 INFO  L280        TraceCheckUtils]: 46: Hoare triple {2031#true} ~cond := #in~cond; {2031#true} is VALID
[2020-07-08 12:18:38,189 INFO  L280        TraceCheckUtils]: 47: Hoare triple {2031#true} assume !(0 == ~cond); {2031#true} is VALID
[2020-07-08 12:18:38,189 INFO  L280        TraceCheckUtils]: 48: Hoare triple {2031#true} assume true; {2031#true} is VALID
[2020-07-08 12:18:38,189 INFO  L275        TraceCheckUtils]: 49: Hoare quadruple {2031#true} {2032#false} #141#return; {2032#false} is VALID
[2020-07-08 12:18:38,190 INFO  L280        TraceCheckUtils]: 50: Hoare triple {2032#false} call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(4 * ~n~1); {2032#false} is VALID
[2020-07-08 12:18:38,190 INFO  L263        TraceCheckUtils]: 51: Hoare triple {2032#false} call #Ultimate.meminit(#t~malloc27.base, #t~malloc27.offset, ~n~1, 4, 4 * ~n~1); {2103#(= |#memory_int| |old(#memory_int)|)} is VALID
[2020-07-08 12:18:38,190 INFO  L280        TraceCheckUtils]: 52: Hoare triple {2103#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2031#true} is VALID
[2020-07-08 12:18:38,191 INFO  L280        TraceCheckUtils]: 53: Hoare triple {2031#true} assume true; {2031#true} is VALID
[2020-07-08 12:18:38,191 INFO  L275        TraceCheckUtils]: 54: Hoare quadruple {2031#true} {2032#false} #143#return; {2032#false} is VALID
[2020-07-08 12:18:38,191 INFO  L280        TraceCheckUtils]: 55: Hoare triple {2032#false} ~x~0.base, ~x~0.offset := #t~malloc27.base, #t~malloc27.offset; {2032#false} is VALID
[2020-07-08 12:18:38,191 INFO  L263        TraceCheckUtils]: 56: Hoare triple {2032#false} call #t~ret28 := tree_inorder(~t.base, ~t.offset, ~x~0.base, ~x~0.offset, ~n~1); {2104#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID
[2020-07-08 12:18:38,192 INFO  L280        TraceCheckUtils]: 57: Hoare triple {2104#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {2031#true} is VALID
[2020-07-08 12:18:38,192 INFO  L280        TraceCheckUtils]: 58: Hoare triple {2031#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {2031#true} is VALID
[2020-07-08 12:18:38,192 INFO  L280        TraceCheckUtils]: 59: Hoare triple {2031#true} assume true; {2031#true} is VALID
[2020-07-08 12:18:38,193 INFO  L275        TraceCheckUtils]: 60: Hoare quadruple {2031#true} {2032#false} #145#return; {2032#false} is VALID
[2020-07-08 12:18:38,193 INFO  L280        TraceCheckUtils]: 61: Hoare triple {2032#false} assume -2147483648 <= #t~ret28 && #t~ret28 <= 2147483647;havoc #t~ret28;call #t~mem29 := read~int(~x~0.base, ~x~0.offset, 4); {2032#false} is VALID
[2020-07-08 12:18:38,193 INFO  L263        TraceCheckUtils]: 62: Hoare triple {2032#false} call __VERIFIER_assert((if ~a~1 == #t~mem29 then 1 else 0)); {2032#false} is VALID
[2020-07-08 12:18:38,193 INFO  L280        TraceCheckUtils]: 63: Hoare triple {2032#false} ~cond := #in~cond; {2032#false} is VALID
[2020-07-08 12:18:38,194 INFO  L280        TraceCheckUtils]: 64: Hoare triple {2032#false} assume 0 == ~cond; {2032#false} is VALID
[2020-07-08 12:18:38,194 INFO  L280        TraceCheckUtils]: 65: Hoare triple {2032#false} assume !false; {2032#false} is VALID
[2020-07-08 12:18:38,202 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked.
[2020-07-08 12:18:38,202 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110477519]
[2020-07-08 12:18:38,203 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-08 12:18:38,203 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2020-07-08 12:18:38,203 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554805260]
[2020-07-08 12:18:38,205 INFO  L78                 Accepts]: Start accepts. Automaton has 13 states. Word has length 66
[2020-07-08 12:18:38,206 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2020-07-08 12:18:38,206 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states.
[2020-07-08 12:18:38,291 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-08 12:18:38,291 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 13 states
[2020-07-08 12:18:38,291 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-07-08 12:18:38,292 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2020-07-08 12:18:38,292 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156
[2020-07-08 12:18:38,292 INFO  L87              Difference]: Start difference. First operand 91 states and 115 transitions. Second operand 13 states.
[2020-07-08 12:18:41,262 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-08 12:18:41,262 INFO  L93              Difference]: Finished difference Result 160 states and 205 transitions.
[2020-07-08 12:18:41,262 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2020-07-08 12:18:41,263 INFO  L78                 Accepts]: Start accepts. Automaton has 13 states. Word has length 66
[2020-07-08 12:18:41,263 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-08 12:18:41,263 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2020-07-08 12:18:41,268 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 197 transitions.
[2020-07-08 12:18:41,268 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2020-07-08 12:18:41,273 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 197 transitions.
[2020-07-08 12:18:41,274 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 197 transitions.
[2020-07-08 12:18:41,616 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-08 12:18:41,621 INFO  L225             Difference]: With dead ends: 160
[2020-07-08 12:18:41,621 INFO  L226             Difference]: Without dead ends: 96
[2020-07-08 12:18:41,623 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-07-08 12:18:41,623 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 96 states.
[2020-07-08 12:18:41,726 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 93.
[2020-07-08 12:18:41,727 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-08 12:18:41,727 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 93 states.
[2020-07-08 12:18:41,727 INFO  L74              IsIncluded]: Start isIncluded. First operand 96 states. Second operand 93 states.
[2020-07-08 12:18:41,727 INFO  L87              Difference]: Start difference. First operand 96 states. Second operand 93 states.
[2020-07-08 12:18:41,732 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-08 12:18:41,732 INFO  L93              Difference]: Finished difference Result 96 states and 124 transitions.
[2020-07-08 12:18:41,733 INFO  L276                IsEmpty]: Start isEmpty. Operand 96 states and 124 transitions.
[2020-07-08 12:18:41,733 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-08 12:18:41,734 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2020-07-08 12:18:41,734 INFO  L74              IsIncluded]: Start isIncluded. First operand 93 states. Second operand 96 states.
[2020-07-08 12:18:41,734 INFO  L87              Difference]: Start difference. First operand 93 states. Second operand 96 states.
[2020-07-08 12:18:41,740 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-08 12:18:41,740 INFO  L93              Difference]: Finished difference Result 96 states and 124 transitions.
[2020-07-08 12:18:41,740 INFO  L276                IsEmpty]: Start isEmpty. Operand 96 states and 124 transitions.
[2020-07-08 12:18:41,741 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-08 12:18:41,741 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2020-07-08 12:18:41,741 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2020-07-08 12:18:41,741 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-08 12:18:41,742 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 93 states.
[2020-07-08 12:18:41,746 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 118 transitions.
[2020-07-08 12:18:41,746 INFO  L78                 Accepts]: Start accepts. Automaton has 93 states and 118 transitions. Word has length 66
[2020-07-08 12:18:41,746 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-07-08 12:18:41,747 INFO  L479      AbstractCegarLoop]: Abstraction has 93 states and 118 transitions.
[2020-07-08 12:18:41,747 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 13 states.
[2020-07-08 12:18:41,747 INFO  L276                IsEmpty]: Start isEmpty. Operand 93 states and 118 transitions.
[2020-07-08 12:18:41,748 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 80
[2020-07-08 12:18:41,748 INFO  L414         BasicCegarLoop]: Found error trace
[2020-07-08 12:18:41,748 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-07-08 12:18:41,748 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2020-07-08 12:18:41,749 INFO  L427      AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-08 12:18:41,749 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-07-08 12:18:41,749 INFO  L82        PathProgramCache]: Analyzing trace with hash -505239167, now seen corresponding path program 1 times
[2020-07-08 12:18:41,749 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-07-08 12:18:41,749 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54600631]
[2020-07-08 12:18:41,750 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-08 12:18:41,776 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 12:18:41,854 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 12:18:41,862 INFO  L280        TraceCheckUtils]: 0: Hoare triple {2734#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2668#true} is VALID
[2020-07-08 12:18:41,862 INFO  L280        TraceCheckUtils]: 1: Hoare triple {2668#true} assume true; {2668#true} is VALID
[2020-07-08 12:18:41,863 INFO  L275        TraceCheckUtils]: 2: Hoare quadruple {2668#true} {2668#true} #167#return; {2668#true} is VALID
[2020-07-08 12:18:41,887 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 12:18:41,936 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 12:18:41,950 INFO  L280        TraceCheckUtils]: 0: Hoare triple {2735#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {2668#true} is VALID
[2020-07-08 12:18:41,950 INFO  L280        TraceCheckUtils]: 1: Hoare triple {2668#true} assume true; {2668#true} is VALID
[2020-07-08 12:18:41,951 INFO  L275        TraceCheckUtils]: 2: Hoare quadruple {2668#true} {2736#(= nondet_tree_~n~0.offset 0)} #133#return; {2736#(= nondet_tree_~n~0.offset 0)} is VALID
[2020-07-08 12:18:41,954 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 12:18:41,962 INFO  L280        TraceCheckUtils]: 0: Hoare triple {2735#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {2668#true} is VALID
[2020-07-08 12:18:41,963 INFO  L280        TraceCheckUtils]: 1: Hoare triple {2668#true} assume true; {2668#true} is VALID
[2020-07-08 12:18:41,963 INFO  L275        TraceCheckUtils]: 2: Hoare quadruple {2668#true} {2736#(= nondet_tree_~n~0.offset 0)} #135#return; {2736#(= nondet_tree_~n~0.offset 0)} is VALID
[2020-07-08 12:18:41,965 INFO  L280        TraceCheckUtils]: 0: Hoare triple {2735#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume !(0 != #t~nondet1 % 256);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~n~0.base, ~n~0.offset := #t~malloc2.base, #t~malloc2.offset;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~n~0.base, ~n~0.offset, 4);havoc #t~nondet3; {2736#(= nondet_tree_~n~0.offset 0)} is VALID
[2020-07-08 12:18:41,966 INFO  L263        TraceCheckUtils]: 1: Hoare triple {2736#(= nondet_tree_~n~0.offset 0)} call #t~ret4.base, #t~ret4.offset := nondet_tree(); {2735#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID
[2020-07-08 12:18:41,966 INFO  L280        TraceCheckUtils]: 2: Hoare triple {2735#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {2668#true} is VALID
[2020-07-08 12:18:41,966 INFO  L280        TraceCheckUtils]: 3: Hoare triple {2668#true} assume true; {2668#true} is VALID
[2020-07-08 12:18:41,968 INFO  L275        TraceCheckUtils]: 4: Hoare quadruple {2668#true} {2736#(= nondet_tree_~n~0.offset 0)} #133#return; {2736#(= nondet_tree_~n~0.offset 0)} is VALID
[2020-07-08 12:18:41,969 INFO  L280        TraceCheckUtils]: 5: Hoare triple {2736#(= nondet_tree_~n~0.offset 0)} call write~$Pointer$(#t~ret4.base, #t~ret4.offset, ~n~0.base, 4 + ~n~0.offset, 4);havoc #t~ret4.base, #t~ret4.offset; {2736#(= nondet_tree_~n~0.offset 0)} is VALID
[2020-07-08 12:18:41,970 INFO  L263        TraceCheckUtils]: 6: Hoare triple {2736#(= nondet_tree_~n~0.offset 0)} call #t~ret5.base, #t~ret5.offset := nondet_tree(); {2735#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID
[2020-07-08 12:18:41,970 INFO  L280        TraceCheckUtils]: 7: Hoare triple {2735#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {2668#true} is VALID
[2020-07-08 12:18:41,971 INFO  L280        TraceCheckUtils]: 8: Hoare triple {2668#true} assume true; {2668#true} is VALID
[2020-07-08 12:18:41,971 INFO  L275        TraceCheckUtils]: 9: Hoare quadruple {2668#true} {2736#(= nondet_tree_~n~0.offset 0)} #135#return; {2736#(= nondet_tree_~n~0.offset 0)} is VALID
[2020-07-08 12:18:41,972 INFO  L280        TraceCheckUtils]: 10: Hoare triple {2736#(= nondet_tree_~n~0.offset 0)} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~n~0.base, 8 + ~n~0.offset, 4);havoc #t~ret5.base, #t~ret5.offset;#res.base, #res.offset := ~n~0.base, ~n~0.offset; {2743#(and (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0))} is VALID
[2020-07-08 12:18:41,973 INFO  L280        TraceCheckUtils]: 11: Hoare triple {2743#(and (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0))} assume true; {2743#(and (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0))} is VALID
[2020-07-08 12:18:41,974 INFO  L275        TraceCheckUtils]: 12: Hoare quadruple {2743#(and (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0))} {2668#true} #123#return; {2686#(= 0 |main_#t~ret38.offset|)} is VALID
[2020-07-08 12:18:41,985 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 12:18:42,122 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 12:18:42,129 INFO  L280        TraceCheckUtils]: 0: Hoare triple {2668#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2668#true} is VALID
[2020-07-08 12:18:42,130 INFO  L280        TraceCheckUtils]: 1: Hoare triple {2668#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2668#true} is VALID
[2020-07-08 12:18:42,130 INFO  L280        TraceCheckUtils]: 2: Hoare triple {2668#true} assume true; {2668#true} is VALID
[2020-07-08 12:18:42,131 INFO  L275        TraceCheckUtils]: 3: Hoare quadruple {2668#true} {2745#(or (and (= min_~n.offset |min_#in~n.offset|) (not (= 0 min_~n.offset))) (and (not (= 0 |min_#in~n.base|)) (= min_~n.offset |min_#in~n.offset|)))} #129#return; {2745#(or (and (= min_~n.offset |min_#in~n.offset|) (not (= 0 min_~n.offset))) (and (not (= 0 |min_#in~n.base|)) (= min_~n.offset |min_#in~n.offset|)))} is VALID
[2020-07-08 12:18:42,133 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 12:18:42,143 INFO  L280        TraceCheckUtils]: 0: Hoare triple {2668#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2668#true} is VALID
[2020-07-08 12:18:42,143 INFO  L280        TraceCheckUtils]: 1: Hoare triple {2668#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2668#true} is VALID
[2020-07-08 12:18:42,143 INFO  L280        TraceCheckUtils]: 2: Hoare triple {2668#true} assume true; {2668#true} is VALID
[2020-07-08 12:18:42,145 INFO  L275        TraceCheckUtils]: 3: Hoare quadruple {2668#true} {2750#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} #131#return; {2750#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID
[2020-07-08 12:18:42,146 INFO  L280        TraceCheckUtils]: 0: Hoare triple {2668#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2744#(and (= min_~n.base |min_#in~n.base|) (= min_~n.offset |min_#in~n.offset|))} is VALID
[2020-07-08 12:18:42,147 INFO  L280        TraceCheckUtils]: 1: Hoare triple {2744#(and (= min_~n.base |min_#in~n.base|) (= min_~n.offset |min_#in~n.offset|))} assume !(~n.base == 0 && ~n.offset == 0);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~n.base, 4 + ~n.offset, 4); {2745#(or (and (= min_~n.offset |min_#in~n.offset|) (not (= 0 min_~n.offset))) (and (not (= 0 |min_#in~n.base|)) (= min_~n.offset |min_#in~n.offset|)))} is VALID
[2020-07-08 12:18:42,148 INFO  L263        TraceCheckUtils]: 2: Hoare triple {2745#(or (and (= min_~n.offset |min_#in~n.offset|) (not (= 0 min_~n.offset))) (and (not (= 0 |min_#in~n.base|)) (= min_~n.offset |min_#in~n.offset|)))} call #t~ret7 := min(#t~mem6.base, #t~mem6.offset); {2668#true} is VALID
[2020-07-08 12:18:42,148 INFO  L280        TraceCheckUtils]: 3: Hoare triple {2668#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2668#true} is VALID
[2020-07-08 12:18:42,148 INFO  L280        TraceCheckUtils]: 4: Hoare triple {2668#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2668#true} is VALID
[2020-07-08 12:18:42,149 INFO  L280        TraceCheckUtils]: 5: Hoare triple {2668#true} assume true; {2668#true} is VALID
[2020-07-08 12:18:42,156 INFO  L275        TraceCheckUtils]: 6: Hoare quadruple {2668#true} {2745#(or (and (= min_~n.offset |min_#in~n.offset|) (not (= 0 min_~n.offset))) (and (not (= 0 |min_#in~n.base|)) (= min_~n.offset |min_#in~n.offset|)))} #129#return; {2745#(or (and (= min_~n.offset |min_#in~n.offset|) (not (= 0 min_~n.offset))) (and (not (= 0 |min_#in~n.base|)) (= min_~n.offset |min_#in~n.offset|)))} is VALID
[2020-07-08 12:18:42,157 INFO  L280        TraceCheckUtils]: 7: Hoare triple {2745#(or (and (= min_~n.offset |min_#in~n.offset|) (not (= 0 min_~n.offset))) (and (not (= 0 |min_#in~n.base|)) (= min_~n.offset |min_#in~n.offset|)))} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~a~0 := #t~ret7;havoc #t~mem6.base, #t~mem6.offset;havoc #t~ret7;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~n.base, 8 + ~n.offset, 4); {2750#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID
[2020-07-08 12:18:42,158 INFO  L263        TraceCheckUtils]: 8: Hoare triple {2750#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} call #t~ret9 := min(#t~mem8.base, #t~mem8.offset); {2668#true} is VALID
[2020-07-08 12:18:42,158 INFO  L280        TraceCheckUtils]: 9: Hoare triple {2668#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2668#true} is VALID
[2020-07-08 12:18:42,158 INFO  L280        TraceCheckUtils]: 10: Hoare triple {2668#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2668#true} is VALID
[2020-07-08 12:18:42,158 INFO  L280        TraceCheckUtils]: 11: Hoare triple {2668#true} assume true; {2668#true} is VALID
[2020-07-08 12:18:42,159 INFO  L275        TraceCheckUtils]: 12: Hoare quadruple {2668#true} {2750#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} #131#return; {2750#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID
[2020-07-08 12:18:42,160 INFO  L280        TraceCheckUtils]: 13: Hoare triple {2750#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~b~0 := #t~ret9;havoc #t~ret9;havoc #t~mem8.base, #t~mem8.offset; {2750#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID
[2020-07-08 12:18:42,160 INFO  L280        TraceCheckUtils]: 14: Hoare triple {2750#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} assume ~a~0 <= ~b~0;#res := ~a~0; {2750#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID
[2020-07-08 12:18:42,171 INFO  L280        TraceCheckUtils]: 15: Hoare triple {2750#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} assume true; {2750#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID
[2020-07-08 12:18:42,172 INFO  L275        TraceCheckUtils]: 16: Hoare quadruple {2750#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} {2688#(= 0 task_~t.offset)} #137#return; {2706#(not (= 0 task_~t.base))} is VALID
[2020-07-08 12:18:42,178 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 12:18:42,185 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 12:18:42,189 INFO  L280        TraceCheckUtils]: 0: Hoare triple {2668#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2668#true} is VALID
[2020-07-08 12:18:42,189 INFO  L280        TraceCheckUtils]: 1: Hoare triple {2668#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2668#true} is VALID
[2020-07-08 12:18:42,190 INFO  L280        TraceCheckUtils]: 2: Hoare triple {2668#true} assume true; {2668#true} is VALID
[2020-07-08 12:18:42,190 INFO  L275        TraceCheckUtils]: 3: Hoare quadruple {2668#true} {2668#true} #163#return; {2668#true} is VALID
[2020-07-08 12:18:42,191 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 12:18:42,194 INFO  L280        TraceCheckUtils]: 0: Hoare triple {2668#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2668#true} is VALID
[2020-07-08 12:18:42,195 INFO  L280        TraceCheckUtils]: 1: Hoare triple {2668#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2668#true} is VALID
[2020-07-08 12:18:42,195 INFO  L280        TraceCheckUtils]: 2: Hoare triple {2668#true} assume true; {2668#true} is VALID
[2020-07-08 12:18:42,196 INFO  L275        TraceCheckUtils]: 3: Hoare quadruple {2668#true} {2668#true} #165#return; {2668#true} is VALID
[2020-07-08 12:18:42,196 INFO  L280        TraceCheckUtils]: 0: Hoare triple {2668#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2668#true} is VALID
[2020-07-08 12:18:42,196 INFO  L280        TraceCheckUtils]: 1: Hoare triple {2668#true} assume !(~t.base == 0 && ~t.offset == 0);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 4); {2668#true} is VALID
[2020-07-08 12:18:42,197 INFO  L263        TraceCheckUtils]: 2: Hoare triple {2668#true} call #t~ret22 := size(#t~mem21.base, #t~mem21.offset); {2668#true} is VALID
[2020-07-08 12:18:42,197 INFO  L280        TraceCheckUtils]: 3: Hoare triple {2668#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2668#true} is VALID
[2020-07-08 12:18:42,197 INFO  L280        TraceCheckUtils]: 4: Hoare triple {2668#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2668#true} is VALID
[2020-07-08 12:18:42,198 INFO  L280        TraceCheckUtils]: 5: Hoare triple {2668#true} assume true; {2668#true} is VALID
[2020-07-08 12:18:42,198 INFO  L275        TraceCheckUtils]: 6: Hoare quadruple {2668#true} {2668#true} #163#return; {2668#true} is VALID
[2020-07-08 12:18:42,198 INFO  L280        TraceCheckUtils]: 7: Hoare triple {2668#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~t.base, 8 + ~t.offset, 4); {2668#true} is VALID
[2020-07-08 12:18:42,199 INFO  L263        TraceCheckUtils]: 8: Hoare triple {2668#true} call #t~ret24 := size(#t~mem23.base, #t~mem23.offset); {2668#true} is VALID
[2020-07-08 12:18:42,199 INFO  L280        TraceCheckUtils]: 9: Hoare triple {2668#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2668#true} is VALID
[2020-07-08 12:18:42,199 INFO  L280        TraceCheckUtils]: 10: Hoare triple {2668#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2668#true} is VALID
[2020-07-08 12:18:42,199 INFO  L280        TraceCheckUtils]: 11: Hoare triple {2668#true} assume true; {2668#true} is VALID
[2020-07-08 12:18:42,200 INFO  L275        TraceCheckUtils]: 12: Hoare quadruple {2668#true} {2668#true} #165#return; {2668#true} is VALID
[2020-07-08 12:18:42,200 INFO  L280        TraceCheckUtils]: 13: Hoare triple {2668#true} assume -2147483648 <= #t~ret24 && #t~ret24 <= 2147483647;#res := 1 + (#t~ret22 + #t~ret24);havoc #t~mem21.base, #t~mem21.offset;havoc #t~mem23.base, #t~mem23.offset;havoc #t~ret24;havoc #t~ret22; {2668#true} is VALID
[2020-07-08 12:18:42,200 INFO  L280        TraceCheckUtils]: 14: Hoare triple {2668#true} assume true; {2668#true} is VALID
[2020-07-08 12:18:42,202 INFO  L275        TraceCheckUtils]: 15: Hoare quadruple {2668#true} {2706#(not (= 0 task_~t.base))} #139#return; {2706#(not (= 0 task_~t.base))} is VALID
[2020-07-08 12:18:42,204 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 12:18:42,208 INFO  L280        TraceCheckUtils]: 0: Hoare triple {2668#true} ~cond := #in~cond; {2668#true} is VALID
[2020-07-08 12:18:42,209 INFO  L280        TraceCheckUtils]: 1: Hoare triple {2668#true} assume !(0 == ~cond); {2668#true} is VALID
[2020-07-08 12:18:42,209 INFO  L280        TraceCheckUtils]: 2: Hoare triple {2668#true} assume true; {2668#true} is VALID
[2020-07-08 12:18:42,210 INFO  L275        TraceCheckUtils]: 3: Hoare quadruple {2668#true} {2706#(not (= 0 task_~t.base))} #141#return; {2706#(not (= 0 task_~t.base))} is VALID
[2020-07-08 12:18:42,230 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 12:18:42,234 INFO  L280        TraceCheckUtils]: 0: Hoare triple {2763#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2668#true} is VALID
[2020-07-08 12:18:42,235 INFO  L280        TraceCheckUtils]: 1: Hoare triple {2668#true} assume true; {2668#true} is VALID
[2020-07-08 12:18:42,236 INFO  L275        TraceCheckUtils]: 2: Hoare quadruple {2668#true} {2706#(not (= 0 task_~t.base))} #143#return; {2706#(not (= 0 task_~t.base))} is VALID
[2020-07-08 12:18:42,257 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 12:18:42,312 INFO  L280        TraceCheckUtils]: 0: Hoare triple {2764#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {2765#(= |tree_inorder_#in~t.base| tree_inorder_~t.base)} is VALID
[2020-07-08 12:18:42,313 INFO  L280        TraceCheckUtils]: 1: Hoare triple {2765#(= |tree_inorder_#in~t.base| tree_inorder_~t.base)} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {2766#(= 0 |tree_inorder_#in~t.base|)} is VALID
[2020-07-08 12:18:42,314 INFO  L280        TraceCheckUtils]: 2: Hoare triple {2766#(= 0 |tree_inorder_#in~t.base|)} assume true; {2766#(= 0 |tree_inorder_#in~t.base|)} is VALID
[2020-07-08 12:18:42,315 INFO  L275        TraceCheckUtils]: 3: Hoare quadruple {2766#(= 0 |tree_inorder_#in~t.base|)} {2706#(not (= 0 task_~t.base))} #145#return; {2669#false} is VALID
[2020-07-08 12:18:42,316 INFO  L263        TraceCheckUtils]: 0: Hoare triple {2668#true} call ULTIMATE.init(); {2734#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID
[2020-07-08 12:18:42,317 INFO  L280        TraceCheckUtils]: 1: Hoare triple {2734#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2668#true} is VALID
[2020-07-08 12:18:42,317 INFO  L280        TraceCheckUtils]: 2: Hoare triple {2668#true} assume true; {2668#true} is VALID
[2020-07-08 12:18:42,317 INFO  L275        TraceCheckUtils]: 3: Hoare quadruple {2668#true} {2668#true} #167#return; {2668#true} is VALID
[2020-07-08 12:18:42,317 INFO  L263        TraceCheckUtils]: 4: Hoare triple {2668#true} call #t~ret39 := main(); {2668#true} is VALID
[2020-07-08 12:18:42,318 INFO  L263        TraceCheckUtils]: 5: Hoare triple {2668#true} call #t~ret38.base, #t~ret38.offset := nondet_tree(); {2735#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID
[2020-07-08 12:18:42,320 INFO  L280        TraceCheckUtils]: 6: Hoare triple {2735#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume !(0 != #t~nondet1 % 256);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~n~0.base, ~n~0.offset := #t~malloc2.base, #t~malloc2.offset;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~n~0.base, ~n~0.offset, 4);havoc #t~nondet3; {2736#(= nondet_tree_~n~0.offset 0)} is VALID
[2020-07-08 12:18:42,321 INFO  L263        TraceCheckUtils]: 7: Hoare triple {2736#(= nondet_tree_~n~0.offset 0)} call #t~ret4.base, #t~ret4.offset := nondet_tree(); {2735#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID
[2020-07-08 12:18:42,321 INFO  L280        TraceCheckUtils]: 8: Hoare triple {2735#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {2668#true} is VALID
[2020-07-08 12:18:42,321 INFO  L280        TraceCheckUtils]: 9: Hoare triple {2668#true} assume true; {2668#true} is VALID
[2020-07-08 12:18:42,335 INFO  L275        TraceCheckUtils]: 10: Hoare quadruple {2668#true} {2736#(= nondet_tree_~n~0.offset 0)} #133#return; {2736#(= nondet_tree_~n~0.offset 0)} is VALID
[2020-07-08 12:18:42,338 INFO  L280        TraceCheckUtils]: 11: Hoare triple {2736#(= nondet_tree_~n~0.offset 0)} call write~$Pointer$(#t~ret4.base, #t~ret4.offset, ~n~0.base, 4 + ~n~0.offset, 4);havoc #t~ret4.base, #t~ret4.offset; {2736#(= nondet_tree_~n~0.offset 0)} is VALID
[2020-07-08 12:18:42,339 INFO  L263        TraceCheckUtils]: 12: Hoare triple {2736#(= nondet_tree_~n~0.offset 0)} call #t~ret5.base, #t~ret5.offset := nondet_tree(); {2735#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID
[2020-07-08 12:18:42,340 INFO  L280        TraceCheckUtils]: 13: Hoare triple {2735#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {2668#true} is VALID
[2020-07-08 12:18:42,340 INFO  L280        TraceCheckUtils]: 14: Hoare triple {2668#true} assume true; {2668#true} is VALID
[2020-07-08 12:18:42,341 INFO  L275        TraceCheckUtils]: 15: Hoare quadruple {2668#true} {2736#(= nondet_tree_~n~0.offset 0)} #135#return; {2736#(= nondet_tree_~n~0.offset 0)} is VALID
[2020-07-08 12:18:42,342 INFO  L280        TraceCheckUtils]: 16: Hoare triple {2736#(= nondet_tree_~n~0.offset 0)} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~n~0.base, 8 + ~n~0.offset, 4);havoc #t~ret5.base, #t~ret5.offset;#res.base, #res.offset := ~n~0.base, ~n~0.offset; {2743#(and (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0))} is VALID
[2020-07-08 12:18:42,343 INFO  L280        TraceCheckUtils]: 17: Hoare triple {2743#(and (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0))} assume true; {2743#(and (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0))} is VALID
[2020-07-08 12:18:42,344 INFO  L275        TraceCheckUtils]: 18: Hoare quadruple {2743#(and (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0))} {2668#true} #123#return; {2686#(= 0 |main_#t~ret38.offset|)} is VALID
[2020-07-08 12:18:42,345 INFO  L263        TraceCheckUtils]: 19: Hoare triple {2686#(= 0 |main_#t~ret38.offset|)} call task(#t~ret38.base, #t~ret38.offset); {2687#(= 0 |task_#in~t.offset|)} is VALID
[2020-07-08 12:18:42,345 INFO  L280        TraceCheckUtils]: 20: Hoare triple {2687#(= 0 |task_#in~t.offset|)} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2688#(= 0 task_~t.offset)} is VALID
[2020-07-08 12:18:42,346 INFO  L263        TraceCheckUtils]: 21: Hoare triple {2688#(= 0 task_~t.offset)} call #t~ret25 := min(~t.base, ~t.offset); {2668#true} is VALID
[2020-07-08 12:18:42,347 INFO  L280        TraceCheckUtils]: 22: Hoare triple {2668#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2744#(and (= min_~n.base |min_#in~n.base|) (= min_~n.offset |min_#in~n.offset|))} is VALID
[2020-07-08 12:18:42,348 INFO  L280        TraceCheckUtils]: 23: Hoare triple {2744#(and (= min_~n.base |min_#in~n.base|) (= min_~n.offset |min_#in~n.offset|))} assume !(~n.base == 0 && ~n.offset == 0);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~n.base, 4 + ~n.offset, 4); {2745#(or (and (= min_~n.offset |min_#in~n.offset|) (not (= 0 min_~n.offset))) (and (not (= 0 |min_#in~n.base|)) (= min_~n.offset |min_#in~n.offset|)))} is VALID
[2020-07-08 12:18:42,348 INFO  L263        TraceCheckUtils]: 24: Hoare triple {2745#(or (and (= min_~n.offset |min_#in~n.offset|) (not (= 0 min_~n.offset))) (and (not (= 0 |min_#in~n.base|)) (= min_~n.offset |min_#in~n.offset|)))} call #t~ret7 := min(#t~mem6.base, #t~mem6.offset); {2668#true} is VALID
[2020-07-08 12:18:42,349 INFO  L280        TraceCheckUtils]: 25: Hoare triple {2668#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2668#true} is VALID
[2020-07-08 12:18:42,349 INFO  L280        TraceCheckUtils]: 26: Hoare triple {2668#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2668#true} is VALID
[2020-07-08 12:18:42,349 INFO  L280        TraceCheckUtils]: 27: Hoare triple {2668#true} assume true; {2668#true} is VALID
[2020-07-08 12:18:42,350 INFO  L275        TraceCheckUtils]: 28: Hoare quadruple {2668#true} {2745#(or (and (= min_~n.offset |min_#in~n.offset|) (not (= 0 min_~n.offset))) (and (not (= 0 |min_#in~n.base|)) (= min_~n.offset |min_#in~n.offset|)))} #129#return; {2745#(or (and (= min_~n.offset |min_#in~n.offset|) (not (= 0 min_~n.offset))) (and (not (= 0 |min_#in~n.base|)) (= min_~n.offset |min_#in~n.offset|)))} is VALID
[2020-07-08 12:18:42,351 INFO  L280        TraceCheckUtils]: 29: Hoare triple {2745#(or (and (= min_~n.offset |min_#in~n.offset|) (not (= 0 min_~n.offset))) (and (not (= 0 |min_#in~n.base|)) (= min_~n.offset |min_#in~n.offset|)))} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~a~0 := #t~ret7;havoc #t~mem6.base, #t~mem6.offset;havoc #t~ret7;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~n.base, 8 + ~n.offset, 4); {2750#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID
[2020-07-08 12:18:42,351 INFO  L263        TraceCheckUtils]: 30: Hoare triple {2750#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} call #t~ret9 := min(#t~mem8.base, #t~mem8.offset); {2668#true} is VALID
[2020-07-08 12:18:42,351 INFO  L280        TraceCheckUtils]: 31: Hoare triple {2668#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2668#true} is VALID
[2020-07-08 12:18:42,351 INFO  L280        TraceCheckUtils]: 32: Hoare triple {2668#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2668#true} is VALID
[2020-07-08 12:18:42,351 INFO  L280        TraceCheckUtils]: 33: Hoare triple {2668#true} assume true; {2668#true} is VALID
[2020-07-08 12:18:42,353 INFO  L275        TraceCheckUtils]: 34: Hoare quadruple {2668#true} {2750#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} #131#return; {2750#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID
[2020-07-08 12:18:42,353 INFO  L280        TraceCheckUtils]: 35: Hoare triple {2750#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~b~0 := #t~ret9;havoc #t~ret9;havoc #t~mem8.base, #t~mem8.offset; {2750#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID
[2020-07-08 12:18:42,354 INFO  L280        TraceCheckUtils]: 36: Hoare triple {2750#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} assume ~a~0 <= ~b~0;#res := ~a~0; {2750#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID
[2020-07-08 12:18:42,354 INFO  L280        TraceCheckUtils]: 37: Hoare triple {2750#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} assume true; {2750#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID
[2020-07-08 12:18:42,355 INFO  L275        TraceCheckUtils]: 38: Hoare quadruple {2750#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} {2688#(= 0 task_~t.offset)} #137#return; {2706#(not (= 0 task_~t.base))} is VALID
[2020-07-08 12:18:42,356 INFO  L280        TraceCheckUtils]: 39: Hoare triple {2706#(not (= 0 task_~t.base))} assume -2147483648 <= #t~ret25 && #t~ret25 <= 2147483647;~a~1 := #t~ret25;havoc #t~ret25;call ~#b~1.base, ~#b~1.offset := #Ultimate.allocOnStack(4); {2706#(not (= 0 task_~t.base))} is VALID
[2020-07-08 12:18:42,356 INFO  L263        TraceCheckUtils]: 40: Hoare triple {2706#(not (= 0 task_~t.base))} call #t~ret26 := size(~t.base, ~t.offset); {2668#true} is VALID
[2020-07-08 12:18:42,356 INFO  L280        TraceCheckUtils]: 41: Hoare triple {2668#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2668#true} is VALID
[2020-07-08 12:18:42,356 INFO  L280        TraceCheckUtils]: 42: Hoare triple {2668#true} assume !(~t.base == 0 && ~t.offset == 0);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 4); {2668#true} is VALID
[2020-07-08 12:18:42,356 INFO  L263        TraceCheckUtils]: 43: Hoare triple {2668#true} call #t~ret22 := size(#t~mem21.base, #t~mem21.offset); {2668#true} is VALID
[2020-07-08 12:18:42,357 INFO  L280        TraceCheckUtils]: 44: Hoare triple {2668#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2668#true} is VALID
[2020-07-08 12:18:42,357 INFO  L280        TraceCheckUtils]: 45: Hoare triple {2668#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2668#true} is VALID
[2020-07-08 12:18:42,357 INFO  L280        TraceCheckUtils]: 46: Hoare triple {2668#true} assume true; {2668#true} is VALID
[2020-07-08 12:18:42,357 INFO  L275        TraceCheckUtils]: 47: Hoare quadruple {2668#true} {2668#true} #163#return; {2668#true} is VALID
[2020-07-08 12:18:42,357 INFO  L280        TraceCheckUtils]: 48: Hoare triple {2668#true} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~t.base, 8 + ~t.offset, 4); {2668#true} is VALID
[2020-07-08 12:18:42,357 INFO  L263        TraceCheckUtils]: 49: Hoare triple {2668#true} call #t~ret24 := size(#t~mem23.base, #t~mem23.offset); {2668#true} is VALID
[2020-07-08 12:18:42,358 INFO  L280        TraceCheckUtils]: 50: Hoare triple {2668#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2668#true} is VALID
[2020-07-08 12:18:42,358 INFO  L280        TraceCheckUtils]: 51: Hoare triple {2668#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2668#true} is VALID
[2020-07-08 12:18:42,358 INFO  L280        TraceCheckUtils]: 52: Hoare triple {2668#true} assume true; {2668#true} is VALID
[2020-07-08 12:18:42,358 INFO  L275        TraceCheckUtils]: 53: Hoare quadruple {2668#true} {2668#true} #165#return; {2668#true} is VALID
[2020-07-08 12:18:42,358 INFO  L280        TraceCheckUtils]: 54: Hoare triple {2668#true} assume -2147483648 <= #t~ret24 && #t~ret24 <= 2147483647;#res := 1 + (#t~ret22 + #t~ret24);havoc #t~mem21.base, #t~mem21.offset;havoc #t~mem23.base, #t~mem23.offset;havoc #t~ret24;havoc #t~ret22; {2668#true} is VALID
[2020-07-08 12:18:42,359 INFO  L280        TraceCheckUtils]: 55: Hoare triple {2668#true} assume true; {2668#true} is VALID
[2020-07-08 12:18:42,359 INFO  L275        TraceCheckUtils]: 56: Hoare quadruple {2668#true} {2706#(not (= 0 task_~t.base))} #139#return; {2706#(not (= 0 task_~t.base))} is VALID
[2020-07-08 12:18:42,360 INFO  L280        TraceCheckUtils]: 57: Hoare triple {2706#(not (= 0 task_~t.base))} assume -2147483648 <= #t~ret26 && #t~ret26 <= 2147483647;~n~1 := #t~ret26;havoc #t~ret26; {2706#(not (= 0 task_~t.base))} is VALID
[2020-07-08 12:18:42,360 INFO  L263        TraceCheckUtils]: 58: Hoare triple {2706#(not (= 0 task_~t.base))} call assume_abort_if_not((if 0 != ~n~1 then 1 else 0)); {2668#true} is VALID
[2020-07-08 12:18:42,360 INFO  L280        TraceCheckUtils]: 59: Hoare triple {2668#true} ~cond := #in~cond; {2668#true} is VALID
[2020-07-08 12:18:42,360 INFO  L280        TraceCheckUtils]: 60: Hoare triple {2668#true} assume !(0 == ~cond); {2668#true} is VALID
[2020-07-08 12:18:42,361 INFO  L280        TraceCheckUtils]: 61: Hoare triple {2668#true} assume true; {2668#true} is VALID
[2020-07-08 12:18:42,361 INFO  L275        TraceCheckUtils]: 62: Hoare quadruple {2668#true} {2706#(not (= 0 task_~t.base))} #141#return; {2706#(not (= 0 task_~t.base))} is VALID
[2020-07-08 12:18:42,364 INFO  L280        TraceCheckUtils]: 63: Hoare triple {2706#(not (= 0 task_~t.base))} call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(4 * ~n~1); {2706#(not (= 0 task_~t.base))} is VALID
[2020-07-08 12:18:42,366 INFO  L263        TraceCheckUtils]: 64: Hoare triple {2706#(not (= 0 task_~t.base))} call #Ultimate.meminit(#t~malloc27.base, #t~malloc27.offset, ~n~1, 4, 4 * ~n~1); {2763#(= |#memory_int| |old(#memory_int)|)} is VALID
[2020-07-08 12:18:42,366 INFO  L280        TraceCheckUtils]: 65: Hoare triple {2763#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2668#true} is VALID
[2020-07-08 12:18:42,366 INFO  L280        TraceCheckUtils]: 66: Hoare triple {2668#true} assume true; {2668#true} is VALID
[2020-07-08 12:18:42,367 INFO  L275        TraceCheckUtils]: 67: Hoare quadruple {2668#true} {2706#(not (= 0 task_~t.base))} #143#return; {2706#(not (= 0 task_~t.base))} is VALID
[2020-07-08 12:18:42,368 INFO  L280        TraceCheckUtils]: 68: Hoare triple {2706#(not (= 0 task_~t.base))} ~x~0.base, ~x~0.offset := #t~malloc27.base, #t~malloc27.offset; {2706#(not (= 0 task_~t.base))} is VALID
[2020-07-08 12:18:42,369 INFO  L263        TraceCheckUtils]: 69: Hoare triple {2706#(not (= 0 task_~t.base))} call #t~ret28 := tree_inorder(~t.base, ~t.offset, ~x~0.base, ~x~0.offset, ~n~1); {2764#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID
[2020-07-08 12:18:42,370 INFO  L280        TraceCheckUtils]: 70: Hoare triple {2764#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {2765#(= |tree_inorder_#in~t.base| tree_inorder_~t.base)} is VALID
[2020-07-08 12:18:42,371 INFO  L280        TraceCheckUtils]: 71: Hoare triple {2765#(= |tree_inorder_#in~t.base| tree_inorder_~t.base)} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {2766#(= 0 |tree_inorder_#in~t.base|)} is VALID
[2020-07-08 12:18:42,371 INFO  L280        TraceCheckUtils]: 72: Hoare triple {2766#(= 0 |tree_inorder_#in~t.base|)} assume true; {2766#(= 0 |tree_inorder_#in~t.base|)} is VALID
[2020-07-08 12:18:42,373 INFO  L275        TraceCheckUtils]: 73: Hoare quadruple {2766#(= 0 |tree_inorder_#in~t.base|)} {2706#(not (= 0 task_~t.base))} #145#return; {2669#false} is VALID
[2020-07-08 12:18:42,373 INFO  L280        TraceCheckUtils]: 74: Hoare triple {2669#false} assume -2147483648 <= #t~ret28 && #t~ret28 <= 2147483647;havoc #t~ret28;call #t~mem29 := read~int(~x~0.base, ~x~0.offset, 4); {2669#false} is VALID
[2020-07-08 12:18:42,373 INFO  L263        TraceCheckUtils]: 75: Hoare triple {2669#false} call __VERIFIER_assert((if ~a~1 == #t~mem29 then 1 else 0)); {2669#false} is VALID
[2020-07-08 12:18:42,373 INFO  L280        TraceCheckUtils]: 76: Hoare triple {2669#false} ~cond := #in~cond; {2669#false} is VALID
[2020-07-08 12:18:42,373 INFO  L280        TraceCheckUtils]: 77: Hoare triple {2669#false} assume 0 == ~cond; {2669#false} is VALID
[2020-07-08 12:18:42,374 INFO  L280        TraceCheckUtils]: 78: Hoare triple {2669#false} assume !false; {2669#false} is VALID
[2020-07-08 12:18:42,383 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked.
[2020-07-08 12:18:42,383 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54600631]
[2020-07-08 12:18:42,383 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701044220]
[2020-07-08 12:18:42,383 INFO  L94    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-07-08 12:18:42,490 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 12:18:42,493 INFO  L264         TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 39 conjunts are in the unsatisfiable core
[2020-07-08 12:18:42,525 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-08 12:18:42,531 INFO  L287         TraceCheckSpWp]: Computing forward predicates...
[2020-07-08 12:18:42,722 INFO  L263        TraceCheckUtils]: 0: Hoare triple {2668#true} call ULTIMATE.init(); {2668#true} is VALID
[2020-07-08 12:18:42,722 INFO  L280        TraceCheckUtils]: 1: Hoare triple {2668#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2668#true} is VALID
[2020-07-08 12:18:42,722 INFO  L280        TraceCheckUtils]: 2: Hoare triple {2668#true} assume true; {2668#true} is VALID
[2020-07-08 12:18:42,722 INFO  L275        TraceCheckUtils]: 3: Hoare quadruple {2668#true} {2668#true} #167#return; {2668#true} is VALID
[2020-07-08 12:18:42,723 INFO  L263        TraceCheckUtils]: 4: Hoare triple {2668#true} call #t~ret39 := main(); {2668#true} is VALID
[2020-07-08 12:18:42,723 INFO  L263        TraceCheckUtils]: 5: Hoare triple {2668#true} call #t~ret38.base, #t~ret38.offset := nondet_tree(); {2668#true} is VALID
[2020-07-08 12:18:42,726 INFO  L280        TraceCheckUtils]: 6: Hoare triple {2668#true} assume !(0 != #t~nondet1 % 256);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~n~0.base, ~n~0.offset := #t~malloc2.base, #t~malloc2.offset;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~n~0.base, ~n~0.offset, 4);havoc #t~nondet3; {2736#(= nondet_tree_~n~0.offset 0)} is VALID
[2020-07-08 12:18:42,726 INFO  L263        TraceCheckUtils]: 7: Hoare triple {2736#(= nondet_tree_~n~0.offset 0)} call #t~ret4.base, #t~ret4.offset := nondet_tree(); {2668#true} is VALID
[2020-07-08 12:18:42,726 INFO  L280        TraceCheckUtils]: 8: Hoare triple {2668#true} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {2668#true} is VALID
[2020-07-08 12:18:42,726 INFO  L280        TraceCheckUtils]: 9: Hoare triple {2668#true} assume true; {2668#true} is VALID
[2020-07-08 12:18:42,727 INFO  L275        TraceCheckUtils]: 10: Hoare quadruple {2668#true} {2736#(= nondet_tree_~n~0.offset 0)} #133#return; {2736#(= nondet_tree_~n~0.offset 0)} is VALID
[2020-07-08 12:18:42,728 INFO  L280        TraceCheckUtils]: 11: Hoare triple {2736#(= nondet_tree_~n~0.offset 0)} call write~$Pointer$(#t~ret4.base, #t~ret4.offset, ~n~0.base, 4 + ~n~0.offset, 4);havoc #t~ret4.base, #t~ret4.offset; {2736#(= nondet_tree_~n~0.offset 0)} is VALID
[2020-07-08 12:18:42,728 INFO  L263        TraceCheckUtils]: 12: Hoare triple {2736#(= nondet_tree_~n~0.offset 0)} call #t~ret5.base, #t~ret5.offset := nondet_tree(); {2668#true} is VALID
[2020-07-08 12:18:42,728 INFO  L280        TraceCheckUtils]: 13: Hoare triple {2668#true} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {2668#true} is VALID
[2020-07-08 12:18:42,728 INFO  L280        TraceCheckUtils]: 14: Hoare triple {2668#true} assume true; {2668#true} is VALID
[2020-07-08 12:18:42,729 INFO  L275        TraceCheckUtils]: 15: Hoare quadruple {2668#true} {2736#(= nondet_tree_~n~0.offset 0)} #135#return; {2736#(= nondet_tree_~n~0.offset 0)} is VALID
[2020-07-08 12:18:42,730 INFO  L280        TraceCheckUtils]: 16: Hoare triple {2736#(= nondet_tree_~n~0.offset 0)} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~n~0.base, 8 + ~n~0.offset, 4);havoc #t~ret5.base, #t~ret5.offset;#res.base, #res.offset := ~n~0.base, ~n~0.offset; {2743#(and (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0))} is VALID
[2020-07-08 12:18:42,731 INFO  L280        TraceCheckUtils]: 17: Hoare triple {2743#(and (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0))} assume true; {2743#(and (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0))} is VALID
[2020-07-08 12:18:42,732 INFO  L275        TraceCheckUtils]: 18: Hoare quadruple {2743#(and (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0))} {2668#true} #123#return; {2686#(= 0 |main_#t~ret38.offset|)} is VALID
[2020-07-08 12:18:42,732 INFO  L263        TraceCheckUtils]: 19: Hoare triple {2686#(= 0 |main_#t~ret38.offset|)} call task(#t~ret38.base, #t~ret38.offset); {2687#(= 0 |task_#in~t.offset|)} is VALID
[2020-07-08 12:18:42,733 INFO  L280        TraceCheckUtils]: 20: Hoare triple {2687#(= 0 |task_#in~t.offset|)} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2688#(= 0 task_~t.offset)} is VALID
[2020-07-08 12:18:42,733 INFO  L263        TraceCheckUtils]: 21: Hoare triple {2688#(= 0 task_~t.offset)} call #t~ret25 := min(~t.base, ~t.offset); {2668#true} is VALID
[2020-07-08 12:18:42,734 INFO  L280        TraceCheckUtils]: 22: Hoare triple {2668#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2668#true} is VALID
[2020-07-08 12:18:42,734 INFO  L280        TraceCheckUtils]: 23: Hoare triple {2668#true} assume !(~n.base == 0 && ~n.offset == 0);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~n.base, 4 + ~n.offset, 4); {2668#true} is VALID
[2020-07-08 12:18:42,734 INFO  L263        TraceCheckUtils]: 24: Hoare triple {2668#true} call #t~ret7 := min(#t~mem6.base, #t~mem6.offset); {2668#true} is VALID
[2020-07-08 12:18:42,734 INFO  L280        TraceCheckUtils]: 25: Hoare triple {2668#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2668#true} is VALID
[2020-07-08 12:18:42,734 INFO  L280        TraceCheckUtils]: 26: Hoare triple {2668#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2668#true} is VALID
[2020-07-08 12:18:42,734 INFO  L280        TraceCheckUtils]: 27: Hoare triple {2668#true} assume true; {2668#true} is VALID
[2020-07-08 12:18:42,735 INFO  L275        TraceCheckUtils]: 28: Hoare quadruple {2668#true} {2668#true} #129#return; {2668#true} is VALID
[2020-07-08 12:18:42,735 INFO  L280        TraceCheckUtils]: 29: Hoare triple {2668#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;~a~0 := #t~ret7;havoc #t~mem6.base, #t~mem6.offset;havoc #t~ret7;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~n.base, 8 + ~n.offset, 4); {2668#true} is VALID
[2020-07-08 12:18:42,735 INFO  L263        TraceCheckUtils]: 30: Hoare triple {2668#true} call #t~ret9 := min(#t~mem8.base, #t~mem8.offset); {2668#true} is VALID
[2020-07-08 12:18:42,735 INFO  L280        TraceCheckUtils]: 31: Hoare triple {2668#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2668#true} is VALID
[2020-07-08 12:18:42,735 INFO  L280        TraceCheckUtils]: 32: Hoare triple {2668#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2668#true} is VALID
[2020-07-08 12:18:42,736 INFO  L280        TraceCheckUtils]: 33: Hoare triple {2668#true} assume true; {2668#true} is VALID
[2020-07-08 12:18:42,736 INFO  L275        TraceCheckUtils]: 34: Hoare quadruple {2668#true} {2668#true} #131#return; {2668#true} is VALID
[2020-07-08 12:18:42,736 INFO  L280        TraceCheckUtils]: 35: Hoare triple {2668#true} assume -2147483648 <= #t~ret9 && #t~ret9 <= 2147483647;~b~0 := #t~ret9;havoc #t~ret9;havoc #t~mem8.base, #t~mem8.offset; {2668#true} is VALID
[2020-07-08 12:18:42,736 INFO  L280        TraceCheckUtils]: 36: Hoare triple {2668#true} assume ~a~0 <= ~b~0;#res := ~a~0; {2668#true} is VALID
[2020-07-08 12:18:42,736 INFO  L280        TraceCheckUtils]: 37: Hoare triple {2668#true} assume true; {2668#true} is VALID
[2020-07-08 12:18:42,742 INFO  L275        TraceCheckUtils]: 38: Hoare quadruple {2668#true} {2688#(= 0 task_~t.offset)} #137#return; {2688#(= 0 task_~t.offset)} is VALID
[2020-07-08 12:18:42,743 INFO  L280        TraceCheckUtils]: 39: Hoare triple {2688#(= 0 task_~t.offset)} assume -2147483648 <= #t~ret25 && #t~ret25 <= 2147483647;~a~1 := #t~ret25;havoc #t~ret25;call ~#b~1.base, ~#b~1.offset := #Ultimate.allocOnStack(4); {2688#(= 0 task_~t.offset)} is VALID
[2020-07-08 12:18:42,743 INFO  L263        TraceCheckUtils]: 40: Hoare triple {2688#(= 0 task_~t.offset)} call #t~ret26 := size(~t.base, ~t.offset); {2668#true} is VALID
[2020-07-08 12:18:42,744 INFO  L280        TraceCheckUtils]: 41: Hoare triple {2668#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2893#(and (= |size_#in~t.base| size_~t.base) (= |size_#in~t.offset| size_~t.offset))} is VALID
[2020-07-08 12:18:42,744 INFO  L280        TraceCheckUtils]: 42: Hoare triple {2893#(and (= |size_#in~t.base| size_~t.base) (= |size_#in~t.offset| size_~t.offset))} assume !(~t.base == 0 && ~t.offset == 0);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 4); {2897#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID
[2020-07-08 12:18:42,745 INFO  L263        TraceCheckUtils]: 43: Hoare triple {2897#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} call #t~ret22 := size(#t~mem21.base, #t~mem21.offset); {2668#true} is VALID
[2020-07-08 12:18:42,745 INFO  L280        TraceCheckUtils]: 44: Hoare triple {2668#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2668#true} is VALID
[2020-07-08 12:18:42,745 INFO  L280        TraceCheckUtils]: 45: Hoare triple {2668#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2668#true} is VALID
[2020-07-08 12:18:42,745 INFO  L280        TraceCheckUtils]: 46: Hoare triple {2668#true} assume true; {2668#true} is VALID
[2020-07-08 12:18:42,746 INFO  L275        TraceCheckUtils]: 47: Hoare quadruple {2668#true} {2897#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #163#return; {2897#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID
[2020-07-08 12:18:42,747 INFO  L280        TraceCheckUtils]: 48: Hoare triple {2897#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~t.base, 8 + ~t.offset, 4); {2897#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID
[2020-07-08 12:18:42,747 INFO  L263        TraceCheckUtils]: 49: Hoare triple {2897#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} call #t~ret24 := size(#t~mem23.base, #t~mem23.offset); {2668#true} is VALID
[2020-07-08 12:18:42,747 INFO  L280        TraceCheckUtils]: 50: Hoare triple {2668#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2668#true} is VALID
[2020-07-08 12:18:42,747 INFO  L280        TraceCheckUtils]: 51: Hoare triple {2668#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2668#true} is VALID
[2020-07-08 12:18:42,747 INFO  L280        TraceCheckUtils]: 52: Hoare triple {2668#true} assume true; {2668#true} is VALID
[2020-07-08 12:18:42,748 INFO  L275        TraceCheckUtils]: 53: Hoare quadruple {2668#true} {2897#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #165#return; {2897#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID
[2020-07-08 12:18:42,749 INFO  L280        TraceCheckUtils]: 54: Hoare triple {2897#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume -2147483648 <= #t~ret24 && #t~ret24 <= 2147483647;#res := 1 + (#t~ret22 + #t~ret24);havoc #t~mem21.base, #t~mem21.offset;havoc #t~mem23.base, #t~mem23.offset;havoc #t~ret24;havoc #t~ret22; {2897#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID
[2020-07-08 12:18:42,749 INFO  L280        TraceCheckUtils]: 55: Hoare triple {2897#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume true; {2897#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID
[2020-07-08 12:18:42,750 INFO  L275        TraceCheckUtils]: 56: Hoare quadruple {2897#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} {2688#(= 0 task_~t.offset)} #139#return; {2706#(not (= 0 task_~t.base))} is VALID
[2020-07-08 12:18:42,751 INFO  L280        TraceCheckUtils]: 57: Hoare triple {2706#(not (= 0 task_~t.base))} assume -2147483648 <= #t~ret26 && #t~ret26 <= 2147483647;~n~1 := #t~ret26;havoc #t~ret26; {2706#(not (= 0 task_~t.base))} is VALID
[2020-07-08 12:18:42,751 INFO  L263        TraceCheckUtils]: 58: Hoare triple {2706#(not (= 0 task_~t.base))} call assume_abort_if_not((if 0 != ~n~1 then 1 else 0)); {2668#true} is VALID
[2020-07-08 12:18:42,751 INFO  L280        TraceCheckUtils]: 59: Hoare triple {2668#true} ~cond := #in~cond; {2668#true} is VALID
[2020-07-08 12:18:42,752 INFO  L280        TraceCheckUtils]: 60: Hoare triple {2668#true} assume !(0 == ~cond); {2668#true} is VALID
[2020-07-08 12:18:42,752 INFO  L280        TraceCheckUtils]: 61: Hoare triple {2668#true} assume true; {2668#true} is VALID
[2020-07-08 12:18:42,752 INFO  L275        TraceCheckUtils]: 62: Hoare quadruple {2668#true} {2706#(not (= 0 task_~t.base))} #141#return; {2706#(not (= 0 task_~t.base))} is VALID
[2020-07-08 12:18:42,753 INFO  L280        TraceCheckUtils]: 63: Hoare triple {2706#(not (= 0 task_~t.base))} call #t~malloc27.base, #t~malloc27.offset := #Ultimate.allocOnHeap(4 * ~n~1); {2706#(not (= 0 task_~t.base))} is VALID
[2020-07-08 12:18:42,753 INFO  L263        TraceCheckUtils]: 64: Hoare triple {2706#(not (= 0 task_~t.base))} call #Ultimate.meminit(#t~malloc27.base, #t~malloc27.offset, ~n~1, 4, 4 * ~n~1); {2668#true} is VALID
[2020-07-08 12:18:42,753 INFO  L280        TraceCheckUtils]: 65: Hoare triple {2668#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2668#true} is VALID
[2020-07-08 12:18:42,754 INFO  L280        TraceCheckUtils]: 66: Hoare triple {2668#true} assume true; {2668#true} is VALID
[2020-07-08 12:18:42,754 INFO  L275        TraceCheckUtils]: 67: Hoare quadruple {2668#true} {2706#(not (= 0 task_~t.base))} #143#return; {2706#(not (= 0 task_~t.base))} is VALID
[2020-07-08 12:18:42,755 INFO  L280        TraceCheckUtils]: 68: Hoare triple {2706#(not (= 0 task_~t.base))} ~x~0.base, ~x~0.offset := #t~malloc27.base, #t~malloc27.offset; {2706#(not (= 0 task_~t.base))} is VALID
[2020-07-08 12:18:42,755 INFO  L263        TraceCheckUtils]: 69: Hoare triple {2706#(not (= 0 task_~t.base))} call #t~ret28 := tree_inorder(~t.base, ~t.offset, ~x~0.base, ~x~0.offset, ~n~1); {2668#true} is VALID
[2020-07-08 12:18:42,756 INFO  L280        TraceCheckUtils]: 70: Hoare triple {2668#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {2765#(= |tree_inorder_#in~t.base| tree_inorder_~t.base)} is VALID
[2020-07-08 12:18:42,757 INFO  L280        TraceCheckUtils]: 71: Hoare triple {2765#(= |tree_inorder_#in~t.base| tree_inorder_~t.base)} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {2766#(= 0 |tree_inorder_#in~t.base|)} is VALID
[2020-07-08 12:18:42,757 INFO  L280        TraceCheckUtils]: 72: Hoare triple {2766#(= 0 |tree_inorder_#in~t.base|)} assume true; {2766#(= 0 |tree_inorder_#in~t.base|)} is VALID
[2020-07-08 12:18:42,758 INFO  L275        TraceCheckUtils]: 73: Hoare quadruple {2766#(= 0 |tree_inorder_#in~t.base|)} {2706#(not (= 0 task_~t.base))} #145#return; {2669#false} is VALID
[2020-07-08 12:18:42,759 INFO  L280        TraceCheckUtils]: 74: Hoare triple {2669#false} assume -2147483648 <= #t~ret28 && #t~ret28 <= 2147483647;havoc #t~ret28;call #t~mem29 := read~int(~x~0.base, ~x~0.offset, 4); {2669#false} is VALID
[2020-07-08 12:18:42,759 INFO  L263        TraceCheckUtils]: 75: Hoare triple {2669#false} call __VERIFIER_assert((if ~a~1 == #t~mem29 then 1 else 0)); {2669#false} is VALID
[2020-07-08 12:18:42,759 INFO  L280        TraceCheckUtils]: 76: Hoare triple {2669#false} ~cond := #in~cond; {2669#false} is VALID
[2020-07-08 12:18:42,759 INFO  L280        TraceCheckUtils]: 77: Hoare triple {2669#false} assume 0 == ~cond; {2669#false} is VALID
[2020-07-08 12:18:42,759 INFO  L280        TraceCheckUtils]: 78: Hoare triple {2669#false} assume !false; {2669#false} is VALID
[2020-07-08 12:18:42,765 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked.
[2020-07-08 12:18:42,765 INFO  L220   FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2020-07-08 12:18:42,766 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 19
[2020-07-08 12:18:42,766 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916539775]
[2020-07-08 12:18:42,767 INFO  L78                 Accepts]: Start accepts. Automaton has 19 states. Word has length 79
[2020-07-08 12:18:42,776 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2020-07-08 12:18:42,776 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states.
[2020-07-08 12:18:42,901 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-08 12:18:42,901 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 19 states
[2020-07-08 12:18:42,902 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-07-08 12:18:42,902 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2020-07-08 12:18:42,903 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342
[2020-07-08 12:18:42,903 INFO  L87              Difference]: Start difference. First operand 93 states and 118 transitions. Second operand 19 states.
[2020-07-08 12:18:48,586 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-08 12:18:48,587 INFO  L93              Difference]: Finished difference Result 150 states and 192 transitions.
[2020-07-08 12:18:48,587 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. 
[2020-07-08 12:18:48,587 INFO  L78                 Accepts]: Start accepts. Automaton has 19 states. Word has length 79
[2020-07-08 12:18:48,588 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-08 12:18:48,588 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2020-07-08 12:18:48,593 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 188 transitions.
[2020-07-08 12:18:48,593 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2020-07-08 12:18:48,598 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 188 transitions.
[2020-07-08 12:18:48,598 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 188 transitions.
[2020-07-08 12:18:48,966 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-08 12:18:48,970 INFO  L225             Difference]: With dead ends: 150
[2020-07-08 12:18:48,971 INFO  L226             Difference]: Without dead ends: 98
[2020-07-08 12:18:48,972 INFO  L675         BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=172, Invalid=1018, Unknown=0, NotChecked=0, Total=1190
[2020-07-08 12:18:48,972 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 98 states.
[2020-07-08 12:18:49,080 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97.
[2020-07-08 12:18:49,081 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-08 12:18:49,081 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand 97 states.
[2020-07-08 12:18:49,081 INFO  L74              IsIncluded]: Start isIncluded. First operand 98 states. Second operand 97 states.
[2020-07-08 12:18:49,081 INFO  L87              Difference]: Start difference. First operand 98 states. Second operand 97 states.
[2020-07-08 12:18:49,085 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-08 12:18:49,085 INFO  L93              Difference]: Finished difference Result 98 states and 123 transitions.
[2020-07-08 12:18:49,085 INFO  L276                IsEmpty]: Start isEmpty. Operand 98 states and 123 transitions.
[2020-07-08 12:18:49,086 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-08 12:18:49,086 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2020-07-08 12:18:49,087 INFO  L74              IsIncluded]: Start isIncluded. First operand 97 states. Second operand 98 states.
[2020-07-08 12:18:49,087 INFO  L87              Difference]: Start difference. First operand 97 states. Second operand 98 states.
[2020-07-08 12:18:49,092 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-08 12:18:49,092 INFO  L93              Difference]: Finished difference Result 98 states and 123 transitions.
[2020-07-08 12:18:49,092 INFO  L276                IsEmpty]: Start isEmpty. Operand 98 states and 123 transitions.
[2020-07-08 12:18:49,093 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-08 12:18:49,093 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2020-07-08 12:18:49,093 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2020-07-08 12:18:49,093 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-08 12:18:49,093 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 97 states.
[2020-07-08 12:18:49,098 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 122 transitions.
[2020-07-08 12:18:49,098 INFO  L78                 Accepts]: Start accepts. Automaton has 97 states and 122 transitions. Word has length 79
[2020-07-08 12:18:49,098 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-07-08 12:18:49,098 INFO  L479      AbstractCegarLoop]: Abstraction has 97 states and 122 transitions.
[2020-07-08 12:18:49,099 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 19 states.
[2020-07-08 12:18:49,099 INFO  L276                IsEmpty]: Start isEmpty. Operand 97 states and 122 transitions.
[2020-07-08 12:18:49,100 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 92
[2020-07-08 12:18:49,100 INFO  L414         BasicCegarLoop]: Found error trace
[2020-07-08 12:18:49,100 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-07-08 12:18:49,315 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2020-07-08 12:18:49,315 INFO  L427      AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-08 12:18:49,316 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-07-08 12:18:49,316 INFO  L82        PathProgramCache]: Analyzing trace with hash -1062270604, now seen corresponding path program 1 times
[2020-07-08 12:18:49,317 INFO  L163   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-07-08 12:18:49,317 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101233102]
[2020-07-08 12:18:49,317 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-08 12:18:49,389 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-07-08 12:18:49,440 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2020-07-08 12:18:49,498 INFO  L174   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2020-07-08 12:18:49,498 INFO  L520         BasicCegarLoop]: Counterexample might be feasible
[2020-07-08 12:18:49,499 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2020-07-08 12:18:49,604 WARN  L170   areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation
[2020-07-08 12:18:49,605 WARN  L170   areAnnotationChecker]: minENTRY has no Hoare annotation
[2020-07-08 12:18:49,605 WARN  L170   areAnnotationChecker]: taskENTRY has no Hoare annotation
[2020-07-08 12:18:49,605 WARN  L170   areAnnotationChecker]: sizeENTRY has no Hoare annotation
[2020-07-08 12:18:49,605 WARN  L170   areAnnotationChecker]: nondet_treeENTRY has no Hoare annotation
[2020-07-08 12:18:49,605 WARN  L170   areAnnotationChecker]: nondet_treeENTRY has no Hoare annotation
[2020-07-08 12:18:49,605 WARN  L170   areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation
[2020-07-08 12:18:49,605 WARN  L170   areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation
[2020-07-08 12:18:49,606 WARN  L170   areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation
[2020-07-08 12:18:49,606 WARN  L170   areAnnotationChecker]: mainENTRY has no Hoare annotation
[2020-07-08 12:18:49,606 WARN  L170   areAnnotationChecker]: mainENTRY has no Hoare annotation
[2020-07-08 12:18:49,606 WARN  L170   areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation
[2020-07-08 12:18:49,606 WARN  L170   areAnnotationChecker]: #Ultimate.meminitENTRY has no Hoare annotation
[2020-07-08 12:18:49,606 WARN  L170   areAnnotationChecker]: tree_inorderENTRY has no Hoare annotation
[2020-07-08 12:18:49,606 WARN  L170   areAnnotationChecker]: tree_delENTRY has no Hoare annotation
[2020-07-08 12:18:49,607 WARN  L170   areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation
[2020-07-08 12:18:49,607 WARN  L170   areAnnotationChecker]: L35 has no Hoare annotation
[2020-07-08 12:18:49,607 WARN  L170   areAnnotationChecker]: L35 has no Hoare annotation
[2020-07-08 12:18:49,607 WARN  L170   areAnnotationChecker]: L74 has no Hoare annotation
[2020-07-08 12:18:49,607 WARN  L170   areAnnotationChecker]: L74 has no Hoare annotation
[2020-07-08 12:18:49,607 WARN  L170   areAnnotationChecker]: L69 has no Hoare annotation
[2020-07-08 12:18:49,607 WARN  L170   areAnnotationChecker]: L69 has no Hoare annotation
[2020-07-08 12:18:49,608 WARN  L170   areAnnotationChecker]: nondet_treeFINAL has no Hoare annotation
[2020-07-08 12:18:49,608 WARN  L170   areAnnotationChecker]: L28 has no Hoare annotation
[2020-07-08 12:18:49,608 WARN  L170   areAnnotationChecker]: L28 has no Hoare annotation
[2020-07-08 12:18:49,608 WARN  L170   areAnnotationChecker]: L-1 has no Hoare annotation
[2020-07-08 12:18:49,608 WARN  L170   areAnnotationChecker]: L-1 has no Hoare annotation
[2020-07-08 12:18:49,608 WARN  L170   areAnnotationChecker]: L10 has no Hoare annotation
[2020-07-08 12:18:49,608 WARN  L170   areAnnotationChecker]: L10 has no Hoare annotation
[2020-07-08 12:18:49,608 WARN  L170   areAnnotationChecker]: L96 has no Hoare annotation
[2020-07-08 12:18:49,609 WARN  L170   areAnnotationChecker]: L96 has no Hoare annotation
[2020-07-08 12:18:49,609 WARN  L170   areAnnotationChecker]: L14 has no Hoare annotation
[2020-07-08 12:18:49,609 WARN  L170   areAnnotationChecker]: L14 has no Hoare annotation
[2020-07-08 12:18:49,609 WARN  L170   areAnnotationChecker]: #Ultimate.meminitFINAL has no Hoare annotation
[2020-07-08 12:18:49,609 WARN  L170   areAnnotationChecker]: L58 has no Hoare annotation
[2020-07-08 12:18:49,609 WARN  L170   areAnnotationChecker]: L58 has no Hoare annotation
[2020-07-08 12:18:49,609 WARN  L170   areAnnotationChecker]: L48 has no Hoare annotation
[2020-07-08 12:18:49,609 WARN  L170   areAnnotationChecker]: L48 has no Hoare annotation
[2020-07-08 12:18:49,610 WARN  L170   areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation
[2020-07-08 12:18:49,610 WARN  L170   areAnnotationChecker]: minFINAL has no Hoare annotation
[2020-07-08 12:18:49,610 WARN  L170   areAnnotationChecker]: L38 has no Hoare annotation
[2020-07-08 12:18:49,610 WARN  L170   areAnnotationChecker]: L38 has no Hoare annotation
[2020-07-08 12:18:49,610 WARN  L170   areAnnotationChecker]: L74-1 has no Hoare annotation
[2020-07-08 12:18:49,610 WARN  L170   areAnnotationChecker]: sizeFINAL has no Hoare annotation
[2020-07-08 12:18:49,610 WARN  L170   areAnnotationChecker]: L70 has no Hoare annotation
[2020-07-08 12:18:49,610 WARN  L170   areAnnotationChecker]: L70 has no Hoare annotation
[2020-07-08 12:18:49,611 WARN  L170   areAnnotationChecker]: nondet_treeEXIT has no Hoare annotation
[2020-07-08 12:18:49,611 WARN  L170   areAnnotationChecker]: nondet_treeEXIT has no Hoare annotation
[2020-07-08 12:18:49,611 WARN  L170   areAnnotationChecker]: nondet_treeEXIT has no Hoare annotation
[2020-07-08 12:18:49,611 WARN  L170   areAnnotationChecker]: L28-1 has no Hoare annotation
[2020-07-08 12:18:49,611 WARN  L170   areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation
[2020-07-08 12:18:49,611 WARN  L170   areAnnotationChecker]: L10-2 has no Hoare annotation
[2020-07-08 12:18:49,611 WARN  L170   areAnnotationChecker]: L96-1 has no Hoare annotation
[2020-07-08 12:18:49,612 WARN  L170   areAnnotationChecker]: L14-1 has no Hoare annotation
[2020-07-08 12:18:49,612 WARN  L170   areAnnotationChecker]: L14-1 has no Hoare annotation
[2020-07-08 12:18:49,612 WARN  L170   areAnnotationChecker]: L14-3 has no Hoare annotation
[2020-07-08 12:18:49,612 WARN  L170   areAnnotationChecker]: #Ultimate.meminitEXIT has no Hoare annotation
[2020-07-08 12:18:49,612 WARN  L170   areAnnotationChecker]: #Ultimate.meminitEXIT has no Hoare annotation
[2020-07-08 12:18:49,612 WARN  L170   areAnnotationChecker]: tree_inorderFINAL has no Hoare annotation
[2020-07-08 12:18:49,612 WARN  L170   areAnnotationChecker]: L61 has no Hoare annotation
[2020-07-08 12:18:49,612 WARN  L170   areAnnotationChecker]: L61 has no Hoare annotation
[2020-07-08 12:18:49,613 WARN  L170   areAnnotationChecker]: tree_delFINAL has no Hoare annotation
[2020-07-08 12:18:49,613 WARN  L170   areAnnotationChecker]: L52 has no Hoare annotation
[2020-07-08 12:18:49,613 WARN  L170   areAnnotationChecker]: L52 has no Hoare annotation
[2020-07-08 12:18:49,613 WARN  L170   areAnnotationChecker]: minEXIT has no Hoare annotation
[2020-07-08 12:18:49,614 WARN  L170   areAnnotationChecker]: minEXIT has no Hoare annotation
[2020-07-08 12:18:49,614 WARN  L170   areAnnotationChecker]: minEXIT has no Hoare annotation
[2020-07-08 12:18:49,614 WARN  L170   areAnnotationChecker]: L38-1 has no Hoare annotation
[2020-07-08 12:18:49,614 WARN  L170   areAnnotationChecker]: L77 has no Hoare annotation
[2020-07-08 12:18:49,614 WARN  L170   areAnnotationChecker]: L77 has no Hoare annotation
[2020-07-08 12:18:49,614 WARN  L170   areAnnotationChecker]: sizeEXIT has no Hoare annotation
[2020-07-08 12:18:49,614 WARN  L170   areAnnotationChecker]: sizeEXIT has no Hoare annotation
[2020-07-08 12:18:49,615 WARN  L170   areAnnotationChecker]: sizeEXIT has no Hoare annotation
[2020-07-08 12:18:49,615 WARN  L170   areAnnotationChecker]: sizeEXIT has no Hoare annotation
[2020-07-08 12:18:49,615 WARN  L170   areAnnotationChecker]: L70-1 has no Hoare annotation
[2020-07-08 12:18:49,615 WARN  L170   areAnnotationChecker]: L29-1 has no Hoare annotation
[2020-07-08 12:18:49,615 WARN  L170   areAnnotationChecker]: L29 has no Hoare annotation
[2020-07-08 12:18:49,615 WARN  L170   areAnnotationChecker]: L29 has no Hoare annotation
[2020-07-08 12:18:49,615 WARN  L170   areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation
[2020-07-08 12:18:49,616 WARN  L170   areAnnotationChecker]: mainFINAL has no Hoare annotation
[2020-07-08 12:18:49,616 WARN  L170   areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation
[2020-07-08 12:18:49,616 WARN  L170   areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation
[2020-07-08 12:18:49,616 WARN  L170   areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation
[2020-07-08 12:18:49,616 WARN  L170   areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation
[2020-07-08 12:18:49,616 WARN  L170   areAnnotationChecker]: L79-1 has no Hoare annotation
[2020-07-08 12:18:49,616 WARN  L170   areAnnotationChecker]: L86-1 has no Hoare annotation
[2020-07-08 12:18:49,616 WARN  L170   areAnnotationChecker]: tree_inorderEXIT has no Hoare annotation
[2020-07-08 12:18:49,617 WARN  L170   areAnnotationChecker]: tree_inorderEXIT has no Hoare annotation
[2020-07-08 12:18:49,617 WARN  L170   areAnnotationChecker]: tree_inorderEXIT has no Hoare annotation
[2020-07-08 12:18:49,617 WARN  L170   areAnnotationChecker]: tree_inorderEXIT has no Hoare annotation
[2020-07-08 12:18:49,617 WARN  L170   areAnnotationChecker]: L61-1 has no Hoare annotation
[2020-07-08 12:18:49,617 WARN  L170   areAnnotationChecker]: tree_delEXIT has no Hoare annotation
[2020-07-08 12:18:49,617 WARN  L170   areAnnotationChecker]: tree_delEXIT has no Hoare annotation
[2020-07-08 12:18:49,617 WARN  L170   areAnnotationChecker]: L52-1 has no Hoare annotation
[2020-07-08 12:18:49,617 WARN  L170   areAnnotationChecker]: L39-1 has no Hoare annotation
[2020-07-08 12:18:49,618 WARN  L170   areAnnotationChecker]: L39 has no Hoare annotation
[2020-07-08 12:18:49,618 WARN  L170   areAnnotationChecker]: L39 has no Hoare annotation
[2020-07-08 12:18:49,618 WARN  L170   areAnnotationChecker]: L77-1 has no Hoare annotation
[2020-07-08 12:18:49,618 WARN  L170   areAnnotationChecker]: L85-1 has no Hoare annotation
[2020-07-08 12:18:49,618 WARN  L170   areAnnotationChecker]: L70-3 has no Hoare annotation
[2020-07-08 12:18:49,618 WARN  L170   areAnnotationChecker]: L70-2 has no Hoare annotation
[2020-07-08 12:18:49,618 WARN  L170   areAnnotationChecker]: L70-2 has no Hoare annotation
[2020-07-08 12:18:49,618 WARN  L170   areAnnotationChecker]: L78-1 has no Hoare annotation
[2020-07-08 12:18:49,618 WARN  L170   areAnnotationChecker]: mainEXIT has no Hoare annotation
[2020-07-08 12:18:49,618 WARN  L170   areAnnotationChecker]: L81-1 has no Hoare annotation
[2020-07-08 12:18:49,619 WARN  L170   areAnnotationChecker]: L84-1 has no Hoare annotation
[2020-07-08 12:18:49,619 WARN  L170   areAnnotationChecker]: L89-1 has no Hoare annotation
[2020-07-08 12:18:49,619 WARN  L170   areAnnotationChecker]: L92-1 has no Hoare annotation
[2020-07-08 12:18:49,619 WARN  L170   areAnnotationChecker]: L80 has no Hoare annotation
[2020-07-08 12:18:49,619 WARN  L170   areAnnotationChecker]: L80 has no Hoare annotation
[2020-07-08 12:18:49,619 WARN  L170   areAnnotationChecker]: L87 has no Hoare annotation
[2020-07-08 12:18:49,619 WARN  L170   areAnnotationChecker]: L87 has no Hoare annotation
[2020-07-08 12:18:49,619 WARN  L170   areAnnotationChecker]: L80-1 has no Hoare annotation
[2020-07-08 12:18:49,619 WARN  L170   areAnnotationChecker]: L87-1 has no Hoare annotation
[2020-07-08 12:18:49,620 WARN  L170   areAnnotationChecker]: L63-1 has no Hoare annotation
[2020-07-08 12:18:49,620 WARN  L170   areAnnotationChecker]: L63 has no Hoare annotation
[2020-07-08 12:18:49,620 WARN  L170   areAnnotationChecker]: L63 has no Hoare annotation
[2020-07-08 12:18:49,620 WARN  L170   areAnnotationChecker]: L83-1 has no Hoare annotation
[2020-07-08 12:18:49,620 WARN  L170   areAnnotationChecker]: L40 has no Hoare annotation
[2020-07-08 12:18:49,620 WARN  L170   areAnnotationChecker]: L40 has no Hoare annotation
[2020-07-08 12:18:49,620 WARN  L170   areAnnotationChecker]: L78 has no Hoare annotation
[2020-07-08 12:18:49,620 WARN  L170   areAnnotationChecker]: L78 has no Hoare annotation
[2020-07-08 12:18:49,620 WARN  L170   areAnnotationChecker]: L86 has no Hoare annotation
[2020-07-08 12:18:49,620 WARN  L170   areAnnotationChecker]: L86 has no Hoare annotation
[2020-07-08 12:18:49,621 WARN  L170   areAnnotationChecker]: L79 has no Hoare annotation
[2020-07-08 12:18:49,621 WARN  L170   areAnnotationChecker]: L79 has no Hoare annotation
[2020-07-08 12:18:49,621 WARN  L170   areAnnotationChecker]: L83 has no Hoare annotation
[2020-07-08 12:18:49,621 WARN  L170   areAnnotationChecker]: L83 has no Hoare annotation
[2020-07-08 12:18:49,621 WARN  L170   areAnnotationChecker]: L85 has no Hoare annotation
[2020-07-08 12:18:49,621 WARN  L170   areAnnotationChecker]: L85 has no Hoare annotation
[2020-07-08 12:18:49,621 WARN  L170   areAnnotationChecker]: L91-3 has no Hoare annotation
[2020-07-08 12:18:49,621 WARN  L170   areAnnotationChecker]: L91-3 has no Hoare annotation
[2020-07-08 12:18:49,621 WARN  L170   areAnnotationChecker]: L91-3 has no Hoare annotation
[2020-07-08 12:18:49,622 WARN  L170   areAnnotationChecker]: L91-2 has no Hoare annotation
[2020-07-08 12:18:49,622 WARN  L170   areAnnotationChecker]: L81 has no Hoare annotation
[2020-07-08 12:18:49,622 WARN  L170   areAnnotationChecker]: L81 has no Hoare annotation
[2020-07-08 12:18:49,622 WARN  L170   areAnnotationChecker]: L89 has no Hoare annotation
[2020-07-08 12:18:49,622 WARN  L170   areAnnotationChecker]: L89 has no Hoare annotation
[2020-07-08 12:18:49,622 WARN  L170   areAnnotationChecker]: L84 has no Hoare annotation
[2020-07-08 12:18:49,622 WARN  L170   areAnnotationChecker]: L84 has no Hoare annotation
[2020-07-08 12:18:49,622 WARN  L170   areAnnotationChecker]: L91-4 has no Hoare annotation
[2020-07-08 12:18:49,622 WARN  L170   areAnnotationChecker]: L92 has no Hoare annotation
[2020-07-08 12:18:49,623 WARN  L170   areAnnotationChecker]: L92 has no Hoare annotation
[2020-07-08 12:18:49,623 WARN  L170   areAnnotationChecker]: taskFINAL has no Hoare annotation
[2020-07-08 12:18:49,623 WARN  L170   areAnnotationChecker]: taskEXIT has no Hoare annotation
[2020-07-08 12:18:49,623 INFO  L163   areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[2020-07-08 12:18:49,628 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 12:18:49 BoogieIcfgContainer
[2020-07-08 12:18:49,628 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-07-08 12:18:49,632 INFO  L168              Benchmark]: Toolchain (without parser) took 24074.05 ms. Allocated memory was 138.4 MB in the beginning and 458.8 MB in the end (delta: 320.3 MB). Free memory was 101.0 MB in the beginning and 357.7 MB in the end (delta: -256.7 MB). Peak memory consumption was 63.7 MB. Max. memory is 7.1 GB.
[2020-07-08 12:18:49,639 INFO  L168              Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 138.4 MB. Free memory was 120.2 MB in the beginning and 120.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
[2020-07-08 12:18:49,640 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 438.64 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 100.8 MB in the beginning and 177.1 MB in the end (delta: -76.3 MB). Peak memory consumption was 23.9 MB. Max. memory is 7.1 GB.
[2020-07-08 12:18:49,641 INFO  L168              Benchmark]: Boogie Preprocessor took 61.82 ms. Allocated memory is still 201.9 MB. Free memory was 177.1 MB in the beginning and 173.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB.
[2020-07-08 12:18:49,641 INFO  L168              Benchmark]: RCFGBuilder took 829.59 ms. Allocated memory is still 201.9 MB. Free memory was 173.8 MB in the beginning and 116.3 MB in the end (delta: 57.5 MB). Peak memory consumption was 57.5 MB. Max. memory is 7.1 GB.
[2020-07-08 12:18:49,642 INFO  L168              Benchmark]: TraceAbstraction took 22737.25 ms. Allocated memory was 201.9 MB in the beginning and 458.8 MB in the end (delta: 256.9 MB). Free memory was 115.7 MB in the beginning and 357.7 MB in the end (delta: -242.0 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB.
[2020-07-08 12:18:49,652 INFO  L336   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - AssertionsEnabledResult: Assertions are enabled
    Assertions are enabled
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.25 ms. Allocated memory is still 138.4 MB. Free memory was 120.2 MB in the beginning and 120.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
 * CACSL2BoogieTranslator took 438.64 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 100.8 MB in the beginning and 177.1 MB in the end (delta: -76.3 MB). Peak memory consumption was 23.9 MB. Max. memory is 7.1 GB.
 * Boogie Preprocessor took 61.82 ms. Allocated memory is still 201.9 MB. Free memory was 177.1 MB in the beginning and 173.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB.
 * RCFGBuilder took 829.59 ms. Allocated memory is still 201.9 MB. Free memory was 173.8 MB in the beginning and 116.3 MB in the end (delta: 57.5 MB). Peak memory consumption was 57.5 MB. Max. memory is 7.1 GB.
 * TraceAbstraction took 22737.25 ms. Allocated memory was 201.9 MB in the beginning and 458.8 MB in the end (delta: 256.9 MB). Free memory was 115.7 MB in the beginning and 357.7 MB in the end (delta: -242.0 MB). Peak memory consumption was 14.9 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: 
[L96]  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}]
[L96]  RET, EXPR    nondet_tree()
       VAL          [nondet_tree()={-1:0}]
[L96]  CALL         task(nondet_tree())
       VAL          [t={-1:0}]
[L74]  CALL, EXPR   min(t)
       VAL          [n={-1:0}]
[L35]  COND FALSE   !(!n)
[L38]  EXPR         n->left
       VAL          [n={-1:0}, n={-1:0}, n->left={0:0}]
[L38]  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}]
[L38]  RET, EXPR    min(n->left)
       VAL          [min(n->left)=2147483647, n={-1:0}, n={-1:0}, n->left={0:0}]
[L38]               int a = min(n->left);
[L39]  EXPR         n->right
       VAL          [a=2147483647, n={-1:0}, n={-1:0}, n->right={0:0}]
[L39]  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}]
[L39]  RET, EXPR    min(n->right)
       VAL          [a=2147483647, min(n->right)=2147483647, n={-1:0}, n={-1:0}, n->right={0:0}]
[L39]               int b = min(n->right);
[L40]  COND TRUE    a <= b
[L40]               return a;
       VAL          [\result=2147483647, a=2147483647, b=2147483647, n={-1:0}, n={-1:0}]
[L74]  RET, EXPR    min(t)
       VAL          [min(t)=2147483647, t={-1:0}, t={-1:0}]
[L74]               int a = min(t);
[L75]               int b;
       VAL          [a=2147483647, b={2:0}, t={-1:0}, t={-1:0}]
[L77]  CALL, EXPR   size(t)
       VAL          [t={-1:0}]
[L69]  COND FALSE   !(!t)
[L70]  EXPR         t->left
       VAL          [t={-1:0}, t={-1:0}, t->left={0:0}]
[L70]  CALL, EXPR   size(t->left)
       VAL          [t={0:0}]
[L69]  COND TRUE    !t
[L69]               return 0;
       VAL          [\result=0, t={0:0}, t={0:0}]
[L70]  RET, EXPR    size(t->left)
       VAL          [size(t->left)=0, t={-1:0}, t={-1:0}, t->left={0:0}]
[L70]  EXPR         t->right
       VAL          [size(t->left)=0, t={-1:0}, t={-1:0}, t->left={0:0}, t->right={0:0}]
[L70]  CALL, EXPR   size(t->right)
       VAL          [t={0:0}]
[L69]  COND TRUE    !t
[L69]               return 0;
       VAL          [\result=0, t={0:0}, t={0:0}]
[L70]  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}]
[L70]               return size(t->left) + size(t->right) + 1;
[L77]  RET, EXPR    size(t)
       VAL          [a=2147483647, b={2:0}, size(t)=1, t={-1:0}, t={-1:0}]
[L77]               int n = size(t);
[L78]  CALL         assume_abort_if_not(n != 0)
       VAL          [\old(cond)=1]
[L10]  COND FALSE   !(!cond)
       VAL          [\old(cond)=1, cond=1]
[L78]  RET          assume_abort_if_not(n != 0)
       VAL          [a=2147483647, b={2:0}, n=1, t={-1:0}, t={-1:0}]
[L79]  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}]
[L79]               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}]
[L80]  CALL         tree_inorder(t, x, n)
       VAL          [\old(i)=1, a={-2:0}, t={-1:0}]
[L58]  COND FALSE   !(!t)
[L61]  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}]
[L61]  CALL, EXPR   tree_inorder(t->left,  a, i)
       VAL          [\old(i)=1, a={-2:0}, t={0:0}]
[L58]  COND TRUE    !t
[L59]               return i;
       VAL          [\old(i)=1, \result=1, a={-2:0}, a={-2:0}, i=1, t={0:0}, t={0:0}]
[L61]  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]
[L61]               i = tree_inorder(t->left,  a, i)
[L62]  EXPR         i++
[L62]  EXPR         t->data
[L62]               a[i++] = t->data
[L63]  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}]
[L63]  CALL, EXPR   tree_inorder(t->right, a, i)
       VAL          [\old(i)=2, a={-2:0}, t={0:0}]
[L58]  COND TRUE    !t
[L59]               return i;
       VAL          [\old(i)=2, \result=2, a={-2:0}, a={-2:0}, i=2, t={0:0}, t={0:0}]
[L63]  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]
[L63]               i = tree_inorder(t->right, a, i)
[L64]               return i;
       VAL          [\old(i)=1, \result=2, a={-2:0}, a={-2:0}, i=2, t={-1:0}, t={-1:0}]
[L80]  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}]
[L81]  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]
[L81]  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, 95 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 22.5s, OverallIterations: 6, TraceHistogramMax: 3, AutomataDifference: 17.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 426 SDtfs, 645 SDslu, 1730 SDs, 0 SdLazy, 2363 SolverSat, 657 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 309 GetRequests, 213 SyntacticMatches, 4 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 5 MinimizatonAttempts, 19 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 515 NumberOfCodeBlocks, 515 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 417 ConstructedInterpolants, 0 QuantifiedInterpolants, 76570 SizeOfPredicates, 16 NumberOfNonLiveVariables, 630 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 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...