/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/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/verifythis/tree_del_iter_incorrect.c


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


This is Ultimate 0.1.25-8fc6572
[2020-07-10 20:25:53,044 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2020-07-10 20:25:53,047 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2020-07-10 20:25:53,068 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-07-10 20:25:53,068 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-07-10 20:25:53,071 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-07-10 20:25:53,073 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-07-10 20:25:53,084 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2020-07-10 20:25:53,088 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-07-10 20:25:53,092 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-07-10 20:25:53,093 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2020-07-10 20:25:53,097 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-07-10 20:25:53,097 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-07-10 20:25:53,099 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-07-10 20:25:53,101 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-07-10 20:25:53,102 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-07-10 20:25:53,104 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-07-10 20:25:53,106 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-07-10 20:25:53,108 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-07-10 20:25:53,113 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2020-07-10 20:25:53,118 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-07-10 20:25:53,122 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-07-10 20:25:53,123 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2020-07-10 20:25:53,124 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-07-10 20:25:53,126 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-07-10 20:25:53,127 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-07-10 20:25:53,127 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-07-10 20:25:53,130 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-07-10 20:25:53,130 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-07-10 20:25:53,132 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-07-10 20:25:53,133 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-07-10 20:25:53,134 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-07-10 20:25:53,135 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-07-10 20:25:53,136 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2020-07-10 20:25:53,137 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-07-10 20:25:53,137 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2020-07-10 20:25:53,138 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-07-10 20:25:53,138 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-07-10 20:25:53,138 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2020-07-10 20:25:53,139 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2020-07-10 20:25:53,141 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2020-07-10 20:25:53,141 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf
[2020-07-10 20:25:53,171 INFO  L113        SettingsManager]: Loading preferences was successful
[2020-07-10 20:25:53,172 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2020-07-10 20:25:53,173 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-07-10 20:25:53,173 INFO  L138        SettingsManager]:  * sizeof long=4
[2020-07-10 20:25:53,174 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2020-07-10 20:25:53,174 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2020-07-10 20:25:53,174 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2020-07-10 20:25:53,176 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2020-07-10 20:25:53,177 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-07-10 20:25:53,177 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2020-07-10 20:25:53,177 INFO  L138        SettingsManager]:  * sizeof long double=12
[2020-07-10 20:25:53,177 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2020-07-10 20:25:53,177 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2020-07-10 20:25:53,178 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2020-07-10 20:25:53,178 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-07-10 20:25:53,178 INFO  L138        SettingsManager]:  * Size of a code block=SingleStatement
[2020-07-10 20:25:53,178 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2020-07-10 20:25:53,178 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2020-07-10 20:25:53,179 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-07-10 20:25:53,179 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-07-10 20:25:53,179 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=AcceleratedInterpolation
[2020-07-10 20:25:53,181 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-07-10 20:25:53,181 INFO  L138        SettingsManager]:  * Use separate solver for trace checks=false
[2020-07-10 20:25:53,503 INFO  L81    nceAwareModelManager]: Repository-Root is: /tmp
[2020-07-10 20:25:53,518 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-07-10 20:25:53,523 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-07-10 20:25:53,525 INFO  L271        PluginConnector]: Initializing CDTParser...
[2020-07-10 20:25:53,525 INFO  L275        PluginConnector]: CDTParser initialized
[2020-07-10 20:25:53,526 INFO  L429   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/tree_del_iter_incorrect.c
[2020-07-10 20:25:53,620 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c028f76b2/8f28a6b6ee434c848547820333437120/FLAG341516cd0
[2020-07-10 20:25:54,084 INFO  L306              CDTParser]: Found 1 translation units.
[2020-07-10 20:25:54,084 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_iter_incorrect.c
[2020-07-10 20:25:54,093 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c028f76b2/8f28a6b6ee434c848547820333437120/FLAG341516cd0
[2020-07-10 20:25:54,442 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c028f76b2/8f28a6b6ee434c848547820333437120
[2020-07-10 20:25:54,453 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-07-10 20:25:54,455 INFO  L131        ToolchainWalker]: Walking toolchain with 4 elements.
[2020-07-10 20:25:54,456 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-07-10 20:25:54,456 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-07-10 20:25:54,461 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2020-07-10 20:25:54,462 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:25:54" (1/1) ...
[2020-07-10 20:25:54,466 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7eedc7be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:25:54, skipping insertion in model container
[2020-07-10 20:25:54,466 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:25:54" (1/1) ...
[2020-07-10 20:25:54,475 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2020-07-10 20:25:54,506 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2020-07-10 20:25:54,766 WARN  L1484              CHandler]: Possible shadowing of function min
[2020-07-10 20:25:54,785 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-07-10 20:25:54,804 INFO  L203         MainTranslator]: Completed pre-run
[2020-07-10 20:25:54,978 WARN  L1484              CHandler]: Possible shadowing of function min
[2020-07-10 20:25:55,012 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2020-07-10 20:25:55,043 INFO  L208         MainTranslator]: Completed translation
[2020-07-10 20:25:55,043 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:25:55 WrapperNode
[2020-07-10 20:25:55,044 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-07-10 20:25:55,044 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-07-10 20:25:55,045 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2020-07-10 20:25:55,045 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2020-07-10 20:25:55,059 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:25:55" (1/1) ...
[2020-07-10 20:25:55,060 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:25:55" (1/1) ...
[2020-07-10 20:25:55,073 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:25:55" (1/1) ...
[2020-07-10 20:25:55,073 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:25:55" (1/1) ...
[2020-07-10 20:25:55,101 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:25:55" (1/1) ...
[2020-07-10 20:25:55,109 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:25:55" (1/1) ...
[2020-07-10 20:25:55,112 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:25:55" (1/1) ...
[2020-07-10 20:25:55,120 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-07-10 20:25:55,120 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-07-10 20:25:55,121 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2020-07-10 20:25:55,121 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2020-07-10 20:25:55,122 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:25:55" (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-10 20:25:55,186 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2020-07-10 20:25:55,186 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-07-10 20:25:55,187 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2020-07-10 20:25:55,187 INFO  L138     BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2020-07-10 20:25:55,187 INFO  L138     BoogieDeclarations]: Found implementation of procedure nondet_tree
[2020-07-10 20:25:55,187 INFO  L138     BoogieDeclarations]: Found implementation of procedure min
[2020-07-10 20:25:55,187 INFO  L138     BoogieDeclarations]: Found implementation of procedure tree_del
[2020-07-10 20:25:55,188 INFO  L138     BoogieDeclarations]: Found implementation of procedure tree_inorder
[2020-07-10 20:25:55,188 INFO  L138     BoogieDeclarations]: Found implementation of procedure size
[2020-07-10 20:25:55,188 INFO  L138     BoogieDeclarations]: Found implementation of procedure task
[2020-07-10 20:25:55,188 INFO  L138     BoogieDeclarations]: Found implementation of procedure main
[2020-07-10 20:25:55,188 INFO  L138     BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit
[2020-07-10 20:25:55,188 INFO  L130     BoogieDeclarations]: Found specification of procedure calloc
[2020-07-10 20:25:55,189 INFO  L130     BoogieDeclarations]: Found specification of procedure malloc
[2020-07-10 20:25:55,189 INFO  L130     BoogieDeclarations]: Found specification of procedure free
[2020-07-10 20:25:55,189 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2020-07-10 20:25:55,189 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool
[2020-07-10 20:25:55,189 INFO  L130     BoogieDeclarations]: Found specification of procedure abort
[2020-07-10 20:25:55,190 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2020-07-10 20:25:55,190 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_error
[2020-07-10 20:25:55,190 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2020-07-10 20:25:55,190 INFO  L130     BoogieDeclarations]: Found specification of procedure nondet_tree
[2020-07-10 20:25:55,190 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2020-07-10 20:25:55,190 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2020-07-10 20:25:55,191 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2020-07-10 20:25:55,191 INFO  L130     BoogieDeclarations]: Found specification of procedure min
[2020-07-10 20:25:55,191 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2020-07-10 20:25:55,191 INFO  L130     BoogieDeclarations]: Found specification of procedure tree_del
[2020-07-10 20:25:55,191 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2020-07-10 20:25:55,191 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2020-07-10 20:25:55,192 INFO  L130     BoogieDeclarations]: Found specification of procedure tree_inorder
[2020-07-10 20:25:55,192 INFO  L130     BoogieDeclarations]: Found specification of procedure size
[2020-07-10 20:25:55,192 INFO  L130     BoogieDeclarations]: Found specification of procedure task
[2020-07-10 20:25:55,192 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2020-07-10 20:25:55,192 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.meminit
[2020-07-10 20:25:55,193 INFO  L130     BoogieDeclarations]: Found specification of procedure main
[2020-07-10 20:25:55,193 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2020-07-10 20:25:55,193 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-07-10 20:25:56,160 INFO  L290             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-07-10 20:25:56,160 INFO  L295             CfgBuilder]: Removed 2 assume(true) statements.
[2020-07-10 20:25:56,166 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:25:56 BoogieIcfgContainer
[2020-07-10 20:25:56,167 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-07-10 20:25:56,168 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-07-10 20:25:56,168 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2020-07-10 20:25:56,172 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2020-07-10 20:25:56,172 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 08:25:54" (1/3) ...
[2020-07-10 20:25:56,173 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6450259b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:25:56, skipping insertion in model container
[2020-07-10 20:25:56,174 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:25:55" (2/3) ...
[2020-07-10 20:25:56,174 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6450259b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:25:56, skipping insertion in model container
[2020-07-10 20:25:56,174 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:25:56" (3/3) ...
[2020-07-10 20:25:56,177 INFO  L109   eAbstractionObserver]: Analyzing ICFG tree_del_iter_incorrect.c
[2020-07-10 20:25:56,187 INFO  L157   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION
[2020-07-10 20:25:56,194 INFO  L169   ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2020-07-10 20:25:56,207 INFO  L251      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2020-07-10 20:25:56,231 INFO  L375      AbstractCegarLoop]: Interprodecural is true
[2020-07-10 20:25:56,231 INFO  L376      AbstractCegarLoop]: Hoare is true
[2020-07-10 20:25:56,232 INFO  L377      AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation
[2020-07-10 20:25:56,232 INFO  L378      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-07-10 20:25:56,232 INFO  L379      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-07-10 20:25:56,233 INFO  L380      AbstractCegarLoop]: Difference is false
[2020-07-10 20:25:56,233 INFO  L381      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-07-10 20:25:56,233 INFO  L385      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-07-10 20:25:56,253 INFO  L276                IsEmpty]: Start isEmpty. Operand 199 states.
[2020-07-10 20:25:56,269 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 61
[2020-07-10 20:25:56,270 INFO  L414         BasicCegarLoop]: Found error trace
[2020-07-10 20:25:56,271 INFO  L422         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-10 20:25:56,272 INFO  L427      AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-10 20:25:56,277 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-07-10 20:25:56,278 INFO  L82        PathProgramCache]: Analyzing trace with hash 1732590877, now seen corresponding path program 1 times
[2020-07-10 20:25:56,286 INFO  L163   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-10 20:25:56,287 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1552966330]
[2020-07-10 20:25:56,287 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-10 20:25:56,478 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 20:25:56,623 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 20:25:56,637 INFO  L280        TraceCheckUtils]: 0: Hoare triple {240#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {202#true} is VALID
[2020-07-10 20:25:56,638 INFO  L280        TraceCheckUtils]: 1: Hoare triple {202#true} #valid := #valid[0 := 0]; {202#true} is VALID
[2020-07-10 20:25:56,638 INFO  L280        TraceCheckUtils]: 2: Hoare triple {202#true} assume 0 < #StackHeapBarrier; {202#true} is VALID
[2020-07-10 20:25:56,639 INFO  L280        TraceCheckUtils]: 3: Hoare triple {202#true} assume true; {202#true} is VALID
[2020-07-10 20:25:56,640 INFO  L275        TraceCheckUtils]: 4: Hoare quadruple {202#true} {202#true} #282#return; {202#true} is VALID
[2020-07-10 20:25:56,665 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 20:25:56,673 INFO  L280        TraceCheckUtils]: 0: Hoare triple {241#(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; {202#true} is VALID
[2020-07-10 20:25:56,674 INFO  L280        TraceCheckUtils]: 1: Hoare triple {202#true} havoc #t~nondet1; {202#true} is VALID
[2020-07-10 20:25:56,674 INFO  L280        TraceCheckUtils]: 2: Hoare triple {202#true} #res.base, #res.offset := 0, 0; {202#true} is VALID
[2020-07-10 20:25:56,674 INFO  L280        TraceCheckUtils]: 3: Hoare triple {202#true} assume true; {202#true} is VALID
[2020-07-10 20:25:56,675 INFO  L275        TraceCheckUtils]: 4: Hoare quadruple {202#true} {202#true} #240#return; {202#true} is VALID
[2020-07-10 20:25:56,676 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 20:25:56,682 INFO  L280        TraceCheckUtils]: 0: Hoare triple {202#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {202#true} is VALID
[2020-07-10 20:25:56,682 INFO  L280        TraceCheckUtils]: 1: Hoare triple {202#true} assume ~n.base == 0 && ~n.offset == 0; {202#true} is VALID
[2020-07-10 20:25:56,683 INFO  L280        TraceCheckUtils]: 2: Hoare triple {202#true} #res := 2147483647; {202#true} is VALID
[2020-07-10 20:25:56,683 INFO  L280        TraceCheckUtils]: 3: Hoare triple {202#true} assume true; {202#true} is VALID
[2020-07-10 20:25:56,683 INFO  L275        TraceCheckUtils]: 4: Hoare quadruple {202#true} {202#true} #252#return; {202#true} is VALID
[2020-07-10 20:25:56,687 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 20:25:56,711 INFO  L280        TraceCheckUtils]: 0: Hoare triple {202#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {202#true} is VALID
[2020-07-10 20:25:56,712 INFO  L280        TraceCheckUtils]: 1: Hoare triple {202#true} assume ~t.base == 0 && ~t.offset == 0; {202#true} is VALID
[2020-07-10 20:25:56,713 INFO  L280        TraceCheckUtils]: 2: Hoare triple {202#true} #res := 0; {242#(= 0 |size_#res|)} is VALID
[2020-07-10 20:25:56,714 INFO  L280        TraceCheckUtils]: 3: Hoare triple {242#(= 0 |size_#res|)} assume true; {242#(= 0 |size_#res|)} is VALID
[2020-07-10 20:25:56,716 INFO  L275        TraceCheckUtils]: 4: Hoare quadruple {242#(= 0 |size_#res|)} {202#true} #254#return; {224#(= 0 |task_#t~ret28|)} is VALID
[2020-07-10 20:25:56,720 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 20:25:56,755 INFO  L280        TraceCheckUtils]: 0: Hoare triple {202#true} ~cond := #in~cond; {243#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID
[2020-07-10 20:25:56,756 INFO  L280        TraceCheckUtils]: 1: Hoare triple {243#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {244#(not (= 0 |assume_abort_if_not_#in~cond|))} is VALID
[2020-07-10 20:25:56,760 INFO  L280        TraceCheckUtils]: 2: Hoare triple {244#(not (= 0 |assume_abort_if_not_#in~cond|))} assume true; {244#(not (= 0 |assume_abort_if_not_#in~cond|))} is VALID
[2020-07-10 20:25:56,762 INFO  L275        TraceCheckUtils]: 3: Hoare quadruple {244#(not (= 0 |assume_abort_if_not_#in~cond|))} {225#(= 0 task_~n~1)} #256#return; {203#false} is VALID
[2020-07-10 20:25:56,780 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 20:25:56,786 INFO  L280        TraceCheckUtils]: 0: Hoare triple {245#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {202#true} is VALID
[2020-07-10 20:25:56,786 INFO  L280        TraceCheckUtils]: 1: Hoare triple {202#true} assume true; {202#true} is VALID
[2020-07-10 20:25:56,787 INFO  L275        TraceCheckUtils]: 2: Hoare quadruple {202#true} {203#false} #258#return; {203#false} is VALID
[2020-07-10 20:25:56,820 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 20:25:56,827 INFO  L280        TraceCheckUtils]: 0: Hoare triple {246#(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; {202#true} is VALID
[2020-07-10 20:25:56,828 INFO  L280        TraceCheckUtils]: 1: Hoare triple {202#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {202#true} is VALID
[2020-07-10 20:25:56,828 INFO  L280        TraceCheckUtils]: 2: Hoare triple {202#true} ~i := #in~i; {202#true} is VALID
[2020-07-10 20:25:56,829 INFO  L280        TraceCheckUtils]: 3: Hoare triple {202#true} assume ~t.base == 0 && ~t.offset == 0; {202#true} is VALID
[2020-07-10 20:25:56,829 INFO  L280        TraceCheckUtils]: 4: Hoare triple {202#true} #res := ~i; {202#true} is VALID
[2020-07-10 20:25:56,829 INFO  L280        TraceCheckUtils]: 5: Hoare triple {202#true} assume true; {202#true} is VALID
[2020-07-10 20:25:56,830 INFO  L275        TraceCheckUtils]: 6: Hoare quadruple {202#true} {203#false} #260#return; {203#false} is VALID
[2020-07-10 20:25:56,832 INFO  L263        TraceCheckUtils]: 0: Hoare triple {202#true} call ULTIMATE.init(); {240#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID
[2020-07-10 20:25:56,832 INFO  L280        TraceCheckUtils]: 1: Hoare triple {240#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {202#true} is VALID
[2020-07-10 20:25:56,832 INFO  L280        TraceCheckUtils]: 2: Hoare triple {202#true} #valid := #valid[0 := 0]; {202#true} is VALID
[2020-07-10 20:25:56,833 INFO  L280        TraceCheckUtils]: 3: Hoare triple {202#true} assume 0 < #StackHeapBarrier; {202#true} is VALID
[2020-07-10 20:25:56,833 INFO  L280        TraceCheckUtils]: 4: Hoare triple {202#true} assume true; {202#true} is VALID
[2020-07-10 20:25:56,834 INFO  L275        TraceCheckUtils]: 5: Hoare quadruple {202#true} {202#true} #282#return; {202#true} is VALID
[2020-07-10 20:25:56,834 INFO  L263        TraceCheckUtils]: 6: Hoare triple {202#true} call #t~ret41 := main(); {202#true} is VALID
[2020-07-10 20:25:56,836 INFO  L263        TraceCheckUtils]: 7: Hoare triple {202#true} call #t~ret40.base, #t~ret40.offset := nondet_tree(); {241#(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-10 20:25:56,836 INFO  L280        TraceCheckUtils]: 8: Hoare triple {241#(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; {202#true} is VALID
[2020-07-10 20:25:56,836 INFO  L280        TraceCheckUtils]: 9: Hoare triple {202#true} havoc #t~nondet1; {202#true} is VALID
[2020-07-10 20:25:56,837 INFO  L280        TraceCheckUtils]: 10: Hoare triple {202#true} #res.base, #res.offset := 0, 0; {202#true} is VALID
[2020-07-10 20:25:56,837 INFO  L280        TraceCheckUtils]: 11: Hoare triple {202#true} assume true; {202#true} is VALID
[2020-07-10 20:25:56,838 INFO  L275        TraceCheckUtils]: 12: Hoare quadruple {202#true} {202#true} #240#return; {202#true} is VALID
[2020-07-10 20:25:56,838 INFO  L263        TraceCheckUtils]: 13: Hoare triple {202#true} call task(#t~ret40.base, #t~ret40.offset); {202#true} is VALID
[2020-07-10 20:25:56,838 INFO  L280        TraceCheckUtils]: 14: Hoare triple {202#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {202#true} is VALID
[2020-07-10 20:25:56,839 INFO  L263        TraceCheckUtils]: 15: Hoare triple {202#true} call #t~ret27 := min(~t.base, ~t.offset); {202#true} is VALID
[2020-07-10 20:25:56,839 INFO  L280        TraceCheckUtils]: 16: Hoare triple {202#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {202#true} is VALID
[2020-07-10 20:25:56,840 INFO  L280        TraceCheckUtils]: 17: Hoare triple {202#true} assume ~n.base == 0 && ~n.offset == 0; {202#true} is VALID
[2020-07-10 20:25:56,840 INFO  L280        TraceCheckUtils]: 18: Hoare triple {202#true} #res := 2147483647; {202#true} is VALID
[2020-07-10 20:25:56,840 INFO  L280        TraceCheckUtils]: 19: Hoare triple {202#true} assume true; {202#true} is VALID
[2020-07-10 20:25:56,841 INFO  L275        TraceCheckUtils]: 20: Hoare quadruple {202#true} {202#true} #252#return; {202#true} is VALID
[2020-07-10 20:25:56,841 INFO  L280        TraceCheckUtils]: 21: Hoare triple {202#true} assume -2147483648 <= #t~ret27 && #t~ret27 <= 2147483647; {202#true} is VALID
[2020-07-10 20:25:56,842 INFO  L280        TraceCheckUtils]: 22: Hoare triple {202#true} ~a~1 := #t~ret27; {202#true} is VALID
[2020-07-10 20:25:56,842 INFO  L280        TraceCheckUtils]: 23: Hoare triple {202#true} havoc #t~ret27; {202#true} is VALID
[2020-07-10 20:25:56,842 INFO  L280        TraceCheckUtils]: 24: Hoare triple {202#true} SUMMARY for call ~#b~1.base, ~#b~1.offset := #Ultimate.allocOnStack(4); srcloc: L82 {202#true} is VALID
[2020-07-10 20:25:56,843 INFO  L263        TraceCheckUtils]: 25: Hoare triple {202#true} call #t~ret28 := size(~t.base, ~t.offset); {202#true} is VALID
[2020-07-10 20:25:56,843 INFO  L280        TraceCheckUtils]: 26: Hoare triple {202#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {202#true} is VALID
[2020-07-10 20:25:56,844 INFO  L280        TraceCheckUtils]: 27: Hoare triple {202#true} assume ~t.base == 0 && ~t.offset == 0; {202#true} is VALID
[2020-07-10 20:25:56,845 INFO  L280        TraceCheckUtils]: 28: Hoare triple {202#true} #res := 0; {242#(= 0 |size_#res|)} is VALID
[2020-07-10 20:25:56,846 INFO  L280        TraceCheckUtils]: 29: Hoare triple {242#(= 0 |size_#res|)} assume true; {242#(= 0 |size_#res|)} is VALID
[2020-07-10 20:25:56,847 INFO  L275        TraceCheckUtils]: 30: Hoare quadruple {242#(= 0 |size_#res|)} {202#true} #254#return; {224#(= 0 |task_#t~ret28|)} is VALID
[2020-07-10 20:25:56,848 INFO  L280        TraceCheckUtils]: 31: Hoare triple {224#(= 0 |task_#t~ret28|)} assume -2147483648 <= #t~ret28 && #t~ret28 <= 2147483647; {224#(= 0 |task_#t~ret28|)} is VALID
[2020-07-10 20:25:56,850 INFO  L280        TraceCheckUtils]: 32: Hoare triple {224#(= 0 |task_#t~ret28|)} ~n~1 := #t~ret28; {225#(= 0 task_~n~1)} is VALID
[2020-07-10 20:25:56,851 INFO  L280        TraceCheckUtils]: 33: Hoare triple {225#(= 0 task_~n~1)} havoc #t~ret28; {225#(= 0 task_~n~1)} is VALID
[2020-07-10 20:25:56,851 INFO  L263        TraceCheckUtils]: 34: Hoare triple {225#(= 0 task_~n~1)} call assume_abort_if_not((if 0 != ~n~1 then 1 else 0)); {202#true} is VALID
[2020-07-10 20:25:56,852 INFO  L280        TraceCheckUtils]: 35: Hoare triple {202#true} ~cond := #in~cond; {243#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID
[2020-07-10 20:25:56,853 INFO  L280        TraceCheckUtils]: 36: Hoare triple {243#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {244#(not (= 0 |assume_abort_if_not_#in~cond|))} is VALID
[2020-07-10 20:25:56,854 INFO  L280        TraceCheckUtils]: 37: Hoare triple {244#(not (= 0 |assume_abort_if_not_#in~cond|))} assume true; {244#(not (= 0 |assume_abort_if_not_#in~cond|))} is VALID
[2020-07-10 20:25:56,855 INFO  L275        TraceCheckUtils]: 38: Hoare quadruple {244#(not (= 0 |assume_abort_if_not_#in~cond|))} {225#(= 0 task_~n~1)} #256#return; {203#false} is VALID
[2020-07-10 20:25:56,856 INFO  L280        TraceCheckUtils]: 39: Hoare triple {203#false} SUMMARY for call #t~malloc29.base, #t~malloc29.offset := #Ultimate.allocOnHeap(4 * ~n~1); srcloc: L85-1 {203#false} is VALID
[2020-07-10 20:25:56,856 INFO  L263        TraceCheckUtils]: 40: Hoare triple {203#false} call #Ultimate.meminit(#t~malloc29.base, #t~malloc29.offset, ~n~1, 4, 4 * ~n~1); {245#(= |#memory_int| |old(#memory_int)|)} is VALID
[2020-07-10 20:25:56,857 INFO  L280        TraceCheckUtils]: 41: Hoare triple {245#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {202#true} is VALID
[2020-07-10 20:25:56,857 INFO  L280        TraceCheckUtils]: 42: Hoare triple {202#true} assume true; {202#true} is VALID
[2020-07-10 20:25:56,858 INFO  L275        TraceCheckUtils]: 43: Hoare quadruple {202#true} {203#false} #258#return; {203#false} is VALID
[2020-07-10 20:25:56,858 INFO  L280        TraceCheckUtils]: 44: Hoare triple {203#false} ~x~0.base, ~x~0.offset := #t~malloc29.base, #t~malloc29.offset; {203#false} is VALID
[2020-07-10 20:25:56,858 INFO  L263        TraceCheckUtils]: 45: Hoare triple {203#false} call #t~ret30 := tree_inorder(~t.base, ~t.offset, ~x~0.base, ~x~0.offset, ~n~1); {246#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID
[2020-07-10 20:25:56,859 INFO  L280        TraceCheckUtils]: 46: Hoare triple {246#(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; {202#true} is VALID
[2020-07-10 20:25:56,859 INFO  L280        TraceCheckUtils]: 47: Hoare triple {202#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {202#true} is VALID
[2020-07-10 20:25:56,859 INFO  L280        TraceCheckUtils]: 48: Hoare triple {202#true} ~i := #in~i; {202#true} is VALID
[2020-07-10 20:25:56,860 INFO  L280        TraceCheckUtils]: 49: Hoare triple {202#true} assume ~t.base == 0 && ~t.offset == 0; {202#true} is VALID
[2020-07-10 20:25:56,860 INFO  L280        TraceCheckUtils]: 50: Hoare triple {202#true} #res := ~i; {202#true} is VALID
[2020-07-10 20:25:56,860 INFO  L280        TraceCheckUtils]: 51: Hoare triple {202#true} assume true; {202#true} is VALID
[2020-07-10 20:25:56,861 INFO  L275        TraceCheckUtils]: 52: Hoare quadruple {202#true} {203#false} #260#return; {203#false} is VALID
[2020-07-10 20:25:56,861 INFO  L280        TraceCheckUtils]: 53: Hoare triple {203#false} assume -2147483648 <= #t~ret30 && #t~ret30 <= 2147483647; {203#false} is VALID
[2020-07-10 20:25:56,862 INFO  L280        TraceCheckUtils]: 54: Hoare triple {203#false} havoc #t~ret30; {203#false} is VALID
[2020-07-10 20:25:56,862 INFO  L280        TraceCheckUtils]: 55: Hoare triple {203#false} SUMMARY for call #t~mem31 := read~int(~x~0.base, ~x~0.offset, 4); srcloc: L88 {203#false} is VALID
[2020-07-10 20:25:56,862 INFO  L263        TraceCheckUtils]: 56: Hoare triple {203#false} call __VERIFIER_assert((if ~a~1 == #t~mem31 then 1 else 0)); {203#false} is VALID
[2020-07-10 20:25:56,863 INFO  L280        TraceCheckUtils]: 57: Hoare triple {203#false} ~cond := #in~cond; {203#false} is VALID
[2020-07-10 20:25:56,863 INFO  L280        TraceCheckUtils]: 58: Hoare triple {203#false} assume 0 == ~cond; {203#false} is VALID
[2020-07-10 20:25:56,863 INFO  L280        TraceCheckUtils]: 59: Hoare triple {203#false} assume !false; {203#false} is VALID
[2020-07-10 20:25:56,877 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-10 20:25:56,877 INFO  L185   leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration
[2020-07-10 20:25:56,880 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1552966330]
[2020-07-10 20:25:56,882 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-10 20:25:56,882 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2020-07-10 20:25:56,883 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18943742]
[2020-07-10 20:25:56,891 INFO  L78                 Accepts]: Start accepts. Automaton has 11 states. Word has length 60
[2020-07-10 20:25:56,894 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2020-07-10 20:25:56,899 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states.
[2020-07-10 20:25:57,019 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-10 20:25:57,020 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 11 states
[2020-07-10 20:25:57,020 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-07-10 20:25:57,030 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2020-07-10 20:25:57,031 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2020-07-10 20:25:57,033 INFO  L87              Difference]: Start difference. First operand 199 states. Second operand 11 states.
[2020-07-10 20:26:01,683 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-10 20:26:01,684 INFO  L93              Difference]: Finished difference Result 357 states and 415 transitions.
[2020-07-10 20:26:01,684 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2020-07-10 20:26:01,684 INFO  L78                 Accepts]: Start accepts. Automaton has 11 states. Word has length 60
[2020-07-10 20:26:01,685 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-10 20:26:01,686 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2020-07-10 20:26:01,717 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 415 transitions.
[2020-07-10 20:26:01,718 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2020-07-10 20:26:01,735 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 415 transitions.
[2020-07-10 20:26:01,735 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 415 transitions.
[2020-07-10 20:26:02,399 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 415 edges. 415 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-10 20:26:02,440 INFO  L225             Difference]: With dead ends: 357
[2020-07-10 20:26:02,440 INFO  L226             Difference]: Without dead ends: 205
[2020-07-10 20:26:02,446 INFO  L675         BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306
[2020-07-10 20:26:02,468 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 205 states.
[2020-07-10 20:26:02,863 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 191.
[2020-07-10 20:26:02,863 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-10 20:26:02,864 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 205 states. Second operand 191 states.
[2020-07-10 20:26:02,865 INFO  L74              IsIncluded]: Start isIncluded. First operand 205 states. Second operand 191 states.
[2020-07-10 20:26:02,865 INFO  L87              Difference]: Start difference. First operand 205 states. Second operand 191 states.
[2020-07-10 20:26:02,892 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-10 20:26:02,892 INFO  L93              Difference]: Finished difference Result 205 states and 233 transitions.
[2020-07-10 20:26:02,892 INFO  L276                IsEmpty]: Start isEmpty. Operand 205 states and 233 transitions.
[2020-07-10 20:26:02,898 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-10 20:26:02,898 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2020-07-10 20:26:02,898 INFO  L74              IsIncluded]: Start isIncluded. First operand 191 states. Second operand 205 states.
[2020-07-10 20:26:02,899 INFO  L87              Difference]: Start difference. First operand 191 states. Second operand 205 states.
[2020-07-10 20:26:02,924 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-10 20:26:02,925 INFO  L93              Difference]: Finished difference Result 205 states and 233 transitions.
[2020-07-10 20:26:02,925 INFO  L276                IsEmpty]: Start isEmpty. Operand 205 states and 233 transitions.
[2020-07-10 20:26:02,928 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-10 20:26:02,928 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2020-07-10 20:26:02,928 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2020-07-10 20:26:02,929 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-10 20:26:02,929 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 191 states.
[2020-07-10 20:26:02,947 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 214 transitions.
[2020-07-10 20:26:02,949 INFO  L78                 Accepts]: Start accepts. Automaton has 191 states and 214 transitions. Word has length 60
[2020-07-10 20:26:02,950 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-07-10 20:26:02,950 INFO  L479      AbstractCegarLoop]: Abstraction has 191 states and 214 transitions.
[2020-07-10 20:26:02,950 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 11 states.
[2020-07-10 20:26:02,950 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 191 states and 214 transitions.
[2020-07-10 20:26:03,280 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 214 edges. 214 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-10 20:26:03,281 INFO  L276                IsEmpty]: Start isEmpty. Operand 191 states and 214 transitions.
[2020-07-10 20:26:03,285 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 81
[2020-07-10 20:26:03,285 INFO  L414         BasicCegarLoop]: Found error trace
[2020-07-10 20:26:03,285 INFO  L422         BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-10 20:26:03,286 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-07-10 20:26:03,286 INFO  L427      AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-10 20:26:03,286 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-07-10 20:26:03,287 INFO  L82        PathProgramCache]: Analyzing trace with hash 1923885975, now seen corresponding path program 1 times
[2020-07-10 20:26:03,287 INFO  L163   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-10 20:26:03,287 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [716321960]
[2020-07-10 20:26:03,287 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-10 20:26:03,364 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 20:26:03,459 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 20:26:03,468 INFO  L280        TraceCheckUtils]: 0: Hoare triple {1829#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1770#true} is VALID
[2020-07-10 20:26:03,469 INFO  L280        TraceCheckUtils]: 1: Hoare triple {1770#true} #valid := #valid[0 := 0]; {1770#true} is VALID
[2020-07-10 20:26:03,469 INFO  L280        TraceCheckUtils]: 2: Hoare triple {1770#true} assume 0 < #StackHeapBarrier; {1770#true} is VALID
[2020-07-10 20:26:03,470 INFO  L280        TraceCheckUtils]: 3: Hoare triple {1770#true} assume true; {1770#true} is VALID
[2020-07-10 20:26:03,470 INFO  L275        TraceCheckUtils]: 4: Hoare quadruple {1770#true} {1770#true} #282#return; {1770#true} is VALID
[2020-07-10 20:26:03,495 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 20:26:03,533 INFO  L280        TraceCheckUtils]: 0: Hoare triple {1830#(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; {1770#true} is VALID
[2020-07-10 20:26:03,534 INFO  L280        TraceCheckUtils]: 1: Hoare triple {1770#true} havoc #t~nondet1; {1770#true} is VALID
[2020-07-10 20:26:03,535 INFO  L280        TraceCheckUtils]: 2: Hoare triple {1770#true} #res.base, #res.offset := 0, 0; {1831#(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-10 20:26:03,536 INFO  L280        TraceCheckUtils]: 3: Hoare triple {1831#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} assume true; {1831#(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-10 20:26:03,538 INFO  L275        TraceCheckUtils]: 4: Hoare quadruple {1831#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} {1770#true} #240#return; {1782#(and (= 0 |main_#t~ret40.base|) (= 0 |main_#t~ret40.offset|))} is VALID
[2020-07-10 20:26:03,542 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 20:26:03,555 INFO  L280        TraceCheckUtils]: 0: Hoare triple {1770#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {1770#true} is VALID
[2020-07-10 20:26:03,556 INFO  L280        TraceCheckUtils]: 1: Hoare triple {1770#true} assume ~n.base == 0 && ~n.offset == 0; {1770#true} is VALID
[2020-07-10 20:26:03,556 INFO  L280        TraceCheckUtils]: 2: Hoare triple {1770#true} #res := 2147483647; {1770#true} is VALID
[2020-07-10 20:26:03,556 INFO  L280        TraceCheckUtils]: 3: Hoare triple {1770#true} assume true; {1770#true} is VALID
[2020-07-10 20:26:03,575 INFO  L275        TraceCheckUtils]: 4: Hoare quadruple {1770#true} {1784#(and (= 0 task_~t.offset) (= 0 task_~t.base))} #252#return; {1784#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID
[2020-07-10 20:26:03,583 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 20:26:03,643 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 20:26:03,648 INFO  L280        TraceCheckUtils]: 0: Hoare triple {1770#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1770#true} is VALID
[2020-07-10 20:26:03,649 INFO  L280        TraceCheckUtils]: 1: Hoare triple {1770#true} assume ~t.base == 0 && ~t.offset == 0; {1770#true} is VALID
[2020-07-10 20:26:03,649 INFO  L280        TraceCheckUtils]: 2: Hoare triple {1770#true} #res := 0; {1770#true} is VALID
[2020-07-10 20:26:03,649 INFO  L280        TraceCheckUtils]: 3: Hoare triple {1770#true} assume true; {1770#true} is VALID
[2020-07-10 20:26:03,651 INFO  L275        TraceCheckUtils]: 4: Hoare quadruple {1770#true} {1833#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #278#return; {1833#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID
[2020-07-10 20:26:03,653 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 20:26:03,659 INFO  L280        TraceCheckUtils]: 0: Hoare triple {1770#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1770#true} is VALID
[2020-07-10 20:26:03,659 INFO  L280        TraceCheckUtils]: 1: Hoare triple {1770#true} assume ~t.base == 0 && ~t.offset == 0; {1770#true} is VALID
[2020-07-10 20:26:03,659 INFO  L280        TraceCheckUtils]: 2: Hoare triple {1770#true} #res := 0; {1770#true} is VALID
[2020-07-10 20:26:03,660 INFO  L280        TraceCheckUtils]: 3: Hoare triple {1770#true} assume true; {1770#true} is VALID
[2020-07-10 20:26:03,661 INFO  L275        TraceCheckUtils]: 4: Hoare quadruple {1770#true} {1833#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #280#return; {1833#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID
[2020-07-10 20:26:03,662 INFO  L280        TraceCheckUtils]: 0: Hoare triple {1770#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1832#(and (= |size_#in~t.base| size_~t.base) (= |size_#in~t.offset| size_~t.offset))} is VALID
[2020-07-10 20:26:03,663 INFO  L280        TraceCheckUtils]: 1: Hoare triple {1832#(and (= |size_#in~t.base| size_~t.base) (= |size_#in~t.offset| size_~t.offset))} assume !(~t.base == 0 && ~t.offset == 0); {1833#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID
[2020-07-10 20:26:03,664 INFO  L280        TraceCheckUtils]: 2: Hoare triple {1833#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} SUMMARY for call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 4); srcloc: L77 {1833#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID
[2020-07-10 20:26:03,668 INFO  L263        TraceCheckUtils]: 3: Hoare triple {1833#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} call #t~ret24 := size(#t~mem23.base, #t~mem23.offset); {1770#true} is VALID
[2020-07-10 20:26:03,668 INFO  L280        TraceCheckUtils]: 4: Hoare triple {1770#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1770#true} is VALID
[2020-07-10 20:26:03,669 INFO  L280        TraceCheckUtils]: 5: Hoare triple {1770#true} assume ~t.base == 0 && ~t.offset == 0; {1770#true} is VALID
[2020-07-10 20:26:03,669 INFO  L280        TraceCheckUtils]: 6: Hoare triple {1770#true} #res := 0; {1770#true} is VALID
[2020-07-10 20:26:03,669 INFO  L280        TraceCheckUtils]: 7: Hoare triple {1770#true} assume true; {1770#true} is VALID
[2020-07-10 20:26:03,671 INFO  L275        TraceCheckUtils]: 8: Hoare quadruple {1770#true} {1833#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #278#return; {1833#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID
[2020-07-10 20:26:03,671 INFO  L280        TraceCheckUtils]: 9: Hoare triple {1833#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume -2147483648 <= #t~ret24 && #t~ret24 <= 2147483647; {1833#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID
[2020-07-10 20:26:03,672 INFO  L280        TraceCheckUtils]: 10: Hoare triple {1833#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} SUMMARY for call #t~mem25.base, #t~mem25.offset := read~$Pointer$(~t.base, 8 + ~t.offset, 4); srcloc: L77-3 {1833#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID
[2020-07-10 20:26:03,673 INFO  L263        TraceCheckUtils]: 11: Hoare triple {1833#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} call #t~ret26 := size(#t~mem25.base, #t~mem25.offset); {1770#true} is VALID
[2020-07-10 20:26:03,673 INFO  L280        TraceCheckUtils]: 12: Hoare triple {1770#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1770#true} is VALID
[2020-07-10 20:26:03,673 INFO  L280        TraceCheckUtils]: 13: Hoare triple {1770#true} assume ~t.base == 0 && ~t.offset == 0; {1770#true} is VALID
[2020-07-10 20:26:03,673 INFO  L280        TraceCheckUtils]: 14: Hoare triple {1770#true} #res := 0; {1770#true} is VALID
[2020-07-10 20:26:03,674 INFO  L280        TraceCheckUtils]: 15: Hoare triple {1770#true} assume true; {1770#true} is VALID
[2020-07-10 20:26:03,675 INFO  L275        TraceCheckUtils]: 16: Hoare quadruple {1770#true} {1833#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #280#return; {1833#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID
[2020-07-10 20:26:03,676 INFO  L280        TraceCheckUtils]: 17: Hoare triple {1833#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume -2147483648 <= #t~ret26 && #t~ret26 <= 2147483647; {1833#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID
[2020-07-10 20:26:03,677 INFO  L280        TraceCheckUtils]: 18: Hoare triple {1833#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #res := 1 + (#t~ret24 + #t~ret26); {1833#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID
[2020-07-10 20:26:03,678 INFO  L280        TraceCheckUtils]: 19: Hoare triple {1833#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} havoc #t~ret24; {1833#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID
[2020-07-10 20:26:03,678 INFO  L280        TraceCheckUtils]: 20: Hoare triple {1833#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} havoc #t~ret26; {1833#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID
[2020-07-10 20:26:03,679 INFO  L280        TraceCheckUtils]: 21: Hoare triple {1833#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} havoc #t~mem23.base, #t~mem23.offset; {1833#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID
[2020-07-10 20:26:03,680 INFO  L280        TraceCheckUtils]: 22: Hoare triple {1833#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} havoc #t~mem25.base, #t~mem25.offset; {1833#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID
[2020-07-10 20:26:03,681 INFO  L280        TraceCheckUtils]: 23: Hoare triple {1833#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume true; {1833#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID
[2020-07-10 20:26:03,682 INFO  L275        TraceCheckUtils]: 24: Hoare quadruple {1833#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} {1784#(and (= 0 task_~t.offset) (= 0 task_~t.base))} #254#return; {1771#false} is VALID
[2020-07-10 20:26:03,685 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 20:26:03,688 INFO  L280        TraceCheckUtils]: 0: Hoare triple {1770#true} ~cond := #in~cond; {1770#true} is VALID
[2020-07-10 20:26:03,689 INFO  L280        TraceCheckUtils]: 1: Hoare triple {1770#true} assume !(0 == ~cond); {1770#true} is VALID
[2020-07-10 20:26:03,689 INFO  L280        TraceCheckUtils]: 2: Hoare triple {1770#true} assume true; {1770#true} is VALID
[2020-07-10 20:26:03,689 INFO  L275        TraceCheckUtils]: 3: Hoare quadruple {1770#true} {1771#false} #256#return; {1771#false} is VALID
[2020-07-10 20:26:03,710 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 20:26:03,714 INFO  L280        TraceCheckUtils]: 0: Hoare triple {1844#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1770#true} is VALID
[2020-07-10 20:26:03,714 INFO  L280        TraceCheckUtils]: 1: Hoare triple {1770#true} assume true; {1770#true} is VALID
[2020-07-10 20:26:03,715 INFO  L275        TraceCheckUtils]: 2: Hoare quadruple {1770#true} {1771#false} #258#return; {1771#false} is VALID
[2020-07-10 20:26:03,743 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 20:26:03,747 INFO  L280        TraceCheckUtils]: 0: Hoare triple {1845#(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; {1770#true} is VALID
[2020-07-10 20:26:03,747 INFO  L280        TraceCheckUtils]: 1: Hoare triple {1770#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {1770#true} is VALID
[2020-07-10 20:26:03,748 INFO  L280        TraceCheckUtils]: 2: Hoare triple {1770#true} ~i := #in~i; {1770#true} is VALID
[2020-07-10 20:26:03,748 INFO  L280        TraceCheckUtils]: 3: Hoare triple {1770#true} assume ~t.base == 0 && ~t.offset == 0; {1770#true} is VALID
[2020-07-10 20:26:03,748 INFO  L280        TraceCheckUtils]: 4: Hoare triple {1770#true} #res := ~i; {1770#true} is VALID
[2020-07-10 20:26:03,749 INFO  L280        TraceCheckUtils]: 5: Hoare triple {1770#true} assume true; {1770#true} is VALID
[2020-07-10 20:26:03,749 INFO  L275        TraceCheckUtils]: 6: Hoare quadruple {1770#true} {1771#false} #260#return; {1771#false} is VALID
[2020-07-10 20:26:03,750 INFO  L263        TraceCheckUtils]: 0: Hoare triple {1770#true} call ULTIMATE.init(); {1829#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID
[2020-07-10 20:26:03,751 INFO  L280        TraceCheckUtils]: 1: Hoare triple {1829#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1770#true} is VALID
[2020-07-10 20:26:03,751 INFO  L280        TraceCheckUtils]: 2: Hoare triple {1770#true} #valid := #valid[0 := 0]; {1770#true} is VALID
[2020-07-10 20:26:03,751 INFO  L280        TraceCheckUtils]: 3: Hoare triple {1770#true} assume 0 < #StackHeapBarrier; {1770#true} is VALID
[2020-07-10 20:26:03,751 INFO  L280        TraceCheckUtils]: 4: Hoare triple {1770#true} assume true; {1770#true} is VALID
[2020-07-10 20:26:03,752 INFO  L275        TraceCheckUtils]: 5: Hoare quadruple {1770#true} {1770#true} #282#return; {1770#true} is VALID
[2020-07-10 20:26:03,752 INFO  L263        TraceCheckUtils]: 6: Hoare triple {1770#true} call #t~ret41 := main(); {1770#true} is VALID
[2020-07-10 20:26:03,753 INFO  L263        TraceCheckUtils]: 7: Hoare triple {1770#true} call #t~ret40.base, #t~ret40.offset := nondet_tree(); {1830#(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-10 20:26:03,754 INFO  L280        TraceCheckUtils]: 8: Hoare triple {1830#(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; {1770#true} is VALID
[2020-07-10 20:26:03,754 INFO  L280        TraceCheckUtils]: 9: Hoare triple {1770#true} havoc #t~nondet1; {1770#true} is VALID
[2020-07-10 20:26:03,755 INFO  L280        TraceCheckUtils]: 10: Hoare triple {1770#true} #res.base, #res.offset := 0, 0; {1831#(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-10 20:26:03,756 INFO  L280        TraceCheckUtils]: 11: Hoare triple {1831#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} assume true; {1831#(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-10 20:26:03,757 INFO  L275        TraceCheckUtils]: 12: Hoare quadruple {1831#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} {1770#true} #240#return; {1782#(and (= 0 |main_#t~ret40.base|) (= 0 |main_#t~ret40.offset|))} is VALID
[2020-07-10 20:26:03,758 INFO  L263        TraceCheckUtils]: 13: Hoare triple {1782#(and (= 0 |main_#t~ret40.base|) (= 0 |main_#t~ret40.offset|))} call task(#t~ret40.base, #t~ret40.offset); {1783#(and (= 0 |task_#in~t.offset|) (= |task_#in~t.base| 0))} is VALID
[2020-07-10 20:26:03,759 INFO  L280        TraceCheckUtils]: 14: Hoare triple {1783#(and (= 0 |task_#in~t.offset|) (= |task_#in~t.base| 0))} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1784#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID
[2020-07-10 20:26:03,760 INFO  L263        TraceCheckUtils]: 15: Hoare triple {1784#(and (= 0 task_~t.offset) (= 0 task_~t.base))} call #t~ret27 := min(~t.base, ~t.offset); {1770#true} is VALID
[2020-07-10 20:26:03,760 INFO  L280        TraceCheckUtils]: 16: Hoare triple {1770#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {1770#true} is VALID
[2020-07-10 20:26:03,760 INFO  L280        TraceCheckUtils]: 17: Hoare triple {1770#true} assume ~n.base == 0 && ~n.offset == 0; {1770#true} is VALID
[2020-07-10 20:26:03,761 INFO  L280        TraceCheckUtils]: 18: Hoare triple {1770#true} #res := 2147483647; {1770#true} is VALID
[2020-07-10 20:26:03,761 INFO  L280        TraceCheckUtils]: 19: Hoare triple {1770#true} assume true; {1770#true} is VALID
[2020-07-10 20:26:03,762 INFO  L275        TraceCheckUtils]: 20: Hoare quadruple {1770#true} {1784#(and (= 0 task_~t.offset) (= 0 task_~t.base))} #252#return; {1784#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID
[2020-07-10 20:26:03,763 INFO  L280        TraceCheckUtils]: 21: Hoare triple {1784#(and (= 0 task_~t.offset) (= 0 task_~t.base))} assume -2147483648 <= #t~ret27 && #t~ret27 <= 2147483647; {1784#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID
[2020-07-10 20:26:03,764 INFO  L280        TraceCheckUtils]: 22: Hoare triple {1784#(and (= 0 task_~t.offset) (= 0 task_~t.base))} ~a~1 := #t~ret27; {1784#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID
[2020-07-10 20:26:03,765 INFO  L280        TraceCheckUtils]: 23: Hoare triple {1784#(and (= 0 task_~t.offset) (= 0 task_~t.base))} havoc #t~ret27; {1784#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID
[2020-07-10 20:26:03,766 INFO  L280        TraceCheckUtils]: 24: Hoare triple {1784#(and (= 0 task_~t.offset) (= 0 task_~t.base))} SUMMARY for call ~#b~1.base, ~#b~1.offset := #Ultimate.allocOnStack(4); srcloc: L82 {1784#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID
[2020-07-10 20:26:03,766 INFO  L263        TraceCheckUtils]: 25: Hoare triple {1784#(and (= 0 task_~t.offset) (= 0 task_~t.base))} call #t~ret28 := size(~t.base, ~t.offset); {1770#true} is VALID
[2020-07-10 20:26:03,767 INFO  L280        TraceCheckUtils]: 26: Hoare triple {1770#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1832#(and (= |size_#in~t.base| size_~t.base) (= |size_#in~t.offset| size_~t.offset))} is VALID
[2020-07-10 20:26:03,769 INFO  L280        TraceCheckUtils]: 27: Hoare triple {1832#(and (= |size_#in~t.base| size_~t.base) (= |size_#in~t.offset| size_~t.offset))} assume !(~t.base == 0 && ~t.offset == 0); {1833#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID
[2020-07-10 20:26:03,769 INFO  L280        TraceCheckUtils]: 28: Hoare triple {1833#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} SUMMARY for call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 4); srcloc: L77 {1833#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID
[2020-07-10 20:26:03,770 INFO  L263        TraceCheckUtils]: 29: Hoare triple {1833#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} call #t~ret24 := size(#t~mem23.base, #t~mem23.offset); {1770#true} is VALID
[2020-07-10 20:26:03,770 INFO  L280        TraceCheckUtils]: 30: Hoare triple {1770#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1770#true} is VALID
[2020-07-10 20:26:03,770 INFO  L280        TraceCheckUtils]: 31: Hoare triple {1770#true} assume ~t.base == 0 && ~t.offset == 0; {1770#true} is VALID
[2020-07-10 20:26:03,771 INFO  L280        TraceCheckUtils]: 32: Hoare triple {1770#true} #res := 0; {1770#true} is VALID
[2020-07-10 20:26:03,771 INFO  L280        TraceCheckUtils]: 33: Hoare triple {1770#true} assume true; {1770#true} is VALID
[2020-07-10 20:26:03,772 INFO  L275        TraceCheckUtils]: 34: Hoare quadruple {1770#true} {1833#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #278#return; {1833#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID
[2020-07-10 20:26:03,773 INFO  L280        TraceCheckUtils]: 35: Hoare triple {1833#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume -2147483648 <= #t~ret24 && #t~ret24 <= 2147483647; {1833#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID
[2020-07-10 20:26:03,774 INFO  L280        TraceCheckUtils]: 36: Hoare triple {1833#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} SUMMARY for call #t~mem25.base, #t~mem25.offset := read~$Pointer$(~t.base, 8 + ~t.offset, 4); srcloc: L77-3 {1833#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID
[2020-07-10 20:26:03,774 INFO  L263        TraceCheckUtils]: 37: Hoare triple {1833#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} call #t~ret26 := size(#t~mem25.base, #t~mem25.offset); {1770#true} is VALID
[2020-07-10 20:26:03,775 INFO  L280        TraceCheckUtils]: 38: Hoare triple {1770#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1770#true} is VALID
[2020-07-10 20:26:03,775 INFO  L280        TraceCheckUtils]: 39: Hoare triple {1770#true} assume ~t.base == 0 && ~t.offset == 0; {1770#true} is VALID
[2020-07-10 20:26:03,775 INFO  L280        TraceCheckUtils]: 40: Hoare triple {1770#true} #res := 0; {1770#true} is VALID
[2020-07-10 20:26:03,775 INFO  L280        TraceCheckUtils]: 41: Hoare triple {1770#true} assume true; {1770#true} is VALID
[2020-07-10 20:26:03,777 INFO  L275        TraceCheckUtils]: 42: Hoare quadruple {1770#true} {1833#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #280#return; {1833#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID
[2020-07-10 20:26:03,778 INFO  L280        TraceCheckUtils]: 43: Hoare triple {1833#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume -2147483648 <= #t~ret26 && #t~ret26 <= 2147483647; {1833#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID
[2020-07-10 20:26:03,778 INFO  L280        TraceCheckUtils]: 44: Hoare triple {1833#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #res := 1 + (#t~ret24 + #t~ret26); {1833#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID
[2020-07-10 20:26:03,779 INFO  L280        TraceCheckUtils]: 45: Hoare triple {1833#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} havoc #t~ret24; {1833#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID
[2020-07-10 20:26:03,780 INFO  L280        TraceCheckUtils]: 46: Hoare triple {1833#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} havoc #t~ret26; {1833#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID
[2020-07-10 20:26:03,780 INFO  L280        TraceCheckUtils]: 47: Hoare triple {1833#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} havoc #t~mem23.base, #t~mem23.offset; {1833#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID
[2020-07-10 20:26:03,781 INFO  L280        TraceCheckUtils]: 48: Hoare triple {1833#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} havoc #t~mem25.base, #t~mem25.offset; {1833#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID
[2020-07-10 20:26:03,782 INFO  L280        TraceCheckUtils]: 49: Hoare triple {1833#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume true; {1833#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID
[2020-07-10 20:26:03,783 INFO  L275        TraceCheckUtils]: 50: Hoare quadruple {1833#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} {1784#(and (= 0 task_~t.offset) (= 0 task_~t.base))} #254#return; {1771#false} is VALID
[2020-07-10 20:26:03,784 INFO  L280        TraceCheckUtils]: 51: Hoare triple {1771#false} assume -2147483648 <= #t~ret28 && #t~ret28 <= 2147483647; {1771#false} is VALID
[2020-07-10 20:26:03,784 INFO  L280        TraceCheckUtils]: 52: Hoare triple {1771#false} ~n~1 := #t~ret28; {1771#false} is VALID
[2020-07-10 20:26:03,784 INFO  L280        TraceCheckUtils]: 53: Hoare triple {1771#false} havoc #t~ret28; {1771#false} is VALID
[2020-07-10 20:26:03,784 INFO  L263        TraceCheckUtils]: 54: Hoare triple {1771#false} call assume_abort_if_not((if 0 != ~n~1 then 1 else 0)); {1770#true} is VALID
[2020-07-10 20:26:03,785 INFO  L280        TraceCheckUtils]: 55: Hoare triple {1770#true} ~cond := #in~cond; {1770#true} is VALID
[2020-07-10 20:26:03,785 INFO  L280        TraceCheckUtils]: 56: Hoare triple {1770#true} assume !(0 == ~cond); {1770#true} is VALID
[2020-07-10 20:26:03,785 INFO  L280        TraceCheckUtils]: 57: Hoare triple {1770#true} assume true; {1770#true} is VALID
[2020-07-10 20:26:03,786 INFO  L275        TraceCheckUtils]: 58: Hoare quadruple {1770#true} {1771#false} #256#return; {1771#false} is VALID
[2020-07-10 20:26:03,786 INFO  L280        TraceCheckUtils]: 59: Hoare triple {1771#false} SUMMARY for call #t~malloc29.base, #t~malloc29.offset := #Ultimate.allocOnHeap(4 * ~n~1); srcloc: L85-1 {1771#false} is VALID
[2020-07-10 20:26:03,786 INFO  L263        TraceCheckUtils]: 60: Hoare triple {1771#false} call #Ultimate.meminit(#t~malloc29.base, #t~malloc29.offset, ~n~1, 4, 4 * ~n~1); {1844#(= |#memory_int| |old(#memory_int)|)} is VALID
[2020-07-10 20:26:03,786 INFO  L280        TraceCheckUtils]: 61: Hoare triple {1844#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1770#true} is VALID
[2020-07-10 20:26:03,787 INFO  L280        TraceCheckUtils]: 62: Hoare triple {1770#true} assume true; {1770#true} is VALID
[2020-07-10 20:26:03,787 INFO  L275        TraceCheckUtils]: 63: Hoare quadruple {1770#true} {1771#false} #258#return; {1771#false} is VALID
[2020-07-10 20:26:03,787 INFO  L280        TraceCheckUtils]: 64: Hoare triple {1771#false} ~x~0.base, ~x~0.offset := #t~malloc29.base, #t~malloc29.offset; {1771#false} is VALID
[2020-07-10 20:26:03,788 INFO  L263        TraceCheckUtils]: 65: Hoare triple {1771#false} call #t~ret30 := tree_inorder(~t.base, ~t.offset, ~x~0.base, ~x~0.offset, ~n~1); {1845#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID
[2020-07-10 20:26:03,788 INFO  L280        TraceCheckUtils]: 66: Hoare triple {1845#(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; {1770#true} is VALID
[2020-07-10 20:26:03,788 INFO  L280        TraceCheckUtils]: 67: Hoare triple {1770#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset; {1770#true} is VALID
[2020-07-10 20:26:03,788 INFO  L280        TraceCheckUtils]: 68: Hoare triple {1770#true} ~i := #in~i; {1770#true} is VALID
[2020-07-10 20:26:03,789 INFO  L280        TraceCheckUtils]: 69: Hoare triple {1770#true} assume ~t.base == 0 && ~t.offset == 0; {1770#true} is VALID
[2020-07-10 20:26:03,789 INFO  L280        TraceCheckUtils]: 70: Hoare triple {1770#true} #res := ~i; {1770#true} is VALID
[2020-07-10 20:26:03,789 INFO  L280        TraceCheckUtils]: 71: Hoare triple {1770#true} assume true; {1770#true} is VALID
[2020-07-10 20:26:03,790 INFO  L275        TraceCheckUtils]: 72: Hoare quadruple {1770#true} {1771#false} #260#return; {1771#false} is VALID
[2020-07-10 20:26:03,790 INFO  L280        TraceCheckUtils]: 73: Hoare triple {1771#false} assume -2147483648 <= #t~ret30 && #t~ret30 <= 2147483647; {1771#false} is VALID
[2020-07-10 20:26:03,790 INFO  L280        TraceCheckUtils]: 74: Hoare triple {1771#false} havoc #t~ret30; {1771#false} is VALID
[2020-07-10 20:26:03,791 INFO  L280        TraceCheckUtils]: 75: Hoare triple {1771#false} SUMMARY for call #t~mem31 := read~int(~x~0.base, ~x~0.offset, 4); srcloc: L88 {1771#false} is VALID
[2020-07-10 20:26:03,791 INFO  L263        TraceCheckUtils]: 76: Hoare triple {1771#false} call __VERIFIER_assert((if ~a~1 == #t~mem31 then 1 else 0)); {1771#false} is VALID
[2020-07-10 20:26:03,791 INFO  L280        TraceCheckUtils]: 77: Hoare triple {1771#false} ~cond := #in~cond; {1771#false} is VALID
[2020-07-10 20:26:03,792 INFO  L280        TraceCheckUtils]: 78: Hoare triple {1771#false} assume 0 == ~cond; {1771#false} is VALID
[2020-07-10 20:26:03,792 INFO  L280        TraceCheckUtils]: 79: Hoare triple {1771#false} assume !false; {1771#false} is VALID
[2020-07-10 20:26:03,803 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2020-07-10 20:26:03,803 INFO  L185   leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration
[2020-07-10 20:26:03,804 INFO  L354   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [716321960]
[2020-07-10 20:26:03,804 INFO  L220   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-10 20:26:03,804 INFO  L233   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2020-07-10 20:26:03,804 INFO  L156   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739876659]
[2020-07-10 20:26:03,806 INFO  L78                 Accepts]: Start accepts. Automaton has 12 states. Word has length 80
[2020-07-10 20:26:03,806 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2020-07-10 20:26:03,807 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states.
[2020-07-10 20:26:03,897 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-10 20:26:03,897 INFO  L459      AbstractCegarLoop]: Interpolant automaton has 12 states
[2020-07-10 20:26:03,898 INFO  L143   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES
[2020-07-10 20:26:03,898 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2020-07-10 20:26:03,899 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132
[2020-07-10 20:26:03,899 INFO  L87              Difference]: Start difference. First operand 191 states and 214 transitions. Second operand 12 states.
[2020-07-10 20:26:09,020 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-10 20:26:09,021 INFO  L93              Difference]: Finished difference Result 349 states and 394 transitions.
[2020-07-10 20:26:09,021 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2020-07-10 20:26:09,021 INFO  L78                 Accepts]: Start accepts. Automaton has 12 states. Word has length 80
[2020-07-10 20:26:09,022 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-10 20:26:09,022 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2020-07-10 20:26:09,031 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 390 transitions.
[2020-07-10 20:26:09,032 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 12 states.
[2020-07-10 20:26:09,040 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 390 transitions.
[2020-07-10 20:26:09,041 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 390 transitions.
[2020-07-10 20:26:09,581 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 390 edges. 390 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-10 20:26:09,589 INFO  L225             Difference]: With dead ends: 349
[2020-07-10 20:26:09,590 INFO  L226             Difference]: Without dead ends: 204
[2020-07-10 20:26:09,593 INFO  L675         BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380
[2020-07-10 20:26:09,594 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 204 states.
[2020-07-10 20:26:09,996 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 193.
[2020-07-10 20:26:09,997 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-10 20:26:09,997 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 204 states. Second operand 193 states.
[2020-07-10 20:26:09,997 INFO  L74              IsIncluded]: Start isIncluded. First operand 204 states. Second operand 193 states.
[2020-07-10 20:26:09,997 INFO  L87              Difference]: Start difference. First operand 204 states. Second operand 193 states.
[2020-07-10 20:26:10,007 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-10 20:26:10,008 INFO  L93              Difference]: Finished difference Result 204 states and 231 transitions.
[2020-07-10 20:26:10,008 INFO  L276                IsEmpty]: Start isEmpty. Operand 204 states and 231 transitions.
[2020-07-10 20:26:10,009 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-10 20:26:10,010 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2020-07-10 20:26:10,010 INFO  L74              IsIncluded]: Start isIncluded. First operand 193 states. Second operand 204 states.
[2020-07-10 20:26:10,010 INFO  L87              Difference]: Start difference. First operand 193 states. Second operand 204 states.
[2020-07-10 20:26:10,021 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-10 20:26:10,021 INFO  L93              Difference]: Finished difference Result 204 states and 231 transitions.
[2020-07-10 20:26:10,021 INFO  L276                IsEmpty]: Start isEmpty. Operand 204 states and 231 transitions.
[2020-07-10 20:26:10,023 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-10 20:26:10,023 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2020-07-10 20:26:10,023 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2020-07-10 20:26:10,024 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-10 20:26:10,024 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 193 states.
[2020-07-10 20:26:10,033 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 217 transitions.
[2020-07-10 20:26:10,034 INFO  L78                 Accepts]: Start accepts. Automaton has 193 states and 217 transitions. Word has length 80
[2020-07-10 20:26:10,034 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2020-07-10 20:26:10,034 INFO  L479      AbstractCegarLoop]: Abstraction has 193 states and 217 transitions.
[2020-07-10 20:26:10,035 INFO  L480      AbstractCegarLoop]: Interpolant automaton has 12 states.
[2020-07-10 20:26:10,035 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 193 states and 217 transitions.
[2020-07-10 20:26:10,389 INFO  L119       InductivityCheck]: Floyd-Hoare automaton has 217 edges. 217 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2020-07-10 20:26:10,390 INFO  L276                IsEmpty]: Start isEmpty. Operand 193 states and 217 transitions.
[2020-07-10 20:26:10,392 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 102
[2020-07-10 20:26:10,392 INFO  L414         BasicCegarLoop]: Found error trace
[2020-07-10 20:26:10,392 INFO  L422         BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-10 20:26:10,393 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-07-10 20:26:10,393 INFO  L427      AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-10 20:26:10,393 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2020-07-10 20:26:10,394 INFO  L82        PathProgramCache]: Analyzing trace with hash -1271695359, now seen corresponding path program 1 times
[2020-07-10 20:26:10,395 INFO  L163   FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES
[2020-07-10 20:26:10,395 INFO  L354   FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [469316783]
[2020-07-10 20:26:10,395 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-10 20:26:10,411 WARN  L516      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-07-10 20:26:10,412 FATAL L?                        ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception:
java.lang.NullPointerException
	at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:442)
	at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.acceleratedInterpolationCore(AcceleratedInterpolation.java:277)
	at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.<init>(AcceleratedInterpolation.java:184)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:144)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.<init>(AutomatonFreeRefinementEngine.java:85)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.<init>(TraceAbstractionRefinementEngine.java:75)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.<init>(TraceAbstractionStarter.java:127)
	at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317)
	at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145)
	at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55)
[2020-07-10 20:26:10,420 INFO  L168              Benchmark]: Toolchain (without parser) took 15964.53 ms. Allocated memory was 137.9 MB in the beginning and 371.7 MB in the end (delta: 233.8 MB). Free memory was 102.8 MB in the beginning and 279.4 MB in the end (delta: -176.7 MB). Peak memory consumption was 57.2 MB. Max. memory is 7.1 GB.
[2020-07-10 20:26:10,421 INFO  L168              Benchmark]: CDTParser took 0.90 ms. Allocated memory is still 137.9 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
[2020-07-10 20:26:10,423 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 587.82 ms. Allocated memory was 137.9 MB in the beginning and 204.5 MB in the end (delta: 66.6 MB). Free memory was 102.5 MB in the beginning and 180.2 MB in the end (delta: -77.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB.
[2020-07-10 20:26:10,424 INFO  L168              Benchmark]: Boogie Preprocessor took 75.42 ms. Allocated memory is still 204.5 MB. Free memory was 180.2 MB in the beginning and 176.7 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB.
[2020-07-10 20:26:10,426 INFO  L168              Benchmark]: RCFGBuilder took 1046.49 ms. Allocated memory is still 204.5 MB. Free memory was 176.7 MB in the beginning and 100.3 MB in the end (delta: 76.4 MB). Peak memory consumption was 76.4 MB. Max. memory is 7.1 GB.
[2020-07-10 20:26:10,433 INFO  L168              Benchmark]: TraceAbstraction took 14248.25 ms. Allocated memory was 204.5 MB in the beginning and 371.7 MB in the end (delta: 167.2 MB). Free memory was 99.6 MB in the beginning and 279.4 MB in the end (delta: -179.8 MB). There was no memory consumed. Max. memory is 7.1 GB.
[2020-07-10 20:26:10,437 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.90 ms. Allocated memory is still 137.9 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
 * CACSL2BoogieTranslator took 587.82 ms. Allocated memory was 137.9 MB in the beginning and 204.5 MB in the end (delta: 66.6 MB). Free memory was 102.5 MB in the beginning and 180.2 MB in the end (delta: -77.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB.
 * Boogie Preprocessor took 75.42 ms. Allocated memory is still 204.5 MB. Free memory was 180.2 MB in the beginning and 176.7 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB.
 * RCFGBuilder took 1046.49 ms. Allocated memory is still 204.5 MB. Free memory was 176.7 MB in the beginning and 100.3 MB in the end (delta: 76.4 MB). Peak memory consumption was 76.4 MB. Max. memory is 7.1 GB.
 * TraceAbstraction took 14248.25 ms. Allocated memory was 204.5 MB in the beginning and 371.7 MB in the end (delta: 167.2 MB). Free memory was 99.6 MB in the beginning and 279.4 MB in the end (delta: -179.8 MB). There was no memory consumed. Max. memory is 7.1 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - ExceptionOrErrorResult: NullPointerException: null
    de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:442)
RESULT: Ultimate could not prove your program: Toolchain returned no result.
Received shutdown request...