/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/verifythis/tree_del_iter.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:29:58,589 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:29:58,592 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:29:58,607 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:29:58,607 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:29:58,608 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:29:58,610 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:29:58,612 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:29:58,613 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:29:58,614 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:29:58,615 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:29:58,617 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:29:58,617 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:29:58,618 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:29:58,619 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:29:58,620 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:29:58,621 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:29:58,622 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:29:58,624 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:29:58,626 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:29:58,628 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:29:58,629 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:29:58,630 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:29:58,631 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:29:58,634 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:29:58,634 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:29:58,634 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:29:58,635 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:29:58,636 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:29:58,637 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:29:58,637 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:29:58,637 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:29:58,638 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:29:58,639 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:29:58,640 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:29:58,640 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:29:58,641 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:29:58,641 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:29:58,641 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:29:58,642 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:29:58,643 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:29:58,644 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 15:29:58,659 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:29:58,659 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:29:58,663 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:29:58,663 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:29:58,663 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:29:58,664 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:29:58,664 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:29:58,664 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:29:58,664 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:29:58,664 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:29:58,664 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:29:58,665 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:29:58,665 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:29:58,665 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:29:58,668 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:29:58,669 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:29:58,669 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:29:58,669 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:29:58,670 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:29:58,670 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:29:58,670 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:29:58,670 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:29:58,670 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:29:58,671 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:29:58,671 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:29:58,671 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:29:58,671 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:29:58,671 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:29:58,672 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:29:58,672 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:29:58,988 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:29:59,003 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:29:59,006 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:29:59,008 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:29:59,008 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:29:59,009 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/tree_del_iter.c [2020-07-10 15:29:59,082 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2be5d7332/f19f863752ea4c3bb105bb0aebb5b30e/FLAG2f9617b52 [2020-07-10 15:29:59,562 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:29:59,563 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_iter.c [2020-07-10 15:29:59,576 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2be5d7332/f19f863752ea4c3bb105bb0aebb5b30e/FLAG2f9617b52 [2020-07-10 15:29:59,966 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2be5d7332/f19f863752ea4c3bb105bb0aebb5b30e [2020-07-10 15:29:59,979 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:29:59,981 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:29:59,983 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:29:59,983 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:29:59,987 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:29:59,989 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:29:59" (1/1) ... [2020-07-10 15:29:59,992 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17ba7188 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:59, skipping insertion in model container [2020-07-10 15:29:59,992 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:29:59" (1/1) ... [2020-07-10 15:30:00,001 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:30:00,029 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:30:00,214 WARN L1484 CHandler]: Possible shadowing of function min [2020-07-10 15:30:00,235 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:30:00,251 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:30:00,364 WARN L1484 CHandler]: Possible shadowing of function min [2020-07-10 15:30:00,389 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:30:00,412 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:30:00,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:30:00 WrapperNode [2020-07-10 15:30:00,413 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:30:00,413 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:30:00,413 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:30:00,414 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:30:00,428 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:30:00" (1/1) ... [2020-07-10 15:30:00,428 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:30:00" (1/1) ... [2020-07-10 15:30:00,441 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:30:00" (1/1) ... [2020-07-10 15:30:00,442 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:30:00" (1/1) ... [2020-07-10 15:30:00,470 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:30:00" (1/1) ... [2020-07-10 15:30:00,478 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:30:00" (1/1) ... [2020-07-10 15:30:00,481 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:30:00" (1/1) ... [2020-07-10 15:30:00,486 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:30:00,487 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:30:00,487 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:30:00,487 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:30:00,488 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:30:00" (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 15:30:00,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:30:00,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:30:00,556 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_cycle_if_not [2020-07-10 15:30:00,556 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:30:00,556 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2020-07-10 15:30:00,556 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2020-07-10 15:30:00,556 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2020-07-10 15:30:00,557 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2020-07-10 15:30:00,557 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2020-07-10 15:30:00,557 INFO L138 BoogieDeclarations]: Found implementation of procedure task [2020-07-10 15:30:00,557 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:30:00,557 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2020-07-10 15:30:00,557 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-10 15:30:00,558 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 15:30:00,558 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-10 15:30:00,558 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:30:00,558 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2020-07-10 15:30:00,558 INFO L130 BoogieDeclarations]: Found specification of procedure assume_cycle_if_not [2020-07-10 15:30:00,558 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:30:00,559 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:30:00,559 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2020-07-10 15:30:00,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 15:30:00,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:30:00,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-10 15:30:00,559 INFO L130 BoogieDeclarations]: Found specification of procedure min [2020-07-10 15:30:00,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:30:00,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-10 15:30:00,560 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2020-07-10 15:30:00,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:30:00,563 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2020-07-10 15:30:00,563 INFO L130 BoogieDeclarations]: Found specification of procedure size [2020-07-10 15:30:00,563 INFO L130 BoogieDeclarations]: Found specification of procedure task [2020-07-10 15:30:00,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 15:30:00,564 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2020-07-10 15:30:00,564 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:30:00,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:30:00,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:30:01,470 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:30:01,471 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-10 15:30:01,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:30:01 BoogieIcfgContainer [2020-07-10 15:30:01,482 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:30:01,484 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:30:01,484 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:30:01,488 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:30:01,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:29:59" (1/3) ... [2020-07-10 15:30:01,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@288127b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:30:01, skipping insertion in model container [2020-07-10 15:30:01,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:30:00" (2/3) ... [2020-07-10 15:30:01,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@288127b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:30:01, skipping insertion in model container [2020-07-10 15:30:01,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:30:01" (3/3) ... [2020-07-10 15:30:01,495 INFO L109 eAbstractionObserver]: Analyzing ICFG tree_del_iter.c [2020-07-10 15:30:01,506 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:30:01,514 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:30:01,529 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:30:01,568 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:30:01,568 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:30:01,568 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:30:01,569 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:30:01,569 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:30:01,570 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:30:01,570 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:30:01,570 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:30:01,601 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2020-07-10 15:30:01,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-07-10 15:30:01,617 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:30:01,618 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:30:01,618 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:30:01,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:30:01,625 INFO L82 PathProgramCache]: Analyzing trace with hash 806421993, now seen corresponding path program 1 times [2020-07-10 15:30:01,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:30:01,634 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452157626] [2020-07-10 15:30:01,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:30:01,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:02,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:02,034 INFO L280 TraceCheckUtils]: 0: Hoare triple {130#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {101#true} is VALID [2020-07-10 15:30:02,034 INFO L280 TraceCheckUtils]: 1: Hoare triple {101#true} assume true; {101#true} is VALID [2020-07-10 15:30:02,036 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {101#true} {101#true} #195#return; {101#true} is VALID [2020-07-10 15:30:02,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:02,076 INFO L280 TraceCheckUtils]: 0: Hoare triple {131#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {101#true} is VALID [2020-07-10 15:30:02,076 INFO L280 TraceCheckUtils]: 1: Hoare triple {101#true} assume true; {101#true} is VALID [2020-07-10 15:30:02,077 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {101#true} {101#true} #153#return; {101#true} is VALID [2020-07-10 15:30:02,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:02,083 INFO L280 TraceCheckUtils]: 0: Hoare triple {101#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {101#true} is VALID [2020-07-10 15:30:02,083 INFO L280 TraceCheckUtils]: 1: Hoare triple {101#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {101#true} is VALID [2020-07-10 15:30:02,084 INFO L280 TraceCheckUtils]: 2: Hoare triple {101#true} assume true; {101#true} is VALID [2020-07-10 15:30:02,084 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {101#true} {101#true} #165#return; {101#true} is VALID [2020-07-10 15:30:02,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:02,110 INFO L280 TraceCheckUtils]: 0: Hoare triple {101#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {101#true} is VALID [2020-07-10 15:30:02,112 INFO L280 TraceCheckUtils]: 1: Hoare triple {101#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {132#(= 0 |size_#res|)} is VALID [2020-07-10 15:30:02,113 INFO L280 TraceCheckUtils]: 2: Hoare triple {132#(= 0 |size_#res|)} assume true; {132#(= 0 |size_#res|)} is VALID [2020-07-10 15:30:02,114 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {132#(= 0 |size_#res|)} {101#true} #167#return; {117#(= 0 |task_#t~ret29|)} is VALID [2020-07-10 15:30:02,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:02,152 INFO L280 TraceCheckUtils]: 0: Hoare triple {101#true} ~cond := #in~cond; {133#(= assume_cycle_if_not_~cond |assume_cycle_if_not_#in~cond|)} is VALID [2020-07-10 15:30:02,153 INFO L280 TraceCheckUtils]: 1: Hoare triple {133#(= assume_cycle_if_not_~cond |assume_cycle_if_not_#in~cond|)} assume !(0 == ~cond); {134#(not (= 0 |assume_cycle_if_not_#in~cond|))} is VALID [2020-07-10 15:30:02,154 INFO L280 TraceCheckUtils]: 2: Hoare triple {134#(not (= 0 |assume_cycle_if_not_#in~cond|))} assume true; {134#(not (= 0 |assume_cycle_if_not_#in~cond|))} is VALID [2020-07-10 15:30:02,156 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {134#(not (= 0 |assume_cycle_if_not_#in~cond|))} {118#(= 0 task_~n~1)} #169#return; {102#false} is VALID [2020-07-10 15:30:02,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:02,176 INFO L280 TraceCheckUtils]: 0: Hoare triple {135#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {101#true} is VALID [2020-07-10 15:30:02,176 INFO L280 TraceCheckUtils]: 1: Hoare triple {101#true} assume true; {101#true} is VALID [2020-07-10 15:30:02,177 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {101#true} {102#false} #171#return; {102#false} is VALID [2020-07-10 15:30:02,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:02,205 INFO L280 TraceCheckUtils]: 0: Hoare triple {136#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {101#true} is VALID [2020-07-10 15:30:02,205 INFO L280 TraceCheckUtils]: 1: Hoare triple {101#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {101#true} is VALID [2020-07-10 15:30:02,205 INFO L280 TraceCheckUtils]: 2: Hoare triple {101#true} assume true; {101#true} is VALID [2020-07-10 15:30:02,206 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {101#true} {102#false} #173#return; {102#false} is VALID [2020-07-10 15:30:02,207 INFO L263 TraceCheckUtils]: 0: Hoare triple {101#true} call ULTIMATE.init(); {130#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:30:02,208 INFO L280 TraceCheckUtils]: 1: Hoare triple {130#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {101#true} is VALID [2020-07-10 15:30:02,208 INFO L280 TraceCheckUtils]: 2: Hoare triple {101#true} assume true; {101#true} is VALID [2020-07-10 15:30:02,208 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {101#true} {101#true} #195#return; {101#true} is VALID [2020-07-10 15:30:02,209 INFO L263 TraceCheckUtils]: 4: Hoare triple {101#true} call #t~ret42 := main(); {101#true} is VALID [2020-07-10 15:30:02,210 INFO L263 TraceCheckUtils]: 5: Hoare triple {101#true} call #t~ret41.base, #t~ret41.offset := nondet_tree(); {131#(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 15:30:02,210 INFO L280 TraceCheckUtils]: 6: Hoare triple {131#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {101#true} is VALID [2020-07-10 15:30:02,211 INFO L280 TraceCheckUtils]: 7: Hoare triple {101#true} assume true; {101#true} is VALID [2020-07-10 15:30:02,211 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {101#true} {101#true} #153#return; {101#true} is VALID [2020-07-10 15:30:02,211 INFO L263 TraceCheckUtils]: 9: Hoare triple {101#true} call task(#t~ret41.base, #t~ret41.offset); {101#true} is VALID [2020-07-10 15:30:02,212 INFO L280 TraceCheckUtils]: 10: Hoare triple {101#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {101#true} is VALID [2020-07-10 15:30:02,212 INFO L263 TraceCheckUtils]: 11: Hoare triple {101#true} call #t~ret28 := min(~t.base, ~t.offset); {101#true} is VALID [2020-07-10 15:30:02,213 INFO L280 TraceCheckUtils]: 12: Hoare triple {101#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {101#true} is VALID [2020-07-10 15:30:02,213 INFO L280 TraceCheckUtils]: 13: Hoare triple {101#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {101#true} is VALID [2020-07-10 15:30:02,213 INFO L280 TraceCheckUtils]: 14: Hoare triple {101#true} assume true; {101#true} is VALID [2020-07-10 15:30:02,214 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {101#true} {101#true} #165#return; {101#true} is VALID [2020-07-10 15:30:02,214 INFO L280 TraceCheckUtils]: 16: Hoare triple {101#true} assume -2147483648 <= #t~ret28 && #t~ret28 <= 2147483647;~a~1 := #t~ret28;havoc #t~ret28;call ~#b~1.base, ~#b~1.offset := #Ultimate.allocOnStack(4); {101#true} is VALID [2020-07-10 15:30:02,214 INFO L263 TraceCheckUtils]: 17: Hoare triple {101#true} call #t~ret29 := size(~t.base, ~t.offset); {101#true} is VALID [2020-07-10 15:30:02,215 INFO L280 TraceCheckUtils]: 18: Hoare triple {101#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {101#true} is VALID [2020-07-10 15:30:02,216 INFO L280 TraceCheckUtils]: 19: Hoare triple {101#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {132#(= 0 |size_#res|)} is VALID [2020-07-10 15:30:02,217 INFO L280 TraceCheckUtils]: 20: Hoare triple {132#(= 0 |size_#res|)} assume true; {132#(= 0 |size_#res|)} is VALID [2020-07-10 15:30:02,218 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {132#(= 0 |size_#res|)} {101#true} #167#return; {117#(= 0 |task_#t~ret29|)} is VALID [2020-07-10 15:30:02,219 INFO L280 TraceCheckUtils]: 22: Hoare triple {117#(= 0 |task_#t~ret29|)} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~n~1 := #t~ret29;havoc #t~ret29; {118#(= 0 task_~n~1)} is VALID [2020-07-10 15:30:02,220 INFO L263 TraceCheckUtils]: 23: Hoare triple {118#(= 0 task_~n~1)} call assume_cycle_if_not((if 0 != ~n~1 then 1 else 0)); {101#true} is VALID [2020-07-10 15:30:02,220 INFO L280 TraceCheckUtils]: 24: Hoare triple {101#true} ~cond := #in~cond; {133#(= assume_cycle_if_not_~cond |assume_cycle_if_not_#in~cond|)} is VALID [2020-07-10 15:30:02,221 INFO L280 TraceCheckUtils]: 25: Hoare triple {133#(= assume_cycle_if_not_~cond |assume_cycle_if_not_#in~cond|)} assume !(0 == ~cond); {134#(not (= 0 |assume_cycle_if_not_#in~cond|))} is VALID [2020-07-10 15:30:02,222 INFO L280 TraceCheckUtils]: 26: Hoare triple {134#(not (= 0 |assume_cycle_if_not_#in~cond|))} assume true; {134#(not (= 0 |assume_cycle_if_not_#in~cond|))} is VALID [2020-07-10 15:30:02,223 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {134#(not (= 0 |assume_cycle_if_not_#in~cond|))} {118#(= 0 task_~n~1)} #169#return; {102#false} is VALID [2020-07-10 15:30:02,223 INFO L280 TraceCheckUtils]: 28: Hoare triple {102#false} call #t~malloc30.base, #t~malloc30.offset := #Ultimate.allocOnHeap(4 * ~n~1); {102#false} is VALID [2020-07-10 15:30:02,224 INFO L263 TraceCheckUtils]: 29: Hoare triple {102#false} call #Ultimate.meminit(#t~malloc30.base, #t~malloc30.offset, ~n~1, 4, 4 * ~n~1); {135#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:30:02,224 INFO L280 TraceCheckUtils]: 30: Hoare triple {135#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {101#true} is VALID [2020-07-10 15:30:02,225 INFO L280 TraceCheckUtils]: 31: Hoare triple {101#true} assume true; {101#true} is VALID [2020-07-10 15:30:02,225 INFO L275 TraceCheckUtils]: 32: Hoare quadruple {101#true} {102#false} #171#return; {102#false} is VALID [2020-07-10 15:30:02,225 INFO L280 TraceCheckUtils]: 33: Hoare triple {102#false} ~x~0.base, ~x~0.offset := #t~malloc30.base, #t~malloc30.offset; {102#false} is VALID [2020-07-10 15:30:02,226 INFO L263 TraceCheckUtils]: 34: Hoare triple {102#false} call #t~ret31 := tree_inorder(~t.base, ~t.offset, ~x~0.base, ~x~0.offset, ~n~1); {136#(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 15:30:02,226 INFO L280 TraceCheckUtils]: 35: Hoare triple {136#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {101#true} is VALID [2020-07-10 15:30:02,226 INFO L280 TraceCheckUtils]: 36: Hoare triple {101#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {101#true} is VALID [2020-07-10 15:30:02,227 INFO L280 TraceCheckUtils]: 37: Hoare triple {101#true} assume true; {101#true} is VALID [2020-07-10 15:30:02,227 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {101#true} {102#false} #173#return; {102#false} is VALID [2020-07-10 15:30:02,227 INFO L280 TraceCheckUtils]: 39: Hoare triple {102#false} assume -2147483648 <= #t~ret31 && #t~ret31 <= 2147483647;havoc #t~ret31;call #t~mem32 := read~int(~x~0.base, ~x~0.offset, 4); {102#false} is VALID [2020-07-10 15:30:02,228 INFO L263 TraceCheckUtils]: 40: Hoare triple {102#false} call __VERIFIER_assert((if ~a~1 == #t~mem32 then 1 else 0)); {102#false} is VALID [2020-07-10 15:30:02,228 INFO L280 TraceCheckUtils]: 41: Hoare triple {102#false} ~cond := #in~cond; {102#false} is VALID [2020-07-10 15:30:02,228 INFO L280 TraceCheckUtils]: 42: Hoare triple {102#false} assume 0 == ~cond; {102#false} is VALID [2020-07-10 15:30:02,228 INFO L280 TraceCheckUtils]: 43: Hoare triple {102#false} assume !false; {102#false} is VALID [2020-07-10 15:30:02,238 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 15:30:02,239 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452157626] [2020-07-10 15:30:02,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:30:02,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-10 15:30:02,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883708542] [2020-07-10 15:30:02,251 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2020-07-10 15:30:02,254 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:30:02,259 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-10 15:30:02,338 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:30:02,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-10 15:30:02,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:30:02,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-10 15:30:02,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-07-10 15:30:02,356 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 11 states. [2020-07-10 15:30:05,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:05,073 INFO L93 Difference]: Finished difference Result 174 states and 235 transitions. [2020-07-10 15:30:05,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-10 15:30:05,073 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2020-07-10 15:30:05,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:30:05,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 15:30:05,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 235 transitions. [2020-07-10 15:30:05,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 15:30:05,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 235 transitions. [2020-07-10 15:30:05,117 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 235 transitions. [2020-07-10 15:30:05,530 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 235 edges. 235 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:30:05,551 INFO L225 Difference]: With dead ends: 174 [2020-07-10 15:30:05,551 INFO L226 Difference]: Without dead ends: 98 [2020-07-10 15:30:05,556 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2020-07-10 15:30:05,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-07-10 15:30:05,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 91. [2020-07-10 15:30:05,664 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:30:05,664 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand 91 states. [2020-07-10 15:30:05,665 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 91 states. [2020-07-10 15:30:05,665 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 91 states. [2020-07-10 15:30:05,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:05,678 INFO L93 Difference]: Finished difference Result 98 states and 127 transitions. [2020-07-10 15:30:05,679 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 127 transitions. [2020-07-10 15:30:05,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:30:05,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:30:05,683 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 98 states. [2020-07-10 15:30:05,683 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 98 states. [2020-07-10 15:30:05,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:05,694 INFO L93 Difference]: Finished difference Result 98 states and 127 transitions. [2020-07-10 15:30:05,694 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 127 transitions. [2020-07-10 15:30:05,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:30:05,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:30:05,698 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:30:05,699 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:30:05,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-07-10 15:30:05,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 115 transitions. [2020-07-10 15:30:05,708 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 115 transitions. Word has length 44 [2020-07-10 15:30:05,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:30:05,709 INFO L479 AbstractCegarLoop]: Abstraction has 91 states and 115 transitions. [2020-07-10 15:30:05,709 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-10 15:30:05,709 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 115 transitions. [2020-07-10 15:30:05,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-07-10 15:30:05,713 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:30:05,713 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:30:05,713 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:30:05,714 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:30:05,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:30:05,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1561052270, now seen corresponding path program 1 times [2020-07-10 15:30:05,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:30:05,715 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157045133] [2020-07-10 15:30:05,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:30:05,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:05,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:05,887 INFO L280 TraceCheckUtils]: 0: Hoare triple {753#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {711#true} is VALID [2020-07-10 15:30:05,887 INFO L280 TraceCheckUtils]: 1: Hoare triple {711#true} assume true; {711#true} is VALID [2020-07-10 15:30:05,888 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {711#true} {711#true} #195#return; {711#true} is VALID [2020-07-10 15:30:05,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:05,944 INFO L280 TraceCheckUtils]: 0: Hoare triple {754#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {755#(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 15:30:05,945 INFO L280 TraceCheckUtils]: 1: Hoare triple {755#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} assume true; {755#(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 15:30:05,947 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {755#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} {711#true} #153#return; {719#(and (= 0 |main_#t~ret41.base|) (= 0 |main_#t~ret41.offset|))} is VALID [2020-07-10 15:30:05,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:05,954 INFO L280 TraceCheckUtils]: 0: Hoare triple {711#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {711#true} is VALID [2020-07-10 15:30:05,955 INFO L280 TraceCheckUtils]: 1: Hoare triple {711#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {711#true} is VALID [2020-07-10 15:30:05,955 INFO L280 TraceCheckUtils]: 2: Hoare triple {711#true} assume true; {711#true} is VALID [2020-07-10 15:30:05,956 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {711#true} {721#(and (= 0 task_~t.offset) (= 0 task_~t.base))} #165#return; {721#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID [2020-07-10 15:30:05,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:06,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:06,023 INFO L280 TraceCheckUtils]: 0: Hoare triple {711#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {711#true} is VALID [2020-07-10 15:30:06,023 INFO L280 TraceCheckUtils]: 1: Hoare triple {711#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {711#true} is VALID [2020-07-10 15:30:06,024 INFO L280 TraceCheckUtils]: 2: Hoare triple {711#true} assume true; {711#true} is VALID [2020-07-10 15:30:06,025 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {711#true} {757#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #191#return; {757#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 15:30:06,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:06,031 INFO L280 TraceCheckUtils]: 0: Hoare triple {711#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {711#true} is VALID [2020-07-10 15:30:06,032 INFO L280 TraceCheckUtils]: 1: Hoare triple {711#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {711#true} is VALID [2020-07-10 15:30:06,032 INFO L280 TraceCheckUtils]: 2: Hoare triple {711#true} assume true; {711#true} is VALID [2020-07-10 15:30:06,033 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {711#true} {757#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #193#return; {757#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 15:30:06,034 INFO L280 TraceCheckUtils]: 0: Hoare triple {711#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {756#(and (= |size_#in~t.base| size_~t.base) (= |size_#in~t.offset| size_~t.offset))} is VALID [2020-07-10 15:30:06,035 INFO L280 TraceCheckUtils]: 1: Hoare triple {756#(and (= |size_#in~t.base| size_~t.base) (= |size_#in~t.offset| size_~t.offset))} assume !(~t.base == 0 && ~t.offset == 0);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 4); {757#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 15:30:06,036 INFO L263 TraceCheckUtils]: 2: Hoare triple {757#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} call #t~ret25 := size(#t~mem24.base, #t~mem24.offset); {711#true} is VALID [2020-07-10 15:30:06,036 INFO L280 TraceCheckUtils]: 3: Hoare triple {711#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {711#true} is VALID [2020-07-10 15:30:06,036 INFO L280 TraceCheckUtils]: 4: Hoare triple {711#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {711#true} is VALID [2020-07-10 15:30:06,037 INFO L280 TraceCheckUtils]: 5: Hoare triple {711#true} assume true; {711#true} is VALID [2020-07-10 15:30:06,038 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {711#true} {757#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #191#return; {757#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 15:30:06,039 INFO L280 TraceCheckUtils]: 7: Hoare triple {757#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume -2147483648 <= #t~ret25 && #t~ret25 <= 2147483647;call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~t.base, 8 + ~t.offset, 4); {757#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 15:30:06,039 INFO L263 TraceCheckUtils]: 8: Hoare triple {757#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} call #t~ret27 := size(#t~mem26.base, #t~mem26.offset); {711#true} is VALID [2020-07-10 15:30:06,039 INFO L280 TraceCheckUtils]: 9: Hoare triple {711#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {711#true} is VALID [2020-07-10 15:30:06,040 INFO L280 TraceCheckUtils]: 10: Hoare triple {711#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {711#true} is VALID [2020-07-10 15:30:06,040 INFO L280 TraceCheckUtils]: 11: Hoare triple {711#true} assume true; {711#true} is VALID [2020-07-10 15:30:06,041 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {711#true} {757#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #193#return; {757#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 15:30:06,042 INFO L280 TraceCheckUtils]: 13: Hoare triple {757#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume -2147483648 <= #t~ret27 && #t~ret27 <= 2147483647;#res := 1 + (#t~ret25 + #t~ret27);havoc #t~mem26.base, #t~mem26.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~ret25;havoc #t~ret27; {757#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 15:30:06,043 INFO L280 TraceCheckUtils]: 14: Hoare triple {757#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume true; {757#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 15:30:06,044 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {757#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} {721#(and (= 0 task_~t.offset) (= 0 task_~t.base))} #167#return; {712#false} is VALID [2020-07-10 15:30:06,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:06,052 INFO L280 TraceCheckUtils]: 0: Hoare triple {711#true} ~cond := #in~cond; {711#true} is VALID [2020-07-10 15:30:06,052 INFO L280 TraceCheckUtils]: 1: Hoare triple {711#true} assume !(0 == ~cond); {711#true} is VALID [2020-07-10 15:30:06,052 INFO L280 TraceCheckUtils]: 2: Hoare triple {711#true} assume true; {711#true} is VALID [2020-07-10 15:30:06,053 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {711#true} {712#false} #169#return; {712#false} is VALID [2020-07-10 15:30:06,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:06,070 INFO L280 TraceCheckUtils]: 0: Hoare triple {766#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {711#true} is VALID [2020-07-10 15:30:06,070 INFO L280 TraceCheckUtils]: 1: Hoare triple {711#true} assume true; {711#true} is VALID [2020-07-10 15:30:06,071 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {711#true} {712#false} #171#return; {712#false} is VALID [2020-07-10 15:30:06,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:06,095 INFO L280 TraceCheckUtils]: 0: Hoare triple {767#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {711#true} is VALID [2020-07-10 15:30:06,095 INFO L280 TraceCheckUtils]: 1: Hoare triple {711#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {711#true} is VALID [2020-07-10 15:30:06,095 INFO L280 TraceCheckUtils]: 2: Hoare triple {711#true} assume true; {711#true} is VALID [2020-07-10 15:30:06,096 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {711#true} {712#false} #173#return; {712#false} is VALID [2020-07-10 15:30:06,097 INFO L263 TraceCheckUtils]: 0: Hoare triple {711#true} call ULTIMATE.init(); {753#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:30:06,097 INFO L280 TraceCheckUtils]: 1: Hoare triple {753#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {711#true} is VALID [2020-07-10 15:30:06,097 INFO L280 TraceCheckUtils]: 2: Hoare triple {711#true} assume true; {711#true} is VALID [2020-07-10 15:30:06,098 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {711#true} {711#true} #195#return; {711#true} is VALID [2020-07-10 15:30:06,098 INFO L263 TraceCheckUtils]: 4: Hoare triple {711#true} call #t~ret42 := main(); {711#true} is VALID [2020-07-10 15:30:06,099 INFO L263 TraceCheckUtils]: 5: Hoare triple {711#true} call #t~ret41.base, #t~ret41.offset := nondet_tree(); {754#(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 15:30:06,100 INFO L280 TraceCheckUtils]: 6: Hoare triple {754#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {755#(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 15:30:06,101 INFO L280 TraceCheckUtils]: 7: Hoare triple {755#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} assume true; {755#(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 15:30:06,102 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {755#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} {711#true} #153#return; {719#(and (= 0 |main_#t~ret41.base|) (= 0 |main_#t~ret41.offset|))} is VALID [2020-07-10 15:30:06,104 INFO L263 TraceCheckUtils]: 9: Hoare triple {719#(and (= 0 |main_#t~ret41.base|) (= 0 |main_#t~ret41.offset|))} call task(#t~ret41.base, #t~ret41.offset); {720#(and (= 0 |task_#in~t.offset|) (= |task_#in~t.base| 0))} is VALID [2020-07-10 15:30:06,104 INFO L280 TraceCheckUtils]: 10: Hoare triple {720#(and (= 0 |task_#in~t.offset|) (= |task_#in~t.base| 0))} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {721#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID [2020-07-10 15:30:06,105 INFO L263 TraceCheckUtils]: 11: Hoare triple {721#(and (= 0 task_~t.offset) (= 0 task_~t.base))} call #t~ret28 := min(~t.base, ~t.offset); {711#true} is VALID [2020-07-10 15:30:06,105 INFO L280 TraceCheckUtils]: 12: Hoare triple {711#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {711#true} is VALID [2020-07-10 15:30:06,105 INFO L280 TraceCheckUtils]: 13: Hoare triple {711#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {711#true} is VALID [2020-07-10 15:30:06,106 INFO L280 TraceCheckUtils]: 14: Hoare triple {711#true} assume true; {711#true} is VALID [2020-07-10 15:30:06,107 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {711#true} {721#(and (= 0 task_~t.offset) (= 0 task_~t.base))} #165#return; {721#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID [2020-07-10 15:30:06,108 INFO L280 TraceCheckUtils]: 16: Hoare triple {721#(and (= 0 task_~t.offset) (= 0 task_~t.base))} assume -2147483648 <= #t~ret28 && #t~ret28 <= 2147483647;~a~1 := #t~ret28;havoc #t~ret28;call ~#b~1.base, ~#b~1.offset := #Ultimate.allocOnStack(4); {721#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID [2020-07-10 15:30:06,108 INFO L263 TraceCheckUtils]: 17: Hoare triple {721#(and (= 0 task_~t.offset) (= 0 task_~t.base))} call #t~ret29 := size(~t.base, ~t.offset); {711#true} is VALID [2020-07-10 15:30:06,109 INFO L280 TraceCheckUtils]: 18: Hoare triple {711#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {756#(and (= |size_#in~t.base| size_~t.base) (= |size_#in~t.offset| size_~t.offset))} is VALID [2020-07-10 15:30:06,110 INFO L280 TraceCheckUtils]: 19: Hoare triple {756#(and (= |size_#in~t.base| size_~t.base) (= |size_#in~t.offset| size_~t.offset))} assume !(~t.base == 0 && ~t.offset == 0);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 4); {757#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 15:30:06,110 INFO L263 TraceCheckUtils]: 20: Hoare triple {757#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} call #t~ret25 := size(#t~mem24.base, #t~mem24.offset); {711#true} is VALID [2020-07-10 15:30:06,111 INFO L280 TraceCheckUtils]: 21: Hoare triple {711#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {711#true} is VALID [2020-07-10 15:30:06,111 INFO L280 TraceCheckUtils]: 22: Hoare triple {711#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {711#true} is VALID [2020-07-10 15:30:06,111 INFO L280 TraceCheckUtils]: 23: Hoare triple {711#true} assume true; {711#true} is VALID [2020-07-10 15:30:06,112 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {711#true} {757#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #191#return; {757#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 15:30:06,113 INFO L280 TraceCheckUtils]: 25: Hoare triple {757#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume -2147483648 <= #t~ret25 && #t~ret25 <= 2147483647;call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~t.base, 8 + ~t.offset, 4); {757#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 15:30:06,113 INFO L263 TraceCheckUtils]: 26: Hoare triple {757#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} call #t~ret27 := size(#t~mem26.base, #t~mem26.offset); {711#true} is VALID [2020-07-10 15:30:06,114 INFO L280 TraceCheckUtils]: 27: Hoare triple {711#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {711#true} is VALID [2020-07-10 15:30:06,114 INFO L280 TraceCheckUtils]: 28: Hoare triple {711#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {711#true} is VALID [2020-07-10 15:30:06,114 INFO L280 TraceCheckUtils]: 29: Hoare triple {711#true} assume true; {711#true} is VALID [2020-07-10 15:30:06,115 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {711#true} {757#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #193#return; {757#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 15:30:06,116 INFO L280 TraceCheckUtils]: 31: Hoare triple {757#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume -2147483648 <= #t~ret27 && #t~ret27 <= 2147483647;#res := 1 + (#t~ret25 + #t~ret27);havoc #t~mem26.base, #t~mem26.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~ret25;havoc #t~ret27; {757#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 15:30:06,116 INFO L280 TraceCheckUtils]: 32: Hoare triple {757#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume true; {757#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 15:30:06,118 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {757#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} {721#(and (= 0 task_~t.offset) (= 0 task_~t.base))} #167#return; {712#false} is VALID [2020-07-10 15:30:06,118 INFO L280 TraceCheckUtils]: 34: Hoare triple {712#false} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~n~1 := #t~ret29;havoc #t~ret29; {712#false} is VALID [2020-07-10 15:30:06,118 INFO L263 TraceCheckUtils]: 35: Hoare triple {712#false} call assume_cycle_if_not((if 0 != ~n~1 then 1 else 0)); {711#true} is VALID [2020-07-10 15:30:06,119 INFO L280 TraceCheckUtils]: 36: Hoare triple {711#true} ~cond := #in~cond; {711#true} is VALID [2020-07-10 15:30:06,119 INFO L280 TraceCheckUtils]: 37: Hoare triple {711#true} assume !(0 == ~cond); {711#true} is VALID [2020-07-10 15:30:06,119 INFO L280 TraceCheckUtils]: 38: Hoare triple {711#true} assume true; {711#true} is VALID [2020-07-10 15:30:06,119 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {711#true} {712#false} #169#return; {712#false} is VALID [2020-07-10 15:30:06,120 INFO L280 TraceCheckUtils]: 40: Hoare triple {712#false} call #t~malloc30.base, #t~malloc30.offset := #Ultimate.allocOnHeap(4 * ~n~1); {712#false} is VALID [2020-07-10 15:30:06,120 INFO L263 TraceCheckUtils]: 41: Hoare triple {712#false} call #Ultimate.meminit(#t~malloc30.base, #t~malloc30.offset, ~n~1, 4, 4 * ~n~1); {766#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:30:06,120 INFO L280 TraceCheckUtils]: 42: Hoare triple {766#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {711#true} is VALID [2020-07-10 15:30:06,120 INFO L280 TraceCheckUtils]: 43: Hoare triple {711#true} assume true; {711#true} is VALID [2020-07-10 15:30:06,121 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {711#true} {712#false} #171#return; {712#false} is VALID [2020-07-10 15:30:06,121 INFO L280 TraceCheckUtils]: 45: Hoare triple {712#false} ~x~0.base, ~x~0.offset := #t~malloc30.base, #t~malloc30.offset; {712#false} is VALID [2020-07-10 15:30:06,121 INFO L263 TraceCheckUtils]: 46: Hoare triple {712#false} call #t~ret31 := tree_inorder(~t.base, ~t.offset, ~x~0.base, ~x~0.offset, ~n~1); {767#(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 15:30:06,121 INFO L280 TraceCheckUtils]: 47: Hoare triple {767#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {711#true} is VALID [2020-07-10 15:30:06,122 INFO L280 TraceCheckUtils]: 48: Hoare triple {711#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {711#true} is VALID [2020-07-10 15:30:06,122 INFO L280 TraceCheckUtils]: 49: Hoare triple {711#true} assume true; {711#true} is VALID [2020-07-10 15:30:06,122 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {711#true} {712#false} #173#return; {712#false} is VALID [2020-07-10 15:30:06,122 INFO L280 TraceCheckUtils]: 51: Hoare triple {712#false} assume -2147483648 <= #t~ret31 && #t~ret31 <= 2147483647;havoc #t~ret31;call #t~mem32 := read~int(~x~0.base, ~x~0.offset, 4); {712#false} is VALID [2020-07-10 15:30:06,123 INFO L263 TraceCheckUtils]: 52: Hoare triple {712#false} call __VERIFIER_assert((if ~a~1 == #t~mem32 then 1 else 0)); {712#false} is VALID [2020-07-10 15:30:06,123 INFO L280 TraceCheckUtils]: 53: Hoare triple {712#false} ~cond := #in~cond; {712#false} is VALID [2020-07-10 15:30:06,123 INFO L280 TraceCheckUtils]: 54: Hoare triple {712#false} assume 0 == ~cond; {712#false} is VALID [2020-07-10 15:30:06,123 INFO L280 TraceCheckUtils]: 55: Hoare triple {712#false} assume !false; {712#false} is VALID [2020-07-10 15:30:06,130 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-10 15:30:06,130 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157045133] [2020-07-10 15:30:06,130 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579254487] [2020-07-10 15:30:06,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:30:06,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:06,224 INFO L264 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 25 conjunts are in the unsatisfiable core [2020-07-10 15:30:06,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:06,251 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:30:06,379 INFO L263 TraceCheckUtils]: 0: Hoare triple {711#true} call ULTIMATE.init(); {711#true} is VALID [2020-07-10 15:30:06,380 INFO L280 TraceCheckUtils]: 1: Hoare triple {711#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {711#true} is VALID [2020-07-10 15:30:06,380 INFO L280 TraceCheckUtils]: 2: Hoare triple {711#true} assume true; {711#true} is VALID [2020-07-10 15:30:06,380 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {711#true} {711#true} #195#return; {711#true} is VALID [2020-07-10 15:30:06,381 INFO L263 TraceCheckUtils]: 4: Hoare triple {711#true} call #t~ret42 := main(); {711#true} is VALID [2020-07-10 15:30:06,381 INFO L263 TraceCheckUtils]: 5: Hoare triple {711#true} call #t~ret41.base, #t~ret41.offset := nondet_tree(); {711#true} is VALID [2020-07-10 15:30:06,382 INFO L280 TraceCheckUtils]: 6: Hoare triple {711#true} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {755#(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 15:30:06,383 INFO L280 TraceCheckUtils]: 7: Hoare triple {755#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} assume true; {755#(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 15:30:06,384 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {755#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} {711#true} #153#return; {719#(and (= 0 |main_#t~ret41.base|) (= 0 |main_#t~ret41.offset|))} is VALID [2020-07-10 15:30:06,403 INFO L263 TraceCheckUtils]: 9: Hoare triple {719#(and (= 0 |main_#t~ret41.base|) (= 0 |main_#t~ret41.offset|))} call task(#t~ret41.base, #t~ret41.offset); {720#(and (= 0 |task_#in~t.offset|) (= |task_#in~t.base| 0))} is VALID [2020-07-10 15:30:06,405 INFO L280 TraceCheckUtils]: 10: Hoare triple {720#(and (= 0 |task_#in~t.offset|) (= |task_#in~t.base| 0))} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {721#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID [2020-07-10 15:30:06,405 INFO L263 TraceCheckUtils]: 11: Hoare triple {721#(and (= 0 task_~t.offset) (= 0 task_~t.base))} call #t~ret28 := min(~t.base, ~t.offset); {711#true} is VALID [2020-07-10 15:30:06,405 INFO L280 TraceCheckUtils]: 12: Hoare triple {711#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {711#true} is VALID [2020-07-10 15:30:06,406 INFO L280 TraceCheckUtils]: 13: Hoare triple {711#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {711#true} is VALID [2020-07-10 15:30:06,406 INFO L280 TraceCheckUtils]: 14: Hoare triple {711#true} assume true; {711#true} is VALID [2020-07-10 15:30:06,407 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {711#true} {721#(and (= 0 task_~t.offset) (= 0 task_~t.base))} #165#return; {721#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID [2020-07-10 15:30:06,409 INFO L280 TraceCheckUtils]: 16: Hoare triple {721#(and (= 0 task_~t.offset) (= 0 task_~t.base))} assume -2147483648 <= #t~ret28 && #t~ret28 <= 2147483647;~a~1 := #t~ret28;havoc #t~ret28;call ~#b~1.base, ~#b~1.offset := #Ultimate.allocOnStack(4); {721#(and (= 0 task_~t.offset) (= 0 task_~t.base))} is VALID [2020-07-10 15:30:06,409 INFO L263 TraceCheckUtils]: 17: Hoare triple {721#(and (= 0 task_~t.offset) (= 0 task_~t.base))} call #t~ret29 := size(~t.base, ~t.offset); {711#true} is VALID [2020-07-10 15:30:06,411 INFO L280 TraceCheckUtils]: 18: Hoare triple {711#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {756#(and (= |size_#in~t.base| size_~t.base) (= |size_#in~t.offset| size_~t.offset))} is VALID [2020-07-10 15:30:06,413 INFO L280 TraceCheckUtils]: 19: Hoare triple {756#(and (= |size_#in~t.base| size_~t.base) (= |size_#in~t.offset| size_~t.offset))} assume !(~t.base == 0 && ~t.offset == 0);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 4); {757#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 15:30:06,413 INFO L263 TraceCheckUtils]: 20: Hoare triple {757#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} call #t~ret25 := size(#t~mem24.base, #t~mem24.offset); {711#true} is VALID [2020-07-10 15:30:06,413 INFO L280 TraceCheckUtils]: 21: Hoare triple {711#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {711#true} is VALID [2020-07-10 15:30:06,414 INFO L280 TraceCheckUtils]: 22: Hoare triple {711#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {711#true} is VALID [2020-07-10 15:30:06,414 INFO L280 TraceCheckUtils]: 23: Hoare triple {711#true} assume true; {711#true} is VALID [2020-07-10 15:30:06,416 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {711#true} {757#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #191#return; {757#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 15:30:06,417 INFO L280 TraceCheckUtils]: 25: Hoare triple {757#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume -2147483648 <= #t~ret25 && #t~ret25 <= 2147483647;call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~t.base, 8 + ~t.offset, 4); {757#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 15:30:06,417 INFO L263 TraceCheckUtils]: 26: Hoare triple {757#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} call #t~ret27 := size(#t~mem26.base, #t~mem26.offset); {711#true} is VALID [2020-07-10 15:30:06,417 INFO L280 TraceCheckUtils]: 27: Hoare triple {711#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {711#true} is VALID [2020-07-10 15:30:06,418 INFO L280 TraceCheckUtils]: 28: Hoare triple {711#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {711#true} is VALID [2020-07-10 15:30:06,418 INFO L280 TraceCheckUtils]: 29: Hoare triple {711#true} assume true; {711#true} is VALID [2020-07-10 15:30:06,419 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {711#true} {757#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} #193#return; {757#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 15:30:06,420 INFO L280 TraceCheckUtils]: 31: Hoare triple {757#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume -2147483648 <= #t~ret27 && #t~ret27 <= 2147483647;#res := 1 + (#t~ret25 + #t~ret27);havoc #t~mem26.base, #t~mem26.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~ret25;havoc #t~ret27; {757#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 15:30:06,421 INFO L280 TraceCheckUtils]: 32: Hoare triple {757#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} assume true; {757#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} is VALID [2020-07-10 15:30:06,422 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {757#(or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))} {721#(and (= 0 task_~t.offset) (= 0 task_~t.base))} #167#return; {712#false} is VALID [2020-07-10 15:30:06,422 INFO L280 TraceCheckUtils]: 34: Hoare triple {712#false} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~n~1 := #t~ret29;havoc #t~ret29; {712#false} is VALID [2020-07-10 15:30:06,423 INFO L263 TraceCheckUtils]: 35: Hoare triple {712#false} call assume_cycle_if_not((if 0 != ~n~1 then 1 else 0)); {712#false} is VALID [2020-07-10 15:30:06,423 INFO L280 TraceCheckUtils]: 36: Hoare triple {712#false} ~cond := #in~cond; {712#false} is VALID [2020-07-10 15:30:06,423 INFO L280 TraceCheckUtils]: 37: Hoare triple {712#false} assume !(0 == ~cond); {712#false} is VALID [2020-07-10 15:30:06,423 INFO L280 TraceCheckUtils]: 38: Hoare triple {712#false} assume true; {712#false} is VALID [2020-07-10 15:30:06,424 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {712#false} {712#false} #169#return; {712#false} is VALID [2020-07-10 15:30:06,424 INFO L280 TraceCheckUtils]: 40: Hoare triple {712#false} call #t~malloc30.base, #t~malloc30.offset := #Ultimate.allocOnHeap(4 * ~n~1); {712#false} is VALID [2020-07-10 15:30:06,424 INFO L263 TraceCheckUtils]: 41: Hoare triple {712#false} call #Ultimate.meminit(#t~malloc30.base, #t~malloc30.offset, ~n~1, 4, 4 * ~n~1); {712#false} is VALID [2020-07-10 15:30:06,424 INFO L280 TraceCheckUtils]: 42: Hoare triple {712#false} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {712#false} is VALID [2020-07-10 15:30:06,425 INFO L280 TraceCheckUtils]: 43: Hoare triple {712#false} assume true; {712#false} is VALID [2020-07-10 15:30:06,425 INFO L275 TraceCheckUtils]: 44: Hoare quadruple {712#false} {712#false} #171#return; {712#false} is VALID [2020-07-10 15:30:06,425 INFO L280 TraceCheckUtils]: 45: Hoare triple {712#false} ~x~0.base, ~x~0.offset := #t~malloc30.base, #t~malloc30.offset; {712#false} is VALID [2020-07-10 15:30:06,425 INFO L263 TraceCheckUtils]: 46: Hoare triple {712#false} call #t~ret31 := tree_inorder(~t.base, ~t.offset, ~x~0.base, ~x~0.offset, ~n~1); {712#false} is VALID [2020-07-10 15:30:06,426 INFO L280 TraceCheckUtils]: 47: Hoare triple {712#false} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {712#false} is VALID [2020-07-10 15:30:06,426 INFO L280 TraceCheckUtils]: 48: Hoare triple {712#false} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {712#false} is VALID [2020-07-10 15:30:06,426 INFO L280 TraceCheckUtils]: 49: Hoare triple {712#false} assume true; {712#false} is VALID [2020-07-10 15:30:06,426 INFO L275 TraceCheckUtils]: 50: Hoare quadruple {712#false} {712#false} #173#return; {712#false} is VALID [2020-07-10 15:30:06,427 INFO L280 TraceCheckUtils]: 51: Hoare triple {712#false} assume -2147483648 <= #t~ret31 && #t~ret31 <= 2147483647;havoc #t~ret31;call #t~mem32 := read~int(~x~0.base, ~x~0.offset, 4); {712#false} is VALID [2020-07-10 15:30:06,427 INFO L263 TraceCheckUtils]: 52: Hoare triple {712#false} call __VERIFIER_assert((if ~a~1 == #t~mem32 then 1 else 0)); {712#false} is VALID [2020-07-10 15:30:06,427 INFO L280 TraceCheckUtils]: 53: Hoare triple {712#false} ~cond := #in~cond; {712#false} is VALID [2020-07-10 15:30:06,427 INFO L280 TraceCheckUtils]: 54: Hoare triple {712#false} assume 0 == ~cond; {712#false} is VALID [2020-07-10 15:30:06,428 INFO L280 TraceCheckUtils]: 55: Hoare triple {712#false} assume !false; {712#false} is VALID [2020-07-10 15:30:06,433 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-10 15:30:06,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:30:06,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 12 [2020-07-10 15:30:06,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134705317] [2020-07-10 15:30:06,436 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2020-07-10 15:30:06,439 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:30:06,439 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-10 15:30:06,524 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:30:06,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-10 15:30:06,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:30:06,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-10 15:30:06,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-07-10 15:30:06,525 INFO L87 Difference]: Start difference. First operand 91 states and 115 transitions. Second operand 12 states. [2020-07-10 15:30:09,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:09,658 INFO L93 Difference]: Finished difference Result 165 states and 211 transitions. [2020-07-10 15:30:09,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-10 15:30:09,658 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2020-07-10 15:30:09,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:30:09,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-10 15:30:09,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 207 transitions. [2020-07-10 15:30:09,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-10 15:30:09,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 207 transitions. [2020-07-10 15:30:09,673 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 207 transitions. [2020-07-10 15:30:10,043 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 207 edges. 207 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:30:10,049 INFO L225 Difference]: With dead ends: 165 [2020-07-10 15:30:10,050 INFO L226 Difference]: Without dead ends: 97 [2020-07-10 15:30:10,052 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2020-07-10 15:30:10,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-07-10 15:30:10,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2020-07-10 15:30:10,122 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:30:10,122 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand 93 states. [2020-07-10 15:30:10,122 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 93 states. [2020-07-10 15:30:10,122 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 93 states. [2020-07-10 15:30:10,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:10,130 INFO L93 Difference]: Finished difference Result 97 states and 125 transitions. [2020-07-10 15:30:10,130 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 125 transitions. [2020-07-10 15:30:10,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:30:10,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:30:10,133 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 97 states. [2020-07-10 15:30:10,133 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 97 states. [2020-07-10 15:30:10,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:10,140 INFO L93 Difference]: Finished difference Result 97 states and 125 transitions. [2020-07-10 15:30:10,140 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 125 transitions. [2020-07-10 15:30:10,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:30:10,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:30:10,142 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:30:10,142 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:30:10,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-07-10 15:30:10,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 118 transitions. [2020-07-10 15:30:10,148 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 118 transitions. Word has length 56 [2020-07-10 15:30:10,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:30:10,149 INFO L479 AbstractCegarLoop]: Abstraction has 93 states and 118 transitions. [2020-07-10 15:30:10,149 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-10 15:30:10,149 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 118 transitions. [2020-07-10 15:30:10,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-10 15:30:10,151 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:30:10,151 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:30:10,364 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-10 15:30:10,365 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:30:10,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:30:10,366 INFO L82 PathProgramCache]: Analyzing trace with hash -217941329, now seen corresponding path program 1 times [2020-07-10 15:30:10,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:30:10,367 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072314270] [2020-07-10 15:30:10,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:30:10,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:10,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:10,516 INFO L280 TraceCheckUtils]: 0: Hoare triple {1558#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1506#true} is VALID [2020-07-10 15:30:10,517 INFO L280 TraceCheckUtils]: 1: Hoare triple {1506#true} assume true; {1506#true} is VALID [2020-07-10 15:30:10,517 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1506#true} {1506#true} #195#return; {1506#true} is VALID [2020-07-10 15:30:10,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:10,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:10,620 INFO L280 TraceCheckUtils]: 0: Hoare triple {1559#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {1506#true} is VALID [2020-07-10 15:30:10,620 INFO L280 TraceCheckUtils]: 1: Hoare triple {1506#true} assume true; {1506#true} is VALID [2020-07-10 15:30:10,621 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1506#true} {1560#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} #161#return; {1560#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-10 15:30:10,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:10,629 INFO L280 TraceCheckUtils]: 0: Hoare triple {1559#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {1506#true} is VALID [2020-07-10 15:30:10,630 INFO L280 TraceCheckUtils]: 1: Hoare triple {1506#true} assume true; {1506#true} is VALID [2020-07-10 15:30:10,631 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1506#true} {1560#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} #163#return; {1560#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-10 15:30:10,633 INFO L280 TraceCheckUtils]: 0: Hoare triple {1559#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume !(0 != #t~nondet1 % 256);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~n~0.base, ~n~0.offset := #t~malloc2.base, #t~malloc2.offset;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~n~0.base, ~n~0.offset, 4);havoc #t~nondet3; {1560#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-10 15:30:10,635 INFO L263 TraceCheckUtils]: 1: Hoare triple {1560#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} call #t~ret4.base, #t~ret4.offset := nondet_tree(); {1559#(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 15:30:10,635 INFO L280 TraceCheckUtils]: 2: Hoare triple {1559#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {1506#true} is VALID [2020-07-10 15:30:10,635 INFO L280 TraceCheckUtils]: 3: Hoare triple {1506#true} assume true; {1506#true} is VALID [2020-07-10 15:30:10,636 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1506#true} {1560#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} #161#return; {1560#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-10 15:30:10,637 INFO L280 TraceCheckUtils]: 5: Hoare triple {1560#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} call write~$Pointer$(#t~ret4.base, #t~ret4.offset, ~n~0.base, 4 + ~n~0.offset, 4);havoc #t~ret4.base, #t~ret4.offset; {1560#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-10 15:30:10,639 INFO L263 TraceCheckUtils]: 6: Hoare triple {1560#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} call #t~ret5.base, #t~ret5.offset := nondet_tree(); {1559#(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 15:30:10,639 INFO L280 TraceCheckUtils]: 7: Hoare triple {1559#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {1506#true} is VALID [2020-07-10 15:30:10,639 INFO L280 TraceCheckUtils]: 8: Hoare triple {1506#true} assume true; {1506#true} is VALID [2020-07-10 15:30:10,640 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1506#true} {1560#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} #163#return; {1560#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-10 15:30:10,642 INFO L280 TraceCheckUtils]: 10: Hoare triple {1560#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~n~0.base, 8 + ~n~0.offset, 4);havoc #t~ret5.base, #t~ret5.offset;#res.base, #res.offset := ~n~0.base, ~n~0.offset; {1567#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} is VALID [2020-07-10 15:30:10,642 INFO L280 TraceCheckUtils]: 11: Hoare triple {1567#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} assume true; {1567#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} is VALID [2020-07-10 15:30:10,643 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1567#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} {1506#true} #153#return; {1524#(not (= 0 |main_#t~ret41.base|))} is VALID [2020-07-10 15:30:10,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:10,679 INFO L280 TraceCheckUtils]: 0: Hoare triple {1506#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {1568#(= min_~n.base |min_#in~n.base|)} is VALID [2020-07-10 15:30:10,680 INFO L280 TraceCheckUtils]: 1: Hoare triple {1568#(= min_~n.base |min_#in~n.base|)} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {1569#(= 0 |min_#in~n.base|)} is VALID [2020-07-10 15:30:10,681 INFO L280 TraceCheckUtils]: 2: Hoare triple {1569#(= 0 |min_#in~n.base|)} assume true; {1569#(= 0 |min_#in~n.base|)} is VALID [2020-07-10 15:30:10,682 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1569#(= 0 |min_#in~n.base|)} {1526#(not (= 0 task_~t.base))} #165#return; {1507#false} is VALID [2020-07-10 15:30:10,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:10,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:10,694 INFO L280 TraceCheckUtils]: 0: Hoare triple {1506#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1506#true} is VALID [2020-07-10 15:30:10,694 INFO L280 TraceCheckUtils]: 1: Hoare triple {1506#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1506#true} is VALID [2020-07-10 15:30:10,695 INFO L280 TraceCheckUtils]: 2: Hoare triple {1506#true} assume true; {1506#true} is VALID [2020-07-10 15:30:10,695 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1506#true} {1506#true} #191#return; {1506#true} is VALID [2020-07-10 15:30:10,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:10,699 INFO L280 TraceCheckUtils]: 0: Hoare triple {1506#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1506#true} is VALID [2020-07-10 15:30:10,699 INFO L280 TraceCheckUtils]: 1: Hoare triple {1506#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1506#true} is VALID [2020-07-10 15:30:10,699 INFO L280 TraceCheckUtils]: 2: Hoare triple {1506#true} assume true; {1506#true} is VALID [2020-07-10 15:30:10,700 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1506#true} {1506#true} #193#return; {1506#true} is VALID [2020-07-10 15:30:10,700 INFO L280 TraceCheckUtils]: 0: Hoare triple {1506#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1506#true} is VALID [2020-07-10 15:30:10,700 INFO L280 TraceCheckUtils]: 1: Hoare triple {1506#true} assume !(~t.base == 0 && ~t.offset == 0);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 4); {1506#true} is VALID [2020-07-10 15:30:10,701 INFO L263 TraceCheckUtils]: 2: Hoare triple {1506#true} call #t~ret25 := size(#t~mem24.base, #t~mem24.offset); {1506#true} is VALID [2020-07-10 15:30:10,701 INFO L280 TraceCheckUtils]: 3: Hoare triple {1506#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1506#true} is VALID [2020-07-10 15:30:10,701 INFO L280 TraceCheckUtils]: 4: Hoare triple {1506#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1506#true} is VALID [2020-07-10 15:30:10,701 INFO L280 TraceCheckUtils]: 5: Hoare triple {1506#true} assume true; {1506#true} is VALID [2020-07-10 15:30:10,702 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {1506#true} {1506#true} #191#return; {1506#true} is VALID [2020-07-10 15:30:10,702 INFO L280 TraceCheckUtils]: 7: Hoare triple {1506#true} assume -2147483648 <= #t~ret25 && #t~ret25 <= 2147483647;call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~t.base, 8 + ~t.offset, 4); {1506#true} is VALID [2020-07-10 15:30:10,702 INFO L263 TraceCheckUtils]: 8: Hoare triple {1506#true} call #t~ret27 := size(#t~mem26.base, #t~mem26.offset); {1506#true} is VALID [2020-07-10 15:30:10,702 INFO L280 TraceCheckUtils]: 9: Hoare triple {1506#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1506#true} is VALID [2020-07-10 15:30:10,703 INFO L280 TraceCheckUtils]: 10: Hoare triple {1506#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1506#true} is VALID [2020-07-10 15:30:10,703 INFO L280 TraceCheckUtils]: 11: Hoare triple {1506#true} assume true; {1506#true} is VALID [2020-07-10 15:30:10,703 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {1506#true} {1506#true} #193#return; {1506#true} is VALID [2020-07-10 15:30:10,703 INFO L280 TraceCheckUtils]: 13: Hoare triple {1506#true} assume -2147483648 <= #t~ret27 && #t~ret27 <= 2147483647;#res := 1 + (#t~ret25 + #t~ret27);havoc #t~mem26.base, #t~mem26.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~ret25;havoc #t~ret27; {1506#true} is VALID [2020-07-10 15:30:10,704 INFO L280 TraceCheckUtils]: 14: Hoare triple {1506#true} assume true; {1506#true} is VALID [2020-07-10 15:30:10,704 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1506#true} {1507#false} #167#return; {1507#false} is VALID [2020-07-10 15:30:10,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:10,708 INFO L280 TraceCheckUtils]: 0: Hoare triple {1506#true} ~cond := #in~cond; {1506#true} is VALID [2020-07-10 15:30:10,708 INFO L280 TraceCheckUtils]: 1: Hoare triple {1506#true} assume !(0 == ~cond); {1506#true} is VALID [2020-07-10 15:30:10,708 INFO L280 TraceCheckUtils]: 2: Hoare triple {1506#true} assume true; {1506#true} is VALID [2020-07-10 15:30:10,709 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1506#true} {1507#false} #169#return; {1507#false} is VALID [2020-07-10 15:30:10,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:10,725 INFO L280 TraceCheckUtils]: 0: Hoare triple {1578#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1506#true} is VALID [2020-07-10 15:30:10,725 INFO L280 TraceCheckUtils]: 1: Hoare triple {1506#true} assume true; {1506#true} is VALID [2020-07-10 15:30:10,726 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1506#true} {1507#false} #171#return; {1507#false} is VALID [2020-07-10 15:30:10,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:10,750 INFO L280 TraceCheckUtils]: 0: Hoare triple {1579#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {1506#true} is VALID [2020-07-10 15:30:10,751 INFO L280 TraceCheckUtils]: 1: Hoare triple {1506#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {1506#true} is VALID [2020-07-10 15:30:10,751 INFO L280 TraceCheckUtils]: 2: Hoare triple {1506#true} assume true; {1506#true} is VALID [2020-07-10 15:30:10,751 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1506#true} {1507#false} #173#return; {1507#false} is VALID [2020-07-10 15:30:10,752 INFO L263 TraceCheckUtils]: 0: Hoare triple {1506#true} call ULTIMATE.init(); {1558#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:30:10,752 INFO L280 TraceCheckUtils]: 1: Hoare triple {1558#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1506#true} is VALID [2020-07-10 15:30:10,753 INFO L280 TraceCheckUtils]: 2: Hoare triple {1506#true} assume true; {1506#true} is VALID [2020-07-10 15:30:10,753 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1506#true} {1506#true} #195#return; {1506#true} is VALID [2020-07-10 15:30:10,753 INFO L263 TraceCheckUtils]: 4: Hoare triple {1506#true} call #t~ret42 := main(); {1506#true} is VALID [2020-07-10 15:30:10,754 INFO L263 TraceCheckUtils]: 5: Hoare triple {1506#true} call #t~ret41.base, #t~ret41.offset := nondet_tree(); {1559#(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 15:30:10,756 INFO L280 TraceCheckUtils]: 6: Hoare triple {1559#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume !(0 != #t~nondet1 % 256);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~n~0.base, ~n~0.offset := #t~malloc2.base, #t~malloc2.offset;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~n~0.base, ~n~0.offset, 4);havoc #t~nondet3; {1560#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-10 15:30:10,758 INFO L263 TraceCheckUtils]: 7: Hoare triple {1560#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} call #t~ret4.base, #t~ret4.offset := nondet_tree(); {1559#(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 15:30:10,758 INFO L280 TraceCheckUtils]: 8: Hoare triple {1559#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {1506#true} is VALID [2020-07-10 15:30:10,758 INFO L280 TraceCheckUtils]: 9: Hoare triple {1506#true} assume true; {1506#true} is VALID [2020-07-10 15:30:10,759 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1506#true} {1560#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} #161#return; {1560#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-10 15:30:10,761 INFO L280 TraceCheckUtils]: 11: Hoare triple {1560#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} call write~$Pointer$(#t~ret4.base, #t~ret4.offset, ~n~0.base, 4 + ~n~0.offset, 4);havoc #t~ret4.base, #t~ret4.offset; {1560#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-10 15:30:10,769 INFO L263 TraceCheckUtils]: 12: Hoare triple {1560#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} call #t~ret5.base, #t~ret5.offset := nondet_tree(); {1559#(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 15:30:10,769 INFO L280 TraceCheckUtils]: 13: Hoare triple {1559#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {1506#true} is VALID [2020-07-10 15:30:10,769 INFO L280 TraceCheckUtils]: 14: Hoare triple {1506#true} assume true; {1506#true} is VALID [2020-07-10 15:30:10,770 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {1506#true} {1560#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} #163#return; {1560#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-10 15:30:10,775 INFO L280 TraceCheckUtils]: 16: Hoare triple {1560#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~n~0.base, 8 + ~n~0.offset, 4);havoc #t~ret5.base, #t~ret5.offset;#res.base, #res.offset := ~n~0.base, ~n~0.offset; {1567#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} is VALID [2020-07-10 15:30:10,776 INFO L280 TraceCheckUtils]: 17: Hoare triple {1567#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} assume true; {1567#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} is VALID [2020-07-10 15:30:10,777 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {1567#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} {1506#true} #153#return; {1524#(not (= 0 |main_#t~ret41.base|))} is VALID [2020-07-10 15:30:10,778 INFO L263 TraceCheckUtils]: 19: Hoare triple {1524#(not (= 0 |main_#t~ret41.base|))} call task(#t~ret41.base, #t~ret41.offset); {1525#(not (= |task_#in~t.base| 0))} is VALID [2020-07-10 15:30:10,778 INFO L280 TraceCheckUtils]: 20: Hoare triple {1525#(not (= |task_#in~t.base| 0))} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1526#(not (= 0 task_~t.base))} is VALID [2020-07-10 15:30:10,778 INFO L263 TraceCheckUtils]: 21: Hoare triple {1526#(not (= 0 task_~t.base))} call #t~ret28 := min(~t.base, ~t.offset); {1506#true} is VALID [2020-07-10 15:30:10,779 INFO L280 TraceCheckUtils]: 22: Hoare triple {1506#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {1568#(= min_~n.base |min_#in~n.base|)} is VALID [2020-07-10 15:30:10,780 INFO L280 TraceCheckUtils]: 23: Hoare triple {1568#(= min_~n.base |min_#in~n.base|)} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {1569#(= 0 |min_#in~n.base|)} is VALID [2020-07-10 15:30:10,780 INFO L280 TraceCheckUtils]: 24: Hoare triple {1569#(= 0 |min_#in~n.base|)} assume true; {1569#(= 0 |min_#in~n.base|)} is VALID [2020-07-10 15:30:10,781 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {1569#(= 0 |min_#in~n.base|)} {1526#(not (= 0 task_~t.base))} #165#return; {1507#false} is VALID [2020-07-10 15:30:10,782 INFO L280 TraceCheckUtils]: 26: Hoare triple {1507#false} assume -2147483648 <= #t~ret28 && #t~ret28 <= 2147483647;~a~1 := #t~ret28;havoc #t~ret28;call ~#b~1.base, ~#b~1.offset := #Ultimate.allocOnStack(4); {1507#false} is VALID [2020-07-10 15:30:10,782 INFO L263 TraceCheckUtils]: 27: Hoare triple {1507#false} call #t~ret29 := size(~t.base, ~t.offset); {1506#true} is VALID [2020-07-10 15:30:10,782 INFO L280 TraceCheckUtils]: 28: Hoare triple {1506#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1506#true} is VALID [2020-07-10 15:30:10,782 INFO L280 TraceCheckUtils]: 29: Hoare triple {1506#true} assume !(~t.base == 0 && ~t.offset == 0);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 4); {1506#true} is VALID [2020-07-10 15:30:10,783 INFO L263 TraceCheckUtils]: 30: Hoare triple {1506#true} call #t~ret25 := size(#t~mem24.base, #t~mem24.offset); {1506#true} is VALID [2020-07-10 15:30:10,783 INFO L280 TraceCheckUtils]: 31: Hoare triple {1506#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1506#true} is VALID [2020-07-10 15:30:10,783 INFO L280 TraceCheckUtils]: 32: Hoare triple {1506#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1506#true} is VALID [2020-07-10 15:30:10,783 INFO L280 TraceCheckUtils]: 33: Hoare triple {1506#true} assume true; {1506#true} is VALID [2020-07-10 15:30:10,784 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {1506#true} {1506#true} #191#return; {1506#true} is VALID [2020-07-10 15:30:10,784 INFO L280 TraceCheckUtils]: 35: Hoare triple {1506#true} assume -2147483648 <= #t~ret25 && #t~ret25 <= 2147483647;call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~t.base, 8 + ~t.offset, 4); {1506#true} is VALID [2020-07-10 15:30:10,784 INFO L263 TraceCheckUtils]: 36: Hoare triple {1506#true} call #t~ret27 := size(#t~mem26.base, #t~mem26.offset); {1506#true} is VALID [2020-07-10 15:30:10,784 INFO L280 TraceCheckUtils]: 37: Hoare triple {1506#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {1506#true} is VALID [2020-07-10 15:30:10,785 INFO L280 TraceCheckUtils]: 38: Hoare triple {1506#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {1506#true} is VALID [2020-07-10 15:30:10,785 INFO L280 TraceCheckUtils]: 39: Hoare triple {1506#true} assume true; {1506#true} is VALID [2020-07-10 15:30:10,785 INFO L275 TraceCheckUtils]: 40: Hoare quadruple {1506#true} {1506#true} #193#return; {1506#true} is VALID [2020-07-10 15:30:10,785 INFO L280 TraceCheckUtils]: 41: Hoare triple {1506#true} assume -2147483648 <= #t~ret27 && #t~ret27 <= 2147483647;#res := 1 + (#t~ret25 + #t~ret27);havoc #t~mem26.base, #t~mem26.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~ret25;havoc #t~ret27; {1506#true} is VALID [2020-07-10 15:30:10,785 INFO L280 TraceCheckUtils]: 42: Hoare triple {1506#true} assume true; {1506#true} is VALID [2020-07-10 15:30:10,786 INFO L275 TraceCheckUtils]: 43: Hoare quadruple {1506#true} {1507#false} #167#return; {1507#false} is VALID [2020-07-10 15:30:10,786 INFO L280 TraceCheckUtils]: 44: Hoare triple {1507#false} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~n~1 := #t~ret29;havoc #t~ret29; {1507#false} is VALID [2020-07-10 15:30:10,788 INFO L263 TraceCheckUtils]: 45: Hoare triple {1507#false} call assume_cycle_if_not((if 0 != ~n~1 then 1 else 0)); {1506#true} is VALID [2020-07-10 15:30:10,789 INFO L280 TraceCheckUtils]: 46: Hoare triple {1506#true} ~cond := #in~cond; {1506#true} is VALID [2020-07-10 15:30:10,789 INFO L280 TraceCheckUtils]: 47: Hoare triple {1506#true} assume !(0 == ~cond); {1506#true} is VALID [2020-07-10 15:30:10,790 INFO L280 TraceCheckUtils]: 48: Hoare triple {1506#true} assume true; {1506#true} is VALID [2020-07-10 15:30:10,790 INFO L275 TraceCheckUtils]: 49: Hoare quadruple {1506#true} {1507#false} #169#return; {1507#false} is VALID [2020-07-10 15:30:10,790 INFO L280 TraceCheckUtils]: 50: Hoare triple {1507#false} call #t~malloc30.base, #t~malloc30.offset := #Ultimate.allocOnHeap(4 * ~n~1); {1507#false} is VALID [2020-07-10 15:30:10,790 INFO L263 TraceCheckUtils]: 51: Hoare triple {1507#false} call #Ultimate.meminit(#t~malloc30.base, #t~malloc30.offset, ~n~1, 4, 4 * ~n~1); {1578#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:30:10,791 INFO L280 TraceCheckUtils]: 52: Hoare triple {1578#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {1506#true} is VALID [2020-07-10 15:30:10,791 INFO L280 TraceCheckUtils]: 53: Hoare triple {1506#true} assume true; {1506#true} is VALID [2020-07-10 15:30:10,797 INFO L275 TraceCheckUtils]: 54: Hoare quadruple {1506#true} {1507#false} #171#return; {1507#false} is VALID [2020-07-10 15:30:10,797 INFO L280 TraceCheckUtils]: 55: Hoare triple {1507#false} ~x~0.base, ~x~0.offset := #t~malloc30.base, #t~malloc30.offset; {1507#false} is VALID [2020-07-10 15:30:10,797 INFO L263 TraceCheckUtils]: 56: Hoare triple {1507#false} call #t~ret31 := tree_inorder(~t.base, ~t.offset, ~x~0.base, ~x~0.offset, ~n~1); {1579#(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 15:30:10,797 INFO L280 TraceCheckUtils]: 57: Hoare triple {1579#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {1506#true} is VALID [2020-07-10 15:30:10,798 INFO L280 TraceCheckUtils]: 58: Hoare triple {1506#true} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {1506#true} is VALID [2020-07-10 15:30:10,798 INFO L280 TraceCheckUtils]: 59: Hoare triple {1506#true} assume true; {1506#true} is VALID [2020-07-10 15:30:10,798 INFO L275 TraceCheckUtils]: 60: Hoare quadruple {1506#true} {1507#false} #173#return; {1507#false} is VALID [2020-07-10 15:30:10,798 INFO L280 TraceCheckUtils]: 61: Hoare triple {1507#false} assume -2147483648 <= #t~ret31 && #t~ret31 <= 2147483647;havoc #t~ret31;call #t~mem32 := read~int(~x~0.base, ~x~0.offset, 4); {1507#false} is VALID [2020-07-10 15:30:10,799 INFO L263 TraceCheckUtils]: 62: Hoare triple {1507#false} call __VERIFIER_assert((if ~a~1 == #t~mem32 then 1 else 0)); {1507#false} is VALID [2020-07-10 15:30:10,799 INFO L280 TraceCheckUtils]: 63: Hoare triple {1507#false} ~cond := #in~cond; {1507#false} is VALID [2020-07-10 15:30:10,799 INFO L280 TraceCheckUtils]: 64: Hoare triple {1507#false} assume 0 == ~cond; {1507#false} is VALID [2020-07-10 15:30:10,799 INFO L280 TraceCheckUtils]: 65: Hoare triple {1507#false} assume !false; {1507#false} is VALID [2020-07-10 15:30:10,805 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-07-10 15:30:10,806 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072314270] [2020-07-10 15:30:10,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:30:10,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-10 15:30:10,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335277186] [2020-07-10 15:30:10,808 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2020-07-10 15:30:10,810 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:30:10,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-10 15:30:10,880 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:30:10,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-10 15:30:10,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:30:10,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-10 15:30:10,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2020-07-10 15:30:10,882 INFO L87 Difference]: Start difference. First operand 93 states and 118 transitions. Second operand 13 states. [2020-07-10 15:30:13,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:13,948 INFO L93 Difference]: Finished difference Result 164 states and 210 transitions. [2020-07-10 15:30:13,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-10 15:30:13,948 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2020-07-10 15:30:13,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:30:13,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 15:30:13,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 202 transitions. [2020-07-10 15:30:13,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 15:30:13,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 202 transitions. [2020-07-10 15:30:13,968 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 202 transitions. [2020-07-10 15:30:14,286 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 202 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:30:14,291 INFO L225 Difference]: With dead ends: 164 [2020-07-10 15:30:14,291 INFO L226 Difference]: Without dead ends: 99 [2020-07-10 15:30:14,293 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2020-07-10 15:30:14,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-07-10 15:30:14,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2020-07-10 15:30:14,371 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:30:14,371 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand 95 states. [2020-07-10 15:30:14,372 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 95 states. [2020-07-10 15:30:14,372 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 95 states. [2020-07-10 15:30:14,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:14,379 INFO L93 Difference]: Finished difference Result 99 states and 128 transitions. [2020-07-10 15:30:14,379 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 128 transitions. [2020-07-10 15:30:14,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:30:14,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:30:14,380 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 99 states. [2020-07-10 15:30:14,381 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 99 states. [2020-07-10 15:30:14,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:14,387 INFO L93 Difference]: Finished difference Result 99 states and 128 transitions. [2020-07-10 15:30:14,387 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 128 transitions. [2020-07-10 15:30:14,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:30:14,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:30:14,389 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:30:14,389 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:30:14,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-07-10 15:30:14,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 121 transitions. [2020-07-10 15:30:14,394 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 121 transitions. Word has length 66 [2020-07-10 15:30:14,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:30:14,395 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 121 transitions. [2020-07-10 15:30:14,395 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-10 15:30:14,395 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 121 transitions. [2020-07-10 15:30:14,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-07-10 15:30:14,397 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:30:14,397 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:30:14,397 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 15:30:14,397 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:30:14,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:30:14,398 INFO L82 PathProgramCache]: Analyzing trace with hash -62868055, now seen corresponding path program 1 times [2020-07-10 15:30:14,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:30:14,398 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802613388] [2020-07-10 15:30:14,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:30:14,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:14,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:14,514 INFO L280 TraceCheckUtils]: 0: Hoare triple {2221#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2155#true} is VALID [2020-07-10 15:30:14,514 INFO L280 TraceCheckUtils]: 1: Hoare triple {2155#true} assume true; {2155#true} is VALID [2020-07-10 15:30:14,514 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2155#true} {2155#true} #195#return; {2155#true} is VALID [2020-07-10 15:30:14,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:14,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:14,589 INFO L280 TraceCheckUtils]: 0: Hoare triple {2222#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {2155#true} is VALID [2020-07-10 15:30:14,589 INFO L280 TraceCheckUtils]: 1: Hoare triple {2155#true} assume true; {2155#true} is VALID [2020-07-10 15:30:14,590 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2155#true} {2223#(= nondet_tree_~n~0.offset 0)} #161#return; {2223#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-10 15:30:14,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:14,596 INFO L280 TraceCheckUtils]: 0: Hoare triple {2222#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {2155#true} is VALID [2020-07-10 15:30:14,597 INFO L280 TraceCheckUtils]: 1: Hoare triple {2155#true} assume true; {2155#true} is VALID [2020-07-10 15:30:14,598 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2155#true} {2223#(= nondet_tree_~n~0.offset 0)} #163#return; {2223#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-10 15:30:14,599 INFO L280 TraceCheckUtils]: 0: Hoare triple {2222#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume !(0 != #t~nondet1 % 256);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~n~0.base, ~n~0.offset := #t~malloc2.base, #t~malloc2.offset;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~n~0.base, ~n~0.offset, 4);havoc #t~nondet3; {2223#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-10 15:30:14,601 INFO L263 TraceCheckUtils]: 1: Hoare triple {2223#(= nondet_tree_~n~0.offset 0)} call #t~ret4.base, #t~ret4.offset := nondet_tree(); {2222#(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 15:30:14,601 INFO L280 TraceCheckUtils]: 2: Hoare triple {2222#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {2155#true} is VALID [2020-07-10 15:30:14,601 INFO L280 TraceCheckUtils]: 3: Hoare triple {2155#true} assume true; {2155#true} is VALID [2020-07-10 15:30:14,602 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2155#true} {2223#(= nondet_tree_~n~0.offset 0)} #161#return; {2223#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-10 15:30:14,603 INFO L280 TraceCheckUtils]: 5: Hoare triple {2223#(= nondet_tree_~n~0.offset 0)} call write~$Pointer$(#t~ret4.base, #t~ret4.offset, ~n~0.base, 4 + ~n~0.offset, 4);havoc #t~ret4.base, #t~ret4.offset; {2223#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-10 15:30:14,605 INFO L263 TraceCheckUtils]: 6: Hoare triple {2223#(= nondet_tree_~n~0.offset 0)} call #t~ret5.base, #t~ret5.offset := nondet_tree(); {2222#(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 15:30:14,606 INFO L280 TraceCheckUtils]: 7: Hoare triple {2222#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {2155#true} is VALID [2020-07-10 15:30:14,606 INFO L280 TraceCheckUtils]: 8: Hoare triple {2155#true} assume true; {2155#true} is VALID [2020-07-10 15:30:14,607 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {2155#true} {2223#(= nondet_tree_~n~0.offset 0)} #163#return; {2223#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-10 15:30:14,608 INFO L280 TraceCheckUtils]: 10: Hoare triple {2223#(= nondet_tree_~n~0.offset 0)} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~n~0.base, 8 + ~n~0.offset, 4);havoc #t~ret5.base, #t~ret5.offset;#res.base, #res.offset := ~n~0.base, ~n~0.offset; {2230#(and (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0))} is VALID [2020-07-10 15:30:14,609 INFO L280 TraceCheckUtils]: 11: Hoare triple {2230#(and (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0))} assume true; {2230#(and (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0))} is VALID [2020-07-10 15:30:14,610 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {2230#(and (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0))} {2155#true} #153#return; {2173#(= 0 |main_#t~ret41.offset|)} is VALID [2020-07-10 15:30:14,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:14,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:14,689 INFO L280 TraceCheckUtils]: 0: Hoare triple {2155#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2155#true} is VALID [2020-07-10 15:30:14,689 INFO L280 TraceCheckUtils]: 1: Hoare triple {2155#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2155#true} is VALID [2020-07-10 15:30:14,690 INFO L280 TraceCheckUtils]: 2: Hoare triple {2155#true} assume true; {2155#true} is VALID [2020-07-10 15:30:14,691 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2155#true} {2232#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} #157#return; {2232#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-10 15:30:14,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:14,695 INFO L280 TraceCheckUtils]: 0: Hoare triple {2155#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2155#true} is VALID [2020-07-10 15:30:14,696 INFO L280 TraceCheckUtils]: 1: Hoare triple {2155#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2155#true} is VALID [2020-07-10 15:30:14,696 INFO L280 TraceCheckUtils]: 2: Hoare triple {2155#true} assume true; {2155#true} is VALID [2020-07-10 15:30:14,697 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2155#true} {2232#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} #159#return; {2232#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-10 15:30:14,698 INFO L280 TraceCheckUtils]: 0: Hoare triple {2155#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2231#(and (= min_~n.base |min_#in~n.base|) (= min_~n.offset |min_#in~n.offset|))} is VALID [2020-07-10 15:30:14,699 INFO L280 TraceCheckUtils]: 1: Hoare triple {2231#(and (= min_~n.base |min_#in~n.base|) (= min_~n.offset |min_#in~n.offset|))} assume !(~n.base == 0 && ~n.offset == 0);call #t~mem6 := read~int(~n.base, ~n.offset, 4);~a~0 := #t~mem6;havoc #t~mem6;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~n.base, 4 + ~n.offset, 4); {2232#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-10 15:30:14,699 INFO L263 TraceCheckUtils]: 2: Hoare triple {2232#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} call #t~ret8 := min(#t~mem7.base, #t~mem7.offset); {2155#true} is VALID [2020-07-10 15:30:14,699 INFO L280 TraceCheckUtils]: 3: Hoare triple {2155#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2155#true} is VALID [2020-07-10 15:30:14,700 INFO L280 TraceCheckUtils]: 4: Hoare triple {2155#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2155#true} is VALID [2020-07-10 15:30:14,700 INFO L280 TraceCheckUtils]: 5: Hoare triple {2155#true} assume true; {2155#true} is VALID [2020-07-10 15:30:14,701 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {2155#true} {2232#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} #157#return; {2232#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-10 15:30:14,701 INFO L280 TraceCheckUtils]: 7: Hoare triple {2232#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~b~0 := #t~ret8;havoc #t~mem7.base, #t~mem7.offset;havoc #t~ret8;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~n.base, 8 + ~n.offset, 4); {2232#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-10 15:30:14,702 INFO L263 TraceCheckUtils]: 8: Hoare triple {2232#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} call #t~ret10 := min(#t~mem9.base, #t~mem9.offset); {2155#true} is VALID [2020-07-10 15:30:14,702 INFO L280 TraceCheckUtils]: 9: Hoare triple {2155#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2155#true} is VALID [2020-07-10 15:30:14,702 INFO L280 TraceCheckUtils]: 10: Hoare triple {2155#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2155#true} is VALID [2020-07-10 15:30:14,702 INFO L280 TraceCheckUtils]: 11: Hoare triple {2155#true} assume true; {2155#true} is VALID [2020-07-10 15:30:14,704 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {2155#true} {2232#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} #159#return; {2232#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-10 15:30:14,704 INFO L280 TraceCheckUtils]: 13: Hoare triple {2232#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~c~0 := #t~ret10;havoc #t~ret10;havoc #t~mem9.base, #t~mem9.offset; {2232#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-10 15:30:14,705 INFO L280 TraceCheckUtils]: 14: Hoare triple {2232#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} assume ~b~0 <= ~a~0 && ~b~0 <= ~c~0;#res := ~b~0; {2232#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-10 15:30:14,706 INFO L280 TraceCheckUtils]: 15: Hoare triple {2232#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} assume true; {2232#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-10 15:30:14,707 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {2232#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} {2175#(= 0 task_~t.offset)} #165#return; {2193#(not (= 0 task_~t.base))} is VALID [2020-07-10 15:30:14,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:14,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:14,733 INFO L280 TraceCheckUtils]: 0: Hoare triple {2155#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2155#true} is VALID [2020-07-10 15:30:14,733 INFO L280 TraceCheckUtils]: 1: Hoare triple {2155#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2155#true} is VALID [2020-07-10 15:30:14,734 INFO L280 TraceCheckUtils]: 2: Hoare triple {2155#true} assume true; {2155#true} is VALID [2020-07-10 15:30:14,734 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2155#true} {2155#true} #191#return; {2155#true} is VALID [2020-07-10 15:30:14,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:14,741 INFO L280 TraceCheckUtils]: 0: Hoare triple {2155#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2155#true} is VALID [2020-07-10 15:30:14,742 INFO L280 TraceCheckUtils]: 1: Hoare triple {2155#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2155#true} is VALID [2020-07-10 15:30:14,742 INFO L280 TraceCheckUtils]: 2: Hoare triple {2155#true} assume true; {2155#true} is VALID [2020-07-10 15:30:14,742 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2155#true} {2155#true} #193#return; {2155#true} is VALID [2020-07-10 15:30:14,743 INFO L280 TraceCheckUtils]: 0: Hoare triple {2155#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2155#true} is VALID [2020-07-10 15:30:14,743 INFO L280 TraceCheckUtils]: 1: Hoare triple {2155#true} assume !(~t.base == 0 && ~t.offset == 0);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 4); {2155#true} is VALID [2020-07-10 15:30:14,743 INFO L263 TraceCheckUtils]: 2: Hoare triple {2155#true} call #t~ret25 := size(#t~mem24.base, #t~mem24.offset); {2155#true} is VALID [2020-07-10 15:30:14,743 INFO L280 TraceCheckUtils]: 3: Hoare triple {2155#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2155#true} is VALID [2020-07-10 15:30:14,743 INFO L280 TraceCheckUtils]: 4: Hoare triple {2155#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2155#true} is VALID [2020-07-10 15:30:14,744 INFO L280 TraceCheckUtils]: 5: Hoare triple {2155#true} assume true; {2155#true} is VALID [2020-07-10 15:30:14,744 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {2155#true} {2155#true} #191#return; {2155#true} is VALID [2020-07-10 15:30:14,744 INFO L280 TraceCheckUtils]: 7: Hoare triple {2155#true} assume -2147483648 <= #t~ret25 && #t~ret25 <= 2147483647;call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~t.base, 8 + ~t.offset, 4); {2155#true} is VALID [2020-07-10 15:30:14,744 INFO L263 TraceCheckUtils]: 8: Hoare triple {2155#true} call #t~ret27 := size(#t~mem26.base, #t~mem26.offset); {2155#true} is VALID [2020-07-10 15:30:14,744 INFO L280 TraceCheckUtils]: 9: Hoare triple {2155#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2155#true} is VALID [2020-07-10 15:30:14,745 INFO L280 TraceCheckUtils]: 10: Hoare triple {2155#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2155#true} is VALID [2020-07-10 15:30:14,745 INFO L280 TraceCheckUtils]: 11: Hoare triple {2155#true} assume true; {2155#true} is VALID [2020-07-10 15:30:14,745 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {2155#true} {2155#true} #193#return; {2155#true} is VALID [2020-07-10 15:30:14,745 INFO L280 TraceCheckUtils]: 13: Hoare triple {2155#true} assume -2147483648 <= #t~ret27 && #t~ret27 <= 2147483647;#res := 1 + (#t~ret25 + #t~ret27);havoc #t~mem26.base, #t~mem26.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~ret25;havoc #t~ret27; {2155#true} is VALID [2020-07-10 15:30:14,745 INFO L280 TraceCheckUtils]: 14: Hoare triple {2155#true} assume true; {2155#true} is VALID [2020-07-10 15:30:14,747 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2155#true} {2193#(not (= 0 task_~t.base))} #167#return; {2193#(not (= 0 task_~t.base))} is VALID [2020-07-10 15:30:14,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:14,757 INFO L280 TraceCheckUtils]: 0: Hoare triple {2155#true} ~cond := #in~cond; {2155#true} is VALID [2020-07-10 15:30:14,757 INFO L280 TraceCheckUtils]: 1: Hoare triple {2155#true} assume !(0 == ~cond); {2155#true} is VALID [2020-07-10 15:30:14,757 INFO L280 TraceCheckUtils]: 2: Hoare triple {2155#true} assume true; {2155#true} is VALID [2020-07-10 15:30:14,762 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2155#true} {2193#(not (= 0 task_~t.base))} #169#return; {2193#(not (= 0 task_~t.base))} is VALID [2020-07-10 15:30:14,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:14,779 INFO L280 TraceCheckUtils]: 0: Hoare triple {2249#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2155#true} is VALID [2020-07-10 15:30:14,779 INFO L280 TraceCheckUtils]: 1: Hoare triple {2155#true} assume true; {2155#true} is VALID [2020-07-10 15:30:14,780 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2155#true} {2193#(not (= 0 task_~t.base))} #171#return; {2193#(not (= 0 task_~t.base))} is VALID [2020-07-10 15:30:14,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:14,839 INFO L280 TraceCheckUtils]: 0: Hoare triple {2250#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {2251#(= |tree_inorder_#in~t.base| tree_inorder_~t.base)} is VALID [2020-07-10 15:30:14,840 INFO L280 TraceCheckUtils]: 1: Hoare triple {2251#(= |tree_inorder_#in~t.base| tree_inorder_~t.base)} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {2252#(= 0 |tree_inorder_#in~t.base|)} is VALID [2020-07-10 15:30:14,841 INFO L280 TraceCheckUtils]: 2: Hoare triple {2252#(= 0 |tree_inorder_#in~t.base|)} assume true; {2252#(= 0 |tree_inorder_#in~t.base|)} is VALID [2020-07-10 15:30:14,842 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2252#(= 0 |tree_inorder_#in~t.base|)} {2193#(not (= 0 task_~t.base))} #173#return; {2156#false} is VALID [2020-07-10 15:30:14,843 INFO L263 TraceCheckUtils]: 0: Hoare triple {2155#true} call ULTIMATE.init(); {2221#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:30:14,843 INFO L280 TraceCheckUtils]: 1: Hoare triple {2221#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2155#true} is VALID [2020-07-10 15:30:14,843 INFO L280 TraceCheckUtils]: 2: Hoare triple {2155#true} assume true; {2155#true} is VALID [2020-07-10 15:30:14,843 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2155#true} {2155#true} #195#return; {2155#true} is VALID [2020-07-10 15:30:14,844 INFO L263 TraceCheckUtils]: 4: Hoare triple {2155#true} call #t~ret42 := main(); {2155#true} is VALID [2020-07-10 15:30:14,844 INFO L263 TraceCheckUtils]: 5: Hoare triple {2155#true} call #t~ret41.base, #t~ret41.offset := nondet_tree(); {2222#(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 15:30:14,846 INFO L280 TraceCheckUtils]: 6: Hoare triple {2222#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume !(0 != #t~nondet1 % 256);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~n~0.base, ~n~0.offset := #t~malloc2.base, #t~malloc2.offset;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~n~0.base, ~n~0.offset, 4);havoc #t~nondet3; {2223#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-10 15:30:14,846 INFO L263 TraceCheckUtils]: 7: Hoare triple {2223#(= nondet_tree_~n~0.offset 0)} call #t~ret4.base, #t~ret4.offset := nondet_tree(); {2222#(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 15:30:14,847 INFO L280 TraceCheckUtils]: 8: Hoare triple {2222#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {2155#true} is VALID [2020-07-10 15:30:14,847 INFO L280 TraceCheckUtils]: 9: Hoare triple {2155#true} assume true; {2155#true} is VALID [2020-07-10 15:30:14,848 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2155#true} {2223#(= nondet_tree_~n~0.offset 0)} #161#return; {2223#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-10 15:30:14,848 INFO L280 TraceCheckUtils]: 11: Hoare triple {2223#(= nondet_tree_~n~0.offset 0)} call write~$Pointer$(#t~ret4.base, #t~ret4.offset, ~n~0.base, 4 + ~n~0.offset, 4);havoc #t~ret4.base, #t~ret4.offset; {2223#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-10 15:30:14,849 INFO L263 TraceCheckUtils]: 12: Hoare triple {2223#(= nondet_tree_~n~0.offset 0)} call #t~ret5.base, #t~ret5.offset := nondet_tree(); {2222#(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 15:30:14,849 INFO L280 TraceCheckUtils]: 13: Hoare triple {2222#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {2155#true} is VALID [2020-07-10 15:30:14,849 INFO L280 TraceCheckUtils]: 14: Hoare triple {2155#true} assume true; {2155#true} is VALID [2020-07-10 15:30:14,850 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2155#true} {2223#(= nondet_tree_~n~0.offset 0)} #163#return; {2223#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-10 15:30:14,851 INFO L280 TraceCheckUtils]: 16: Hoare triple {2223#(= nondet_tree_~n~0.offset 0)} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~n~0.base, 8 + ~n~0.offset, 4);havoc #t~ret5.base, #t~ret5.offset;#res.base, #res.offset := ~n~0.base, ~n~0.offset; {2230#(and (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0))} is VALID [2020-07-10 15:30:14,852 INFO L280 TraceCheckUtils]: 17: Hoare triple {2230#(and (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0))} assume true; {2230#(and (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0))} is VALID [2020-07-10 15:30:14,852 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {2230#(and (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0))} {2155#true} #153#return; {2173#(= 0 |main_#t~ret41.offset|)} is VALID [2020-07-10 15:30:14,853 INFO L263 TraceCheckUtils]: 19: Hoare triple {2173#(= 0 |main_#t~ret41.offset|)} call task(#t~ret41.base, #t~ret41.offset); {2174#(= 0 |task_#in~t.offset|)} is VALID [2020-07-10 15:30:14,854 INFO L280 TraceCheckUtils]: 20: Hoare triple {2174#(= 0 |task_#in~t.offset|)} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2175#(= 0 task_~t.offset)} is VALID [2020-07-10 15:30:14,854 INFO L263 TraceCheckUtils]: 21: Hoare triple {2175#(= 0 task_~t.offset)} call #t~ret28 := min(~t.base, ~t.offset); {2155#true} is VALID [2020-07-10 15:30:14,855 INFO L280 TraceCheckUtils]: 22: Hoare triple {2155#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2231#(and (= min_~n.base |min_#in~n.base|) (= min_~n.offset |min_#in~n.offset|))} is VALID [2020-07-10 15:30:14,856 INFO L280 TraceCheckUtils]: 23: Hoare triple {2231#(and (= min_~n.base |min_#in~n.base|) (= min_~n.offset |min_#in~n.offset|))} assume !(~n.base == 0 && ~n.offset == 0);call #t~mem6 := read~int(~n.base, ~n.offset, 4);~a~0 := #t~mem6;havoc #t~mem6;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~n.base, 4 + ~n.offset, 4); {2232#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-10 15:30:14,856 INFO L263 TraceCheckUtils]: 24: Hoare triple {2232#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} call #t~ret8 := min(#t~mem7.base, #t~mem7.offset); {2155#true} is VALID [2020-07-10 15:30:14,856 INFO L280 TraceCheckUtils]: 25: Hoare triple {2155#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2155#true} is VALID [2020-07-10 15:30:14,856 INFO L280 TraceCheckUtils]: 26: Hoare triple {2155#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2155#true} is VALID [2020-07-10 15:30:14,856 INFO L280 TraceCheckUtils]: 27: Hoare triple {2155#true} assume true; {2155#true} is VALID [2020-07-10 15:30:14,857 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {2155#true} {2232#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} #157#return; {2232#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-10 15:30:14,858 INFO L280 TraceCheckUtils]: 29: Hoare triple {2232#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~b~0 := #t~ret8;havoc #t~mem7.base, #t~mem7.offset;havoc #t~ret8;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~n.base, 8 + ~n.offset, 4); {2232#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-10 15:30:14,858 INFO L263 TraceCheckUtils]: 30: Hoare triple {2232#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} call #t~ret10 := min(#t~mem9.base, #t~mem9.offset); {2155#true} is VALID [2020-07-10 15:30:14,858 INFO L280 TraceCheckUtils]: 31: Hoare triple {2155#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2155#true} is VALID [2020-07-10 15:30:14,858 INFO L280 TraceCheckUtils]: 32: Hoare triple {2155#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2155#true} is VALID [2020-07-10 15:30:14,859 INFO L280 TraceCheckUtils]: 33: Hoare triple {2155#true} assume true; {2155#true} is VALID [2020-07-10 15:30:14,859 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2155#true} {2232#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} #159#return; {2232#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-10 15:30:14,860 INFO L280 TraceCheckUtils]: 35: Hoare triple {2232#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~c~0 := #t~ret10;havoc #t~ret10;havoc #t~mem9.base, #t~mem9.offset; {2232#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-10 15:30:14,861 INFO L280 TraceCheckUtils]: 36: Hoare triple {2232#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} assume ~b~0 <= ~a~0 && ~b~0 <= ~c~0;#res := ~b~0; {2232#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-10 15:30:14,861 INFO L280 TraceCheckUtils]: 37: Hoare triple {2232#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} assume true; {2232#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-10 15:30:14,862 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {2232#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} {2175#(= 0 task_~t.offset)} #165#return; {2193#(not (= 0 task_~t.base))} is VALID [2020-07-10 15:30:14,863 INFO L280 TraceCheckUtils]: 39: Hoare triple {2193#(not (= 0 task_~t.base))} assume -2147483648 <= #t~ret28 && #t~ret28 <= 2147483647;~a~1 := #t~ret28;havoc #t~ret28;call ~#b~1.base, ~#b~1.offset := #Ultimate.allocOnStack(4); {2193#(not (= 0 task_~t.base))} is VALID [2020-07-10 15:30:14,863 INFO L263 TraceCheckUtils]: 40: Hoare triple {2193#(not (= 0 task_~t.base))} call #t~ret29 := size(~t.base, ~t.offset); {2155#true} is VALID [2020-07-10 15:30:14,863 INFO L280 TraceCheckUtils]: 41: Hoare triple {2155#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2155#true} is VALID [2020-07-10 15:30:14,863 INFO L280 TraceCheckUtils]: 42: Hoare triple {2155#true} assume !(~t.base == 0 && ~t.offset == 0);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 4); {2155#true} is VALID [2020-07-10 15:30:14,864 INFO L263 TraceCheckUtils]: 43: Hoare triple {2155#true} call #t~ret25 := size(#t~mem24.base, #t~mem24.offset); {2155#true} is VALID [2020-07-10 15:30:14,864 INFO L280 TraceCheckUtils]: 44: Hoare triple {2155#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2155#true} is VALID [2020-07-10 15:30:14,864 INFO L280 TraceCheckUtils]: 45: Hoare triple {2155#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2155#true} is VALID [2020-07-10 15:30:14,864 INFO L280 TraceCheckUtils]: 46: Hoare triple {2155#true} assume true; {2155#true} is VALID [2020-07-10 15:30:14,864 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {2155#true} {2155#true} #191#return; {2155#true} is VALID [2020-07-10 15:30:14,865 INFO L280 TraceCheckUtils]: 48: Hoare triple {2155#true} assume -2147483648 <= #t~ret25 && #t~ret25 <= 2147483647;call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~t.base, 8 + ~t.offset, 4); {2155#true} is VALID [2020-07-10 15:30:14,865 INFO L263 TraceCheckUtils]: 49: Hoare triple {2155#true} call #t~ret27 := size(#t~mem26.base, #t~mem26.offset); {2155#true} is VALID [2020-07-10 15:30:14,865 INFO L280 TraceCheckUtils]: 50: Hoare triple {2155#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2155#true} is VALID [2020-07-10 15:30:14,865 INFO L280 TraceCheckUtils]: 51: Hoare triple {2155#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2155#true} is VALID [2020-07-10 15:30:14,865 INFO L280 TraceCheckUtils]: 52: Hoare triple {2155#true} assume true; {2155#true} is VALID [2020-07-10 15:30:14,866 INFO L275 TraceCheckUtils]: 53: Hoare quadruple {2155#true} {2155#true} #193#return; {2155#true} is VALID [2020-07-10 15:30:14,866 INFO L280 TraceCheckUtils]: 54: Hoare triple {2155#true} assume -2147483648 <= #t~ret27 && #t~ret27 <= 2147483647;#res := 1 + (#t~ret25 + #t~ret27);havoc #t~mem26.base, #t~mem26.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~ret25;havoc #t~ret27; {2155#true} is VALID [2020-07-10 15:30:14,866 INFO L280 TraceCheckUtils]: 55: Hoare triple {2155#true} assume true; {2155#true} is VALID [2020-07-10 15:30:14,867 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {2155#true} {2193#(not (= 0 task_~t.base))} #167#return; {2193#(not (= 0 task_~t.base))} is VALID [2020-07-10 15:30:14,867 INFO L280 TraceCheckUtils]: 57: Hoare triple {2193#(not (= 0 task_~t.base))} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~n~1 := #t~ret29;havoc #t~ret29; {2193#(not (= 0 task_~t.base))} is VALID [2020-07-10 15:30:14,868 INFO L263 TraceCheckUtils]: 58: Hoare triple {2193#(not (= 0 task_~t.base))} call assume_cycle_if_not((if 0 != ~n~1 then 1 else 0)); {2155#true} is VALID [2020-07-10 15:30:14,868 INFO L280 TraceCheckUtils]: 59: Hoare triple {2155#true} ~cond := #in~cond; {2155#true} is VALID [2020-07-10 15:30:14,868 INFO L280 TraceCheckUtils]: 60: Hoare triple {2155#true} assume !(0 == ~cond); {2155#true} is VALID [2020-07-10 15:30:14,868 INFO L280 TraceCheckUtils]: 61: Hoare triple {2155#true} assume true; {2155#true} is VALID [2020-07-10 15:30:14,869 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {2155#true} {2193#(not (= 0 task_~t.base))} #169#return; {2193#(not (= 0 task_~t.base))} is VALID [2020-07-10 15:30:14,869 INFO L280 TraceCheckUtils]: 63: Hoare triple {2193#(not (= 0 task_~t.base))} call #t~malloc30.base, #t~malloc30.offset := #Ultimate.allocOnHeap(4 * ~n~1); {2193#(not (= 0 task_~t.base))} is VALID [2020-07-10 15:30:14,870 INFO L263 TraceCheckUtils]: 64: Hoare triple {2193#(not (= 0 task_~t.base))} call #Ultimate.meminit(#t~malloc30.base, #t~malloc30.offset, ~n~1, 4, 4 * ~n~1); {2249#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-10 15:30:14,871 INFO L280 TraceCheckUtils]: 65: Hoare triple {2249#(= |#memory_int| |old(#memory_int)|)} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2155#true} is VALID [2020-07-10 15:30:14,871 INFO L280 TraceCheckUtils]: 66: Hoare triple {2155#true} assume true; {2155#true} is VALID [2020-07-10 15:30:14,872 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {2155#true} {2193#(not (= 0 task_~t.base))} #171#return; {2193#(not (= 0 task_~t.base))} is VALID [2020-07-10 15:30:14,873 INFO L280 TraceCheckUtils]: 68: Hoare triple {2193#(not (= 0 task_~t.base))} ~x~0.base, ~x~0.offset := #t~malloc30.base, #t~malloc30.offset; {2193#(not (= 0 task_~t.base))} is VALID [2020-07-10 15:30:14,874 INFO L263 TraceCheckUtils]: 69: Hoare triple {2193#(not (= 0 task_~t.base))} call #t~ret31 := tree_inorder(~t.base, ~t.offset, ~x~0.base, ~x~0.offset, ~n~1); {2250#(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 15:30:14,875 INFO L280 TraceCheckUtils]: 70: Hoare triple {2250#(and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {2251#(= |tree_inorder_#in~t.base| tree_inorder_~t.base)} is VALID [2020-07-10 15:30:14,876 INFO L280 TraceCheckUtils]: 71: Hoare triple {2251#(= |tree_inorder_#in~t.base| tree_inorder_~t.base)} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {2252#(= 0 |tree_inorder_#in~t.base|)} is VALID [2020-07-10 15:30:14,876 INFO L280 TraceCheckUtils]: 72: Hoare triple {2252#(= 0 |tree_inorder_#in~t.base|)} assume true; {2252#(= 0 |tree_inorder_#in~t.base|)} is VALID [2020-07-10 15:30:14,877 INFO L275 TraceCheckUtils]: 73: Hoare quadruple {2252#(= 0 |tree_inorder_#in~t.base|)} {2193#(not (= 0 task_~t.base))} #173#return; {2156#false} is VALID [2020-07-10 15:30:14,877 INFO L280 TraceCheckUtils]: 74: Hoare triple {2156#false} assume -2147483648 <= #t~ret31 && #t~ret31 <= 2147483647;havoc #t~ret31;call #t~mem32 := read~int(~x~0.base, ~x~0.offset, 4); {2156#false} is VALID [2020-07-10 15:30:14,878 INFO L263 TraceCheckUtils]: 75: Hoare triple {2156#false} call __VERIFIER_assert((if ~a~1 == #t~mem32 then 1 else 0)); {2156#false} is VALID [2020-07-10 15:30:14,878 INFO L280 TraceCheckUtils]: 76: Hoare triple {2156#false} ~cond := #in~cond; {2156#false} is VALID [2020-07-10 15:30:14,878 INFO L280 TraceCheckUtils]: 77: Hoare triple {2156#false} assume 0 == ~cond; {2156#false} is VALID [2020-07-10 15:30:14,878 INFO L280 TraceCheckUtils]: 78: Hoare triple {2156#false} assume !false; {2156#false} is VALID [2020-07-10 15:30:14,895 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-07-10 15:30:14,896 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802613388] [2020-07-10 15:30:14,896 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849100131] [2020-07-10 15:30:14,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:30:15,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:15,004 INFO L264 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 31 conjunts are in the unsatisfiable core [2020-07-10 15:30:15,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:30:15,043 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:30:15,211 INFO L263 TraceCheckUtils]: 0: Hoare triple {2155#true} call ULTIMATE.init(); {2155#true} is VALID [2020-07-10 15:30:15,212 INFO L280 TraceCheckUtils]: 1: Hoare triple {2155#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2155#true} is VALID [2020-07-10 15:30:15,212 INFO L280 TraceCheckUtils]: 2: Hoare triple {2155#true} assume true; {2155#true} is VALID [2020-07-10 15:30:15,212 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2155#true} {2155#true} #195#return; {2155#true} is VALID [2020-07-10 15:30:15,212 INFO L263 TraceCheckUtils]: 4: Hoare triple {2155#true} call #t~ret42 := main(); {2155#true} is VALID [2020-07-10 15:30:15,212 INFO L263 TraceCheckUtils]: 5: Hoare triple {2155#true} call #t~ret41.base, #t~ret41.offset := nondet_tree(); {2155#true} is VALID [2020-07-10 15:30:15,214 INFO L280 TraceCheckUtils]: 6: Hoare triple {2155#true} assume !(0 != #t~nondet1 % 256);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12);~n~0.base, ~n~0.offset := #t~malloc2.base, #t~malloc2.offset;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~n~0.base, ~n~0.offset, 4);havoc #t~nondet3; {2223#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-10 15:30:15,214 INFO L263 TraceCheckUtils]: 7: Hoare triple {2223#(= nondet_tree_~n~0.offset 0)} call #t~ret4.base, #t~ret4.offset := nondet_tree(); {2155#true} is VALID [2020-07-10 15:30:15,214 INFO L280 TraceCheckUtils]: 8: Hoare triple {2155#true} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {2155#true} is VALID [2020-07-10 15:30:15,214 INFO L280 TraceCheckUtils]: 9: Hoare triple {2155#true} assume true; {2155#true} is VALID [2020-07-10 15:30:15,216 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {2155#true} {2223#(= nondet_tree_~n~0.offset 0)} #161#return; {2223#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-10 15:30:15,216 INFO L280 TraceCheckUtils]: 11: Hoare triple {2223#(= nondet_tree_~n~0.offset 0)} call write~$Pointer$(#t~ret4.base, #t~ret4.offset, ~n~0.base, 4 + ~n~0.offset, 4);havoc #t~ret4.base, #t~ret4.offset; {2223#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-10 15:30:15,216 INFO L263 TraceCheckUtils]: 12: Hoare triple {2223#(= nondet_tree_~n~0.offset 0)} call #t~ret5.base, #t~ret5.offset := nondet_tree(); {2155#true} is VALID [2020-07-10 15:30:15,217 INFO L280 TraceCheckUtils]: 13: Hoare triple {2155#true} assume 0 != #t~nondet1 % 256;havoc #t~nondet1;#res.base, #res.offset := 0, 0; {2155#true} is VALID [2020-07-10 15:30:15,217 INFO L280 TraceCheckUtils]: 14: Hoare triple {2155#true} assume true; {2155#true} is VALID [2020-07-10 15:30:15,218 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {2155#true} {2223#(= nondet_tree_~n~0.offset 0)} #163#return; {2223#(= nondet_tree_~n~0.offset 0)} is VALID [2020-07-10 15:30:15,219 INFO L280 TraceCheckUtils]: 16: Hoare triple {2223#(= nondet_tree_~n~0.offset 0)} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~n~0.base, 8 + ~n~0.offset, 4);havoc #t~ret5.base, #t~ret5.offset;#res.base, #res.offset := ~n~0.base, ~n~0.offset; {2230#(and (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0))} is VALID [2020-07-10 15:30:15,219 INFO L280 TraceCheckUtils]: 17: Hoare triple {2230#(and (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0))} assume true; {2230#(and (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0))} is VALID [2020-07-10 15:30:15,220 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {2230#(and (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0))} {2155#true} #153#return; {2173#(= 0 |main_#t~ret41.offset|)} is VALID [2020-07-10 15:30:15,221 INFO L263 TraceCheckUtils]: 19: Hoare triple {2173#(= 0 |main_#t~ret41.offset|)} call task(#t~ret41.base, #t~ret41.offset); {2174#(= 0 |task_#in~t.offset|)} is VALID [2020-07-10 15:30:15,222 INFO L280 TraceCheckUtils]: 20: Hoare triple {2174#(= 0 |task_#in~t.offset|)} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2175#(= 0 task_~t.offset)} is VALID [2020-07-10 15:30:15,222 INFO L263 TraceCheckUtils]: 21: Hoare triple {2175#(= 0 task_~t.offset)} call #t~ret28 := min(~t.base, ~t.offset); {2155#true} is VALID [2020-07-10 15:30:15,222 INFO L280 TraceCheckUtils]: 22: Hoare triple {2155#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2231#(and (= min_~n.base |min_#in~n.base|) (= min_~n.offset |min_#in~n.offset|))} is VALID [2020-07-10 15:30:15,223 INFO L280 TraceCheckUtils]: 23: Hoare triple {2231#(and (= min_~n.base |min_#in~n.base|) (= min_~n.offset |min_#in~n.offset|))} assume !(~n.base == 0 && ~n.offset == 0);call #t~mem6 := read~int(~n.base, ~n.offset, 4);~a~0 := #t~mem6;havoc #t~mem6;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~n.base, 4 + ~n.offset, 4); {2232#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-10 15:30:15,224 INFO L263 TraceCheckUtils]: 24: Hoare triple {2232#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} call #t~ret8 := min(#t~mem7.base, #t~mem7.offset); {2155#true} is VALID [2020-07-10 15:30:15,224 INFO L280 TraceCheckUtils]: 25: Hoare triple {2155#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2155#true} is VALID [2020-07-10 15:30:15,224 INFO L280 TraceCheckUtils]: 26: Hoare triple {2155#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2155#true} is VALID [2020-07-10 15:30:15,224 INFO L280 TraceCheckUtils]: 27: Hoare triple {2155#true} assume true; {2155#true} is VALID [2020-07-10 15:30:15,225 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {2155#true} {2232#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} #157#return; {2232#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-10 15:30:15,226 INFO L280 TraceCheckUtils]: 29: Hoare triple {2232#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647;~b~0 := #t~ret8;havoc #t~mem7.base, #t~mem7.offset;havoc #t~ret8;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~n.base, 8 + ~n.offset, 4); {2232#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-10 15:30:15,226 INFO L263 TraceCheckUtils]: 30: Hoare triple {2232#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} call #t~ret10 := min(#t~mem9.base, #t~mem9.offset); {2155#true} is VALID [2020-07-10 15:30:15,226 INFO L280 TraceCheckUtils]: 31: Hoare triple {2155#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {2155#true} is VALID [2020-07-10 15:30:15,226 INFO L280 TraceCheckUtils]: 32: Hoare triple {2155#true} assume ~n.base == 0 && ~n.offset == 0;#res := 2147483647; {2155#true} is VALID [2020-07-10 15:30:15,226 INFO L280 TraceCheckUtils]: 33: Hoare triple {2155#true} assume true; {2155#true} is VALID [2020-07-10 15:30:15,227 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2155#true} {2232#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} #159#return; {2232#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-10 15:30:15,228 INFO L280 TraceCheckUtils]: 35: Hoare triple {2232#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} assume -2147483648 <= #t~ret10 && #t~ret10 <= 2147483647;~c~0 := #t~ret10;havoc #t~ret10;havoc #t~mem9.base, #t~mem9.offset; {2232#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-10 15:30:15,228 INFO L280 TraceCheckUtils]: 36: Hoare triple {2232#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} assume ~b~0 <= ~a~0 && ~b~0 <= ~c~0;#res := ~b~0; {2232#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-10 15:30:15,229 INFO L280 TraceCheckUtils]: 37: Hoare triple {2232#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} assume true; {2232#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} is VALID [2020-07-10 15:30:15,230 INFO L275 TraceCheckUtils]: 38: Hoare quadruple {2232#(or (not (= 0 |min_#in~n.base|)) (not (= 0 |min_#in~n.offset|)))} {2175#(= 0 task_~t.offset)} #165#return; {2370#(and (not (= 0 task_~t.base)) (= 0 task_~t.offset))} is VALID [2020-07-10 15:30:15,231 INFO L280 TraceCheckUtils]: 39: Hoare triple {2370#(and (not (= 0 task_~t.base)) (= 0 task_~t.offset))} assume -2147483648 <= #t~ret28 && #t~ret28 <= 2147483647;~a~1 := #t~ret28;havoc #t~ret28;call ~#b~1.base, ~#b~1.offset := #Ultimate.allocOnStack(4); {2370#(and (not (= 0 task_~t.base)) (= 0 task_~t.offset))} is VALID [2020-07-10 15:30:15,231 INFO L263 TraceCheckUtils]: 40: Hoare triple {2370#(and (not (= 0 task_~t.base)) (= 0 task_~t.offset))} call #t~ret29 := size(~t.base, ~t.offset); {2155#true} is VALID [2020-07-10 15:30:15,231 INFO L280 TraceCheckUtils]: 41: Hoare triple {2155#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2155#true} is VALID [2020-07-10 15:30:15,231 INFO L280 TraceCheckUtils]: 42: Hoare triple {2155#true} assume !(~t.base == 0 && ~t.offset == 0);call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~t.base, 4 + ~t.offset, 4); {2155#true} is VALID [2020-07-10 15:30:15,231 INFO L263 TraceCheckUtils]: 43: Hoare triple {2155#true} call #t~ret25 := size(#t~mem24.base, #t~mem24.offset); {2155#true} is VALID [2020-07-10 15:30:15,232 INFO L280 TraceCheckUtils]: 44: Hoare triple {2155#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2155#true} is VALID [2020-07-10 15:30:15,232 INFO L280 TraceCheckUtils]: 45: Hoare triple {2155#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2155#true} is VALID [2020-07-10 15:30:15,232 INFO L280 TraceCheckUtils]: 46: Hoare triple {2155#true} assume true; {2155#true} is VALID [2020-07-10 15:30:15,232 INFO L275 TraceCheckUtils]: 47: Hoare quadruple {2155#true} {2155#true} #191#return; {2155#true} is VALID [2020-07-10 15:30:15,232 INFO L280 TraceCheckUtils]: 48: Hoare triple {2155#true} assume -2147483648 <= #t~ret25 && #t~ret25 <= 2147483647;call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~t.base, 8 + ~t.offset, 4); {2155#true} is VALID [2020-07-10 15:30:15,233 INFO L263 TraceCheckUtils]: 49: Hoare triple {2155#true} call #t~ret27 := size(#t~mem26.base, #t~mem26.offset); {2155#true} is VALID [2020-07-10 15:30:15,233 INFO L280 TraceCheckUtils]: 50: Hoare triple {2155#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset; {2155#true} is VALID [2020-07-10 15:30:15,233 INFO L280 TraceCheckUtils]: 51: Hoare triple {2155#true} assume ~t.base == 0 && ~t.offset == 0;#res := 0; {2155#true} is VALID [2020-07-10 15:30:15,233 INFO L280 TraceCheckUtils]: 52: Hoare triple {2155#true} assume true; {2155#true} is VALID [2020-07-10 15:30:15,233 INFO L275 TraceCheckUtils]: 53: Hoare quadruple {2155#true} {2155#true} #193#return; {2155#true} is VALID [2020-07-10 15:30:15,234 INFO L280 TraceCheckUtils]: 54: Hoare triple {2155#true} assume -2147483648 <= #t~ret27 && #t~ret27 <= 2147483647;#res := 1 + (#t~ret25 + #t~ret27);havoc #t~mem26.base, #t~mem26.offset;havoc #t~mem24.base, #t~mem24.offset;havoc #t~ret25;havoc #t~ret27; {2155#true} is VALID [2020-07-10 15:30:15,234 INFO L280 TraceCheckUtils]: 55: Hoare triple {2155#true} assume true; {2155#true} is VALID [2020-07-10 15:30:15,235 INFO L275 TraceCheckUtils]: 56: Hoare quadruple {2155#true} {2370#(and (not (= 0 task_~t.base)) (= 0 task_~t.offset))} #167#return; {2193#(not (= 0 task_~t.base))} is VALID [2020-07-10 15:30:15,235 INFO L280 TraceCheckUtils]: 57: Hoare triple {2193#(not (= 0 task_~t.base))} assume -2147483648 <= #t~ret29 && #t~ret29 <= 2147483647;~n~1 := #t~ret29;havoc #t~ret29; {2193#(not (= 0 task_~t.base))} is VALID [2020-07-10 15:30:15,235 INFO L263 TraceCheckUtils]: 58: Hoare triple {2193#(not (= 0 task_~t.base))} call assume_cycle_if_not((if 0 != ~n~1 then 1 else 0)); {2155#true} is VALID [2020-07-10 15:30:15,236 INFO L280 TraceCheckUtils]: 59: Hoare triple {2155#true} ~cond := #in~cond; {2155#true} is VALID [2020-07-10 15:30:15,236 INFO L280 TraceCheckUtils]: 60: Hoare triple {2155#true} assume !(0 == ~cond); {2155#true} is VALID [2020-07-10 15:30:15,236 INFO L280 TraceCheckUtils]: 61: Hoare triple {2155#true} assume true; {2155#true} is VALID [2020-07-10 15:30:15,237 INFO L275 TraceCheckUtils]: 62: Hoare quadruple {2155#true} {2193#(not (= 0 task_~t.base))} #169#return; {2193#(not (= 0 task_~t.base))} is VALID [2020-07-10 15:30:15,237 INFO L280 TraceCheckUtils]: 63: Hoare triple {2193#(not (= 0 task_~t.base))} call #t~malloc30.base, #t~malloc30.offset := #Ultimate.allocOnHeap(4 * ~n~1); {2193#(not (= 0 task_~t.base))} is VALID [2020-07-10 15:30:15,237 INFO L263 TraceCheckUtils]: 64: Hoare triple {2193#(not (= 0 task_~t.base))} call #Ultimate.meminit(#t~malloc30.base, #t~malloc30.offset, ~n~1, 4, 4 * ~n~1); {2155#true} is VALID [2020-07-10 15:30:15,238 INFO L280 TraceCheckUtils]: 65: Hoare triple {2155#true} #memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, #ptr.base); {2155#true} is VALID [2020-07-10 15:30:15,238 INFO L280 TraceCheckUtils]: 66: Hoare triple {2155#true} assume true; {2155#true} is VALID [2020-07-10 15:30:15,239 INFO L275 TraceCheckUtils]: 67: Hoare quadruple {2155#true} {2193#(not (= 0 task_~t.base))} #171#return; {2193#(not (= 0 task_~t.base))} is VALID [2020-07-10 15:30:15,239 INFO L280 TraceCheckUtils]: 68: Hoare triple {2193#(not (= 0 task_~t.base))} ~x~0.base, ~x~0.offset := #t~malloc30.base, #t~malloc30.offset; {2193#(not (= 0 task_~t.base))} is VALID [2020-07-10 15:30:15,239 INFO L263 TraceCheckUtils]: 69: Hoare triple {2193#(not (= 0 task_~t.base))} call #t~ret31 := tree_inorder(~t.base, ~t.offset, ~x~0.base, ~x~0.offset, ~n~1); {2155#true} is VALID [2020-07-10 15:30:15,240 INFO L280 TraceCheckUtils]: 70: Hoare triple {2155#true} ~t.base, ~t.offset := #in~t.base, #in~t.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;~i := #in~i; {2251#(= |tree_inorder_#in~t.base| tree_inorder_~t.base)} is VALID [2020-07-10 15:30:15,241 INFO L280 TraceCheckUtils]: 71: Hoare triple {2251#(= |tree_inorder_#in~t.base| tree_inorder_~t.base)} assume ~t.base == 0 && ~t.offset == 0;#res := ~i; {2252#(= 0 |tree_inorder_#in~t.base|)} is VALID [2020-07-10 15:30:15,241 INFO L280 TraceCheckUtils]: 72: Hoare triple {2252#(= 0 |tree_inorder_#in~t.base|)} assume true; {2252#(= 0 |tree_inorder_#in~t.base|)} is VALID [2020-07-10 15:30:15,242 INFO L275 TraceCheckUtils]: 73: Hoare quadruple {2252#(= 0 |tree_inorder_#in~t.base|)} {2193#(not (= 0 task_~t.base))} #173#return; {2156#false} is VALID [2020-07-10 15:30:15,243 INFO L280 TraceCheckUtils]: 74: Hoare triple {2156#false} assume -2147483648 <= #t~ret31 && #t~ret31 <= 2147483647;havoc #t~ret31;call #t~mem32 := read~int(~x~0.base, ~x~0.offset, 4); {2156#false} is VALID [2020-07-10 15:30:15,243 INFO L263 TraceCheckUtils]: 75: Hoare triple {2156#false} call __VERIFIER_assert((if ~a~1 == #t~mem32 then 1 else 0)); {2156#false} is VALID [2020-07-10 15:30:15,243 INFO L280 TraceCheckUtils]: 76: Hoare triple {2156#false} ~cond := #in~cond; {2156#false} is VALID [2020-07-10 15:30:15,243 INFO L280 TraceCheckUtils]: 77: Hoare triple {2156#false} assume 0 == ~cond; {2156#false} is VALID [2020-07-10 15:30:15,243 INFO L280 TraceCheckUtils]: 78: Hoare triple {2156#false} assume !false; {2156#false} is VALID [2020-07-10 15:30:15,250 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-07-10 15:30:15,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:30:15,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 17 [2020-07-10 15:30:15,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119415589] [2020-07-10 15:30:15,251 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 79 [2020-07-10 15:30:15,256 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:30:15,256 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2020-07-10 15:30:15,348 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:30:15,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-10 15:30:15,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:30:15,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-10 15:30:15,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2020-07-10 15:30:15,352 INFO L87 Difference]: Start difference. First operand 95 states and 121 transitions. Second operand 17 states. [2020-07-10 15:30:19,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:19,761 INFO L93 Difference]: Finished difference Result 152 states and 194 transitions. [2020-07-10 15:30:19,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-10 15:30:19,761 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 79 [2020-07-10 15:30:19,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:30:19,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-10 15:30:19,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 186 transitions. [2020-07-10 15:30:19,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-10 15:30:19,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 186 transitions. [2020-07-10 15:30:19,772 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 186 transitions. [2020-07-10 15:30:20,063 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:30:20,068 INFO L225 Difference]: With dead ends: 152 [2020-07-10 15:30:20,068 INFO L226 Difference]: Without dead ends: 99 [2020-07-10 15:30:20,073 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=144, Invalid=726, Unknown=0, NotChecked=0, Total=870 [2020-07-10 15:30:20,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-07-10 15:30:20,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2020-07-10 15:30:20,188 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:30:20,188 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand 97 states. [2020-07-10 15:30:20,188 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 97 states. [2020-07-10 15:30:20,188 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 97 states. [2020-07-10 15:30:20,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:20,193 INFO L93 Difference]: Finished difference Result 99 states and 127 transitions. [2020-07-10 15:30:20,194 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 127 transitions. [2020-07-10 15:30:20,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:30:20,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:30:20,195 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 99 states. [2020-07-10 15:30:20,195 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 99 states. [2020-07-10 15:30:20,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:30:20,200 INFO L93 Difference]: Finished difference Result 99 states and 127 transitions. [2020-07-10 15:30:20,201 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 127 transitions. [2020-07-10 15:30:20,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:30:20,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:30:20,202 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:30:20,202 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:30:20,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2020-07-10 15:30:20,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 125 transitions. [2020-07-10 15:30:20,207 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 125 transitions. Word has length 79 [2020-07-10 15:30:20,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:30:20,208 INFO L479 AbstractCegarLoop]: Abstraction has 97 states and 125 transitions. [2020-07-10 15:30:20,208 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-10 15:30:20,208 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 125 transitions. [2020-07-10 15:30:20,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-07-10 15:30:20,209 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:30:20,209 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:30:20,423 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:30:20,424 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:30:20,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:30:20,425 INFO L82 PathProgramCache]: Analyzing trace with hash -708508396, now seen corresponding path program 1 times [2020-07-10 15:30:20,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:30:20,426 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513473218] [2020-07-10 15:30:20,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:30:20,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:30:20,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:30:20,549 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 15:30:20,550 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 15:30:20,550 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-10 15:30:20,618 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 15:30:20,618 WARN L170 areAnnotationChecker]: minENTRY has no Hoare annotation [2020-07-10 15:30:20,619 WARN L170 areAnnotationChecker]: taskENTRY has no Hoare annotation [2020-07-10 15:30:20,619 WARN L170 areAnnotationChecker]: sizeENTRY has no Hoare annotation [2020-07-10 15:30:20,619 WARN L170 areAnnotationChecker]: nondet_treeENTRY has no Hoare annotation [2020-07-10 15:30:20,619 WARN L170 areAnnotationChecker]: nondet_treeENTRY has no Hoare annotation [2020-07-10 15:30:20,619 WARN L170 areAnnotationChecker]: assume_cycle_if_notENTRY has no Hoare annotation [2020-07-10 15:30:20,619 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:30:20,619 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:30:20,619 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 15:30:20,619 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 15:30:20,620 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-10 15:30:20,620 WARN L170 areAnnotationChecker]: #Ultimate.meminitENTRY has no Hoare annotation [2020-07-10 15:30:20,620 WARN L170 areAnnotationChecker]: tree_inorderENTRY has no Hoare annotation [2020-07-10 15:30:20,620 WARN L170 areAnnotationChecker]: tree_delENTRY has no Hoare annotation [2020-07-10 15:30:20,620 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:30:20,620 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-10 15:30:20,621 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-10 15:30:20,621 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2020-07-10 15:30:20,621 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2020-07-10 15:30:20,621 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2020-07-10 15:30:20,621 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2020-07-10 15:30:20,621 WARN L170 areAnnotationChecker]: nondet_treeFINAL has no Hoare annotation [2020-07-10 15:30:20,621 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-10 15:30:20,621 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2020-07-10 15:30:20,622 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-10 15:30:20,622 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-10 15:30:20,622 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:30:20,622 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:30:20,622 WARN L170 areAnnotationChecker]: L108 has no Hoare annotation [2020-07-10 15:30:20,622 WARN L170 areAnnotationChecker]: L108 has no Hoare annotation [2020-07-10 15:30:20,622 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-10 15:30:20,622 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-10 15:30:20,622 WARN L170 areAnnotationChecker]: #Ultimate.meminitFINAL has no Hoare annotation [2020-07-10 15:30:20,623 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2020-07-10 15:30:20,623 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2020-07-10 15:30:20,623 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2020-07-10 15:30:20,623 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2020-07-10 15:30:20,623 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:30:20,623 WARN L170 areAnnotationChecker]: minFINAL has no Hoare annotation [2020-07-10 15:30:20,623 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-10 15:30:20,623 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-10 15:30:20,623 WARN L170 areAnnotationChecker]: L84-1 has no Hoare annotation [2020-07-10 15:30:20,624 WARN L170 areAnnotationChecker]: sizeFINAL has no Hoare annotation [2020-07-10 15:30:20,624 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2020-07-10 15:30:20,624 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2020-07-10 15:30:20,624 WARN L170 areAnnotationChecker]: nondet_treeEXIT has no Hoare annotation [2020-07-10 15:30:20,624 WARN L170 areAnnotationChecker]: nondet_treeEXIT has no Hoare annotation [2020-07-10 15:30:20,624 WARN L170 areAnnotationChecker]: nondet_treeEXIT has no Hoare annotation [2020-07-10 15:30:20,624 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2020-07-10 15:30:20,625 WARN L170 areAnnotationChecker]: L9-3 has no Hoare annotation [2020-07-10 15:30:20,625 WARN L170 areAnnotationChecker]: L9-3 has no Hoare annotation [2020-07-10 15:30:20,625 WARN L170 areAnnotationChecker]: L9-3 has no Hoare annotation [2020-07-10 15:30:20,625 WARN L170 areAnnotationChecker]: L9-5 has no Hoare annotation [2020-07-10 15:30:20,625 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:30:20,625 WARN L170 areAnnotationChecker]: L108-1 has no Hoare annotation [2020-07-10 15:30:20,626 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2020-07-10 15:30:20,626 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2020-07-10 15:30:20,626 WARN L170 areAnnotationChecker]: L14-3 has no Hoare annotation [2020-07-10 15:30:20,626 WARN L170 areAnnotationChecker]: #Ultimate.meminitEXIT has no Hoare annotation [2020-07-10 15:30:20,626 WARN L170 areAnnotationChecker]: #Ultimate.meminitEXIT has no Hoare annotation [2020-07-10 15:30:20,626 WARN L170 areAnnotationChecker]: tree_inorderFINAL has no Hoare annotation [2020-07-10 15:30:20,627 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2020-07-10 15:30:20,627 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2020-07-10 15:30:20,627 WARN L170 areAnnotationChecker]: L53-2 has no Hoare annotation [2020-07-10 15:30:20,627 WARN L170 areAnnotationChecker]: L57-2 has no Hoare annotation [2020-07-10 15:30:20,627 WARN L170 areAnnotationChecker]: L57-2 has no Hoare annotation [2020-07-10 15:30:20,627 WARN L170 areAnnotationChecker]: L57-2 has no Hoare annotation [2020-07-10 15:30:20,627 WARN L170 areAnnotationChecker]: minEXIT has no Hoare annotation [2020-07-10 15:30:20,628 WARN L170 areAnnotationChecker]: minEXIT has no Hoare annotation [2020-07-10 15:30:20,628 WARN L170 areAnnotationChecker]: minEXIT has no Hoare annotation [2020-07-10 15:30:20,628 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2020-07-10 15:30:20,628 WARN L170 areAnnotationChecker]: L87 has no Hoare annotation [2020-07-10 15:30:20,628 WARN L170 areAnnotationChecker]: L87 has no Hoare annotation [2020-07-10 15:30:20,628 WARN L170 areAnnotationChecker]: sizeEXIT has no Hoare annotation [2020-07-10 15:30:20,628 WARN L170 areAnnotationChecker]: sizeEXIT has no Hoare annotation [2020-07-10 15:30:20,628 WARN L170 areAnnotationChecker]: sizeEXIT has no Hoare annotation [2020-07-10 15:30:20,629 WARN L170 areAnnotationChecker]: sizeEXIT has no Hoare annotation [2020-07-10 15:30:20,629 WARN L170 areAnnotationChecker]: L80-1 has no Hoare annotation [2020-07-10 15:30:20,629 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2020-07-10 15:30:20,629 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-10 15:30:20,629 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-10 15:30:20,629 WARN L170 areAnnotationChecker]: assume_cycle_if_notEXIT has no Hoare annotation [2020-07-10 15:30:20,629 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:30:20,630 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:30:20,630 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:30:20,630 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:30:20,630 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:30:20,630 WARN L170 areAnnotationChecker]: L89-1 has no Hoare annotation [2020-07-10 15:30:20,630 WARN L170 areAnnotationChecker]: L96-1 has no Hoare annotation [2020-07-10 15:30:20,631 WARN L170 areAnnotationChecker]: tree_inorderEXIT has no Hoare annotation [2020-07-10 15:30:20,631 WARN L170 areAnnotationChecker]: tree_inorderEXIT has no Hoare annotation [2020-07-10 15:30:20,631 WARN L170 areAnnotationChecker]: tree_inorderEXIT has no Hoare annotation [2020-07-10 15:30:20,631 WARN L170 areAnnotationChecker]: tree_inorderEXIT has no Hoare annotation [2020-07-10 15:30:20,631 WARN L170 areAnnotationChecker]: L71-1 has no Hoare annotation [2020-07-10 15:30:20,631 WARN L170 areAnnotationChecker]: tree_delFINAL has no Hoare annotation [2020-07-10 15:30:20,632 WARN L170 areAnnotationChecker]: L57-3 has no Hoare annotation [2020-07-10 15:30:20,632 WARN L170 areAnnotationChecker]: L40-1 has no Hoare annotation [2020-07-10 15:30:20,632 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-10 15:30:20,632 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-10 15:30:20,632 WARN L170 areAnnotationChecker]: L87-1 has no Hoare annotation [2020-07-10 15:30:20,632 WARN L170 areAnnotationChecker]: L95-1 has no Hoare annotation [2020-07-10 15:30:20,633 WARN L170 areAnnotationChecker]: L80-3 has no Hoare annotation [2020-07-10 15:30:20,633 WARN L170 areAnnotationChecker]: L80-2 has no Hoare annotation [2020-07-10 15:30:20,633 WARN L170 areAnnotationChecker]: L80-2 has no Hoare annotation [2020-07-10 15:30:20,633 WARN L170 areAnnotationChecker]: L88-1 has no Hoare annotation [2020-07-10 15:30:20,633 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:30:20,633 WARN L170 areAnnotationChecker]: L91-1 has no Hoare annotation [2020-07-10 15:30:20,633 WARN L170 areAnnotationChecker]: L94-1 has no Hoare annotation [2020-07-10 15:30:20,634 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2020-07-10 15:30:20,634 WARN L170 areAnnotationChecker]: L102-1 has no Hoare annotation [2020-07-10 15:30:20,634 WARN L170 areAnnotationChecker]: L90 has no Hoare annotation [2020-07-10 15:30:20,634 WARN L170 areAnnotationChecker]: L90 has no Hoare annotation [2020-07-10 15:30:20,634 WARN L170 areAnnotationChecker]: L97 has no Hoare annotation [2020-07-10 15:30:20,634 WARN L170 areAnnotationChecker]: L97 has no Hoare annotation [2020-07-10 15:30:20,634 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2020-07-10 15:30:20,634 WARN L170 areAnnotationChecker]: L97-1 has no Hoare annotation [2020-07-10 15:30:20,635 WARN L170 areAnnotationChecker]: L73-1 has no Hoare annotation [2020-07-10 15:30:20,635 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2020-07-10 15:30:20,635 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2020-07-10 15:30:20,635 WARN L170 areAnnotationChecker]: tree_delEXIT has no Hoare annotation [2020-07-10 15:30:20,635 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-10 15:30:20,635 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-10 15:30:20,635 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2020-07-10 15:30:20,635 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2020-07-10 15:30:20,635 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2020-07-10 15:30:20,635 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2020-07-10 15:30:20,636 WARN L170 areAnnotationChecker]: L89 has no Hoare annotation [2020-07-10 15:30:20,636 WARN L170 areAnnotationChecker]: L89 has no Hoare annotation [2020-07-10 15:30:20,636 WARN L170 areAnnotationChecker]: L93 has no Hoare annotation [2020-07-10 15:30:20,636 WARN L170 areAnnotationChecker]: L93 has no Hoare annotation [2020-07-10 15:30:20,636 WARN L170 areAnnotationChecker]: L95 has no Hoare annotation [2020-07-10 15:30:20,636 WARN L170 areAnnotationChecker]: L95 has no Hoare annotation [2020-07-10 15:30:20,636 WARN L170 areAnnotationChecker]: L101-3 has no Hoare annotation [2020-07-10 15:30:20,636 WARN L170 areAnnotationChecker]: L101-3 has no Hoare annotation [2020-07-10 15:30:20,636 WARN L170 areAnnotationChecker]: L101-3 has no Hoare annotation [2020-07-10 15:30:20,637 WARN L170 areAnnotationChecker]: L101-2 has no Hoare annotation [2020-07-10 15:30:20,637 WARN L170 areAnnotationChecker]: L91 has no Hoare annotation [2020-07-10 15:30:20,637 WARN L170 areAnnotationChecker]: L91 has no Hoare annotation [2020-07-10 15:30:20,637 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2020-07-10 15:30:20,637 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2020-07-10 15:30:20,637 WARN L170 areAnnotationChecker]: L93-1 has no Hoare annotation [2020-07-10 15:30:20,637 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-10 15:30:20,637 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-10 15:30:20,637 WARN L170 areAnnotationChecker]: L101-4 has no Hoare annotation [2020-07-10 15:30:20,638 WARN L170 areAnnotationChecker]: L102 has no Hoare annotation [2020-07-10 15:30:20,638 WARN L170 areAnnotationChecker]: L102 has no Hoare annotation [2020-07-10 15:30:20,638 WARN L170 areAnnotationChecker]: L94 has no Hoare annotation [2020-07-10 15:30:20,638 WARN L170 areAnnotationChecker]: L94 has no Hoare annotation [2020-07-10 15:30:20,638 WARN L170 areAnnotationChecker]: taskFINAL has no Hoare annotation [2020-07-10 15:30:20,638 WARN L170 areAnnotationChecker]: taskEXIT has no Hoare annotation [2020-07-10 15:30:20,638 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:30:20,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:30:20 BoogieIcfgContainer [2020-07-10 15:30:20,641 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:30:20,645 INFO L168 Benchmark]: Toolchain (without parser) took 20663.23 ms. Allocated memory was 140.0 MB in the beginning and 440.4 MB in the end (delta: 300.4 MB). Free memory was 104.3 MB in the beginning and 370.0 MB in the end (delta: -265.7 MB). Peak memory consumption was 34.7 MB. Max. memory is 7.1 GB. [2020-07-10 15:30:20,645 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 140.0 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-07-10 15:30:20,646 INFO L168 Benchmark]: CACSL2BoogieTranslator took 429.77 ms. Allocated memory was 140.0 MB in the beginning and 202.4 MB in the end (delta: 62.4 MB). Free memory was 104.1 MB in the beginning and 177.9 MB in the end (delta: -73.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. [2020-07-10 15:30:20,647 INFO L168 Benchmark]: Boogie Preprocessor took 73.01 ms. Allocated memory is still 202.4 MB. Free memory was 177.9 MB in the beginning and 174.7 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:30:20,647 INFO L168 Benchmark]: RCFGBuilder took 995.66 ms. Allocated memory is still 202.4 MB. Free memory was 174.7 MB in the beginning and 111.1 MB in the end (delta: 63.6 MB). Peak memory consumption was 63.6 MB. Max. memory is 7.1 GB. [2020-07-10 15:30:20,648 INFO L168 Benchmark]: TraceAbstraction took 19157.48 ms. Allocated memory was 202.4 MB in the beginning and 440.4 MB in the end (delta: 238.0 MB). Free memory was 111.1 MB in the beginning and 370.0 MB in the end (delta: -258.9 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 15:30:20,652 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 140.0 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 429.77 ms. Allocated memory was 140.0 MB in the beginning and 202.4 MB in the end (delta: 62.4 MB). Free memory was 104.1 MB in the beginning and 177.9 MB in the end (delta: -73.8 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 73.01 ms. Allocated memory is still 202.4 MB. Free memory was 177.9 MB in the beginning and 174.7 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 995.66 ms. Allocated memory is still 202.4 MB. Free memory was 174.7 MB in the beginning and 111.1 MB in the end (delta: 63.6 MB). Peak memory consumption was 63.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19157.48 ms. Allocated memory was 202.4 MB in the beginning and 440.4 MB in the end (delta: 238.0 MB). Free memory was 111.1 MB in the beginning and 370.0 MB in the end (delta: -258.9 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 14]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L108] CALL, EXPR nondet_tree() [L23] COND FALSE !(__VERIFIER_nondet_bool()) [L26] struct node *n = (struct node *)malloc(sizeof(struct node)); [L27] n->data = __VERIFIER_nondet_int() [L28] CALL, EXPR nondet_tree() [L23] COND TRUE __VERIFIER_nondet_bool() [L24] return 0; VAL [\result={0:0}] [L28] RET, EXPR nondet_tree() VAL [malloc(sizeof(struct node))={-1:0}, n={-1:0}, nondet_tree()={0:0}] [L28] n->left = nondet_tree() [L29] CALL, EXPR nondet_tree() [L23] COND TRUE __VERIFIER_nondet_bool() [L24] return 0; VAL [\result={0:0}] [L29] RET, EXPR nondet_tree() VAL [malloc(sizeof(struct node))={-1:0}, n={-1:0}, nondet_tree()={0:0}] [L29] n->right = nondet_tree() [L30] return n; VAL [\result={-1:0}, malloc(sizeof(struct node))={-1:0}, n={-1:0}] [L108] RET, EXPR nondet_tree() VAL [nondet_tree()={-1:0}] [L108] CALL task(nondet_tree()) VAL [t={-1:0}] [L84] CALL, EXPR min(t) VAL [n={-1:0}] [L35] COND FALSE !(!n) [L38] EXPR n->data [L38] int a = n->data; [L39] EXPR n->left VAL [a=2147483647, n={-1:0}, n={-1:0}, n->left={0:0}] [L39] CALL, EXPR min(n->left) VAL [n={0:0}] [L35] COND TRUE !n [L36] return 2147483647; VAL [\result=2147483647, n={0:0}, n={0:0}] [L39] RET, EXPR min(n->left) VAL [a=2147483647, min(n->left)=2147483647, n={-1:0}, n={-1:0}, n->left={0:0}] [L39] int b = min(n->left); [L40] EXPR n->right VAL [a=2147483647, b=2147483647, n={-1:0}, n={-1:0}, n->right={0:0}] [L40] CALL, EXPR min(n->right) VAL [n={0:0}] [L35] COND TRUE !n [L36] return 2147483647; VAL [\result=2147483647, n={0:0}, n={0:0}] [L40] RET, EXPR min(n->right) VAL [a=2147483647, b=2147483647, min(n->right)=2147483647, n={-1:0}, n={-1:0}, n->right={0:0}] [L40] int c = min(n->right); [L41] COND TRUE b <= a && b <= c [L41] return b; VAL [\result=2147483647, a=2147483647, b=2147483647, c=2147483647, n={-1:0}, n={-1:0}] [L84] RET, EXPR min(t) VAL [min(t)=2147483647, t={-1:0}, t={-1:0}] [L84] int a = min(t); [L85] int b; VAL [a=2147483647, b={2:0}, t={-1:0}, t={-1:0}] [L87] CALL, EXPR size(t) VAL [t={-1:0}] [L79] COND FALSE !(!t) [L80] EXPR t->left VAL [t={-1:0}, t={-1:0}, t->left={0:0}] [L80] CALL, EXPR size(t->left) VAL [t={0:0}] [L79] COND TRUE !t [L79] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L80] RET, EXPR size(t->left) VAL [size(t->left)=0, t={-1:0}, t={-1:0}, t->left={0:0}] [L80] EXPR t->right VAL [size(t->left)=0, t={-1:0}, t={-1:0}, t->left={0:0}, t->right={0:0}] [L80] CALL, EXPR size(t->right) VAL [t={0:0}] [L79] COND TRUE !t [L79] return 0; VAL [\result=0, t={0:0}, t={0:0}] [L80] RET, EXPR size(t->right) VAL [size(t->left)=0, size(t->right)=0, t={-1:0}, t={-1:0}, t->left={0:0}, t->right={0:0}] [L80] return size(t->left) + size(t->right) + 1; [L87] RET, EXPR size(t) VAL [a=2147483647, b={2:0}, size(t)=1, t={-1:0}, t={-1:0}] [L87] int n = size(t); [L88] CALL assume_cycle_if_not(n != 0) VAL [\old(cond)=1] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L88] RET assume_cycle_if_not(n != 0) VAL [a=2147483647, b={2:0}, n=1, t={-1:0}, t={-1:0}] [L89] EXPR, FCALL calloc(n, sizeof(int)) VAL [a=2147483647, b={2:0}, calloc(n, sizeof(int))={-2:0}, n=1, t={-1:0}, t={-1:0}] [L89] int *x = calloc(n, sizeof(int)); VAL [a=2147483647, b={2:0}, calloc(n, sizeof(int))={-2:0}, n=1, t={-1:0}, t={-1:0}, x={-2:0}] [L90] CALL tree_inorder(t, x, n) VAL [\old(i)=1, a={-2:0}, t={-1:0}] [L68] COND FALSE !(!t) [L71] EXPR t->left VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=1, t={-1:0}, t={-1:0}, t->left={0:0}] [L71] CALL, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-2:0}, t={0:0}] [L68] COND TRUE !t [L69] return i; VAL [\old(i)=1, \result=1, a={-2:0}, a={-2:0}, i=1, t={0:0}, t={0:0}] [L71] RET, EXPR tree_inorder(t->left, a, i) VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=1, t={-1:0}, t={-1:0}, t->left={0:0}, tree_inorder(t->left, a, i)=1] [L71] i = tree_inorder(t->left, a, i) [L72] EXPR i++ [L72] EXPR t->data [L72] a[i++] = t->data [L73] EXPR t->right VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=2, t={-1:0}, t={-1:0}, t->right={0:0}] [L73] CALL, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=2, a={-2:0}, t={0:0}] [L68] COND TRUE !t [L69] return i; VAL [\old(i)=2, \result=2, a={-2:0}, a={-2:0}, i=2, t={0:0}, t={0:0}] [L73] RET, EXPR tree_inorder(t->right, a, i) VAL [\old(i)=1, a={-2:0}, a={-2:0}, i=2, t={-1:0}, t={-1:0}, t->right={0:0}, tree_inorder(t->right, a, i)=2] [L73] i = tree_inorder(t->right, a, i) [L74] return i; VAL [\old(i)=1, \result=2, a={-2:0}, a={-2:0}, i=2, t={-1:0}, t={-1:0}] [L90] RET tree_inorder(t, x, n) VAL [a=2147483647, b={2:0}, calloc(n, sizeof(int))={-2:0}, n=1, t={-1:0}, t={-1:0}, tree_inorder(t, x, n)=2, x={-2:0}] [L91] EXPR x[0] VAL [a=2147483647, b={2:0}, calloc(n, sizeof(int))={-2:0}, n=1, t={-1:0}, t={-1:0}, x={-2:0}, x[0]=0] [L91] CALL __VERIFIER_assert(a == x[0]) VAL [\old(cond)=0] [L14] COND TRUE !cond VAL [\old(cond)=0, cond=0] [L14] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 12 procedures, 98 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 18.9s, OverallIterations: 5, TraceHistogramMax: 3, AutomataDifference: 14.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 344 SDtfs, 500 SDslu, 1526 SDs, 0 SdLazy, 2229 SolverSat, 463 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 284 GetRequests, 200 SyntacticMatches, 4 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 4 MinimizatonAttempts, 17 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 471 NumberOfCodeBlocks, 471 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 374 ConstructedInterpolants, 0 QuantifiedInterpolants, 72712 SizeOfPredicates, 14 NumberOfNonLiveVariables, 633 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 103/111 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...