/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_max_incorrect.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:23:35,604 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:23:35,607 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:23:35,623 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:23:35,624 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:23:35,625 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:23:35,626 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:23:35,628 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:23:35,629 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:23:35,630 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:23:35,631 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:23:35,632 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:23:35,633 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:23:35,634 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:23:35,635 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:23:35,636 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:23:35,637 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:23:35,638 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:23:35,639 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:23:35,641 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:23:35,642 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:23:35,644 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:23:35,645 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:23:35,645 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:23:35,648 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:23:35,648 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:23:35,648 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:23:35,649 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:23:35,650 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:23:35,651 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:23:35,651 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:23:35,652 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:23:35,652 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:23:35,653 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:23:35,654 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:23:35,654 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:23:35,655 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:23:35,655 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:23:35,655 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:23:35,656 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:23:35,657 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:23:35,658 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-17 22:23:35,672 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:23:35,672 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:23:35,673 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:23:35,674 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:23:35,674 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:23:35,674 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:23:35,674 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:23:35,674 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:23:35,675 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:23:35,675 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:23:35,675 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:23:35,675 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:23:35,675 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:23:35,676 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:23:35,676 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:23:35,676 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:23:35,676 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:23:35,676 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:23:35,677 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:23:35,677 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:23:35,677 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:23:35,677 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:23:35,677 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:23:35,678 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:23:35,678 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:23:35,678 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:23:35,678 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:23:35,678 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:23:35,679 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:23:35,679 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:23:35,960 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:23:35,975 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:23:35,979 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:23:35,980 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:23:35,981 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:23:35,982 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/tree_max_incorrect.c [2020-07-17 22:23:36,054 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f35ef1d7/a1afa0ce401a4a68a27a48daf9af93f4/FLAGc73076bbd [2020-07-17 22:23:36,542 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:23:36,542 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_max_incorrect.c [2020-07-17 22:23:36,549 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f35ef1d7/a1afa0ce401a4a68a27a48daf9af93f4/FLAGc73076bbd [2020-07-17 22:23:36,930 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f35ef1d7/a1afa0ce401a4a68a27a48daf9af93f4 [2020-07-17 22:23:36,939 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:23:36,942 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:23:36,943 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:23:36,943 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:23:36,947 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:23:36,948 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:23:36" (1/1) ... [2020-07-17 22:23:36,951 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5908eca5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:23:36, skipping insertion in model container [2020-07-17 22:23:36,951 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:23:36" (1/1) ... [2020-07-17 22:23:36,958 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:23:36,980 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:23:37,157 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:23:37,168 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:23:37,276 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:23:37,295 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:23:37,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:23:37 WrapperNode [2020-07-17 22:23:37,296 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:23:37,296 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:23:37,296 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:23:37,297 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:23:37,308 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:23:37" (1/1) ... [2020-07-17 22:23:37,309 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:23:37" (1/1) ... [2020-07-17 22:23:37,316 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:23:37" (1/1) ... [2020-07-17 22:23:37,317 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:23:37" (1/1) ... [2020-07-17 22:23:37,330 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:23:37" (1/1) ... [2020-07-17 22:23:37,333 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:23:37" (1/1) ... [2020-07-17 22:23:37,335 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:23:37" (1/1) ... [2020-07-17 22:23:37,337 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:23:37,338 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:23:37,338 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:23:37,338 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:23:37,339 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:23:37" (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-17 22:23:37,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:23:37,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:23:37,403 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-17 22:23:37,403 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2020-07-17 22:23:37,403 INFO L138 BoogieDeclarations]: Found implementation of procedure max [2020-07-17 22:23:37,403 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2020-07-17 22:23:37,403 INFO L138 BoogieDeclarations]: Found implementation of procedure task [2020-07-17 22:23:37,404 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:23:37,404 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-17 22:23:37,404 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-17 22:23:37,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:23:37,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2020-07-17 22:23:37,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:23:37,405 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-17 22:23:37,405 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2020-07-17 22:23:37,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-17 22:23:37,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-17 22:23:37,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-17 22:23:37,406 INFO L130 BoogieDeclarations]: Found specification of procedure max [2020-07-17 22:23:37,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-17 22:23:37,406 INFO L130 BoogieDeclarations]: Found specification of procedure check [2020-07-17 22:23:37,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-17 22:23:37,406 INFO L130 BoogieDeclarations]: Found specification of procedure task [2020-07-17 22:23:37,406 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:23:37,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:23:37,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:23:37,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-17 22:23:37,864 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:23:37,864 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-17 22:23:37,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:23:37 BoogieIcfgContainer [2020-07-17 22:23:37,868 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:23:37,869 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:23:37,870 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:23:37,872 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:23:37,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:23:36" (1/3) ... [2020-07-17 22:23:37,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32f72d64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:23:37, skipping insertion in model container [2020-07-17 22:23:37,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:23:37" (2/3) ... [2020-07-17 22:23:37,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32f72d64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:23:37, skipping insertion in model container [2020-07-17 22:23:37,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:23:37" (3/3) ... [2020-07-17 22:23:37,876 INFO L109 eAbstractionObserver]: Analyzing ICFG tree_max_incorrect.c [2020-07-17 22:23:37,886 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:23:37,894 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:23:37,907 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:23:37,928 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:23:37,928 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:23:37,928 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:23:37,929 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:23:37,929 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:23:37,929 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:23:37,929 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:23:37,929 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:23:37,946 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2020-07-17 22:23:37,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-17 22:23:37,953 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:23:37,954 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] [2020-07-17 22:23:37,954 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:23:37,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:23:37,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1628582097, now seen corresponding path program 1 times [2020-07-17 22:23:37,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:23:37,970 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342777772] [2020-07-17 22:23:37,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:23:38,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:38,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:38,373 INFO L280 TraceCheckUtils]: 0: Hoare triple {71#(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; {54#true} is VALID [2020-07-17 22:23:38,374 INFO L280 TraceCheckUtils]: 1: Hoare triple {54#true} assume true; {54#true} is VALID [2020-07-17 22:23:38,374 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {54#true} {54#true} #90#return; {54#true} is VALID [2020-07-17 22:23:38,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:38,479 INFO L280 TraceCheckUtils]: 0: Hoare triple {72#(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; {73#(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-17 22:23:38,480 INFO L280 TraceCheckUtils]: 1: Hoare triple {73#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} assume true; {73#(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-17 22:23:38,482 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {73#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} {54#true} #76#return; {62#(and (= |main_#t~ret15.offset| 0) (= 0 |main_#t~ret15.base|))} is VALID [2020-07-17 22:23:38,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:38,494 INFO L280 TraceCheckUtils]: 0: Hoare triple {54#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {54#true} is VALID [2020-07-17 22:23:38,494 INFO L280 TraceCheckUtils]: 1: Hoare triple {54#true} assume ~n.base == 0 && ~n.offset == 0;#res := -2147483648; {54#true} is VALID [2020-07-17 22:23:38,495 INFO L280 TraceCheckUtils]: 2: Hoare triple {54#true} assume true; {54#true} is VALID [2020-07-17 22:23:38,496 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {54#true} {64#(and (= 0 task_~n.base) (= 0 task_~n.offset))} #86#return; {64#(and (= 0 task_~n.base) (= 0 task_~n.offset))} is VALID [2020-07-17 22:23:38,498 INFO L263 TraceCheckUtils]: 0: Hoare triple {54#true} call ULTIMATE.init(); {71#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:23:38,498 INFO L280 TraceCheckUtils]: 1: Hoare triple {71#(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; {54#true} is VALID [2020-07-17 22:23:38,499 INFO L280 TraceCheckUtils]: 2: Hoare triple {54#true} assume true; {54#true} is VALID [2020-07-17 22:23:38,499 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {54#true} {54#true} #90#return; {54#true} is VALID [2020-07-17 22:23:38,499 INFO L263 TraceCheckUtils]: 4: Hoare triple {54#true} call #t~ret16 := main(); {54#true} is VALID [2020-07-17 22:23:38,501 INFO L263 TraceCheckUtils]: 5: Hoare triple {54#true} call #t~ret15.base, #t~ret15.offset := nondet_tree(); {72#(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-17 22:23:38,503 INFO L280 TraceCheckUtils]: 6: Hoare triple {72#(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; {73#(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-17 22:23:38,504 INFO L280 TraceCheckUtils]: 7: Hoare triple {73#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} assume true; {73#(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-17 22:23:38,506 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {73#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} {54#true} #76#return; {62#(and (= |main_#t~ret15.offset| 0) (= 0 |main_#t~ret15.base|))} is VALID [2020-07-17 22:23:38,507 INFO L263 TraceCheckUtils]: 9: Hoare triple {62#(and (= |main_#t~ret15.offset| 0) (= 0 |main_#t~ret15.base|))} call task(#t~ret15.base, #t~ret15.offset); {63#(and (= 0 |task_#in~n.offset|) (= |task_#in~n.base| 0))} is VALID [2020-07-17 22:23:38,509 INFO L280 TraceCheckUtils]: 10: Hoare triple {63#(and (= 0 |task_#in~n.offset|) (= |task_#in~n.base| 0))} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {64#(and (= 0 task_~n.base) (= 0 task_~n.offset))} is VALID [2020-07-17 22:23:38,509 INFO L263 TraceCheckUtils]: 11: Hoare triple {64#(and (= 0 task_~n.base) (= 0 task_~n.offset))} call #t~ret14 := max(~n.base, ~n.offset); {54#true} is VALID [2020-07-17 22:23:38,509 INFO L280 TraceCheckUtils]: 12: Hoare triple {54#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {54#true} is VALID [2020-07-17 22:23:38,510 INFO L280 TraceCheckUtils]: 13: Hoare triple {54#true} assume ~n.base == 0 && ~n.offset == 0;#res := -2147483648; {54#true} is VALID [2020-07-17 22:23:38,510 INFO L280 TraceCheckUtils]: 14: Hoare triple {54#true} assume true; {54#true} is VALID [2020-07-17 22:23:38,515 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {54#true} {64#(and (= 0 task_~n.base) (= 0 task_~n.offset))} #86#return; {64#(and (= 0 task_~n.base) (= 0 task_~n.offset))} is VALID [2020-07-17 22:23:38,517 INFO L280 TraceCheckUtils]: 16: Hoare triple {64#(and (= 0 task_~n.base) (= 0 task_~n.offset))} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~a~1 := #t~ret14;havoc #t~ret14; {64#(and (= 0 task_~n.base) (= 0 task_~n.offset))} is VALID [2020-07-17 22:23:38,518 INFO L263 TraceCheckUtils]: 17: Hoare triple {64#(and (= 0 task_~n.base) (= 0 task_~n.offset))} call check(~n.base, ~n.offset, ~a~1); {69#(and (= 0 |check_#in~n.offset|) (= 0 |check_#in~n.base|))} is VALID [2020-07-17 22:23:38,519 INFO L280 TraceCheckUtils]: 18: Hoare triple {69#(and (= 0 |check_#in~n.offset|) (= 0 |check_#in~n.base|))} ~n.base, ~n.offset := #in~n.base, #in~n.offset;~a := #in~a; {70#(and (= 0 check_~n.offset) (= 0 check_~n.base))} is VALID [2020-07-17 22:23:38,521 INFO L280 TraceCheckUtils]: 19: Hoare triple {70#(and (= 0 check_~n.offset) (= 0 check_~n.base))} assume ~n.base != 0 || ~n.offset != 0;call #t~mem10 := read~int(~n.base, ~n.offset, 4); {55#false} is VALID [2020-07-17 22:23:38,521 INFO L263 TraceCheckUtils]: 20: Hoare triple {55#false} call __VERIFIER_assert((if #t~mem10 <= ~a then 1 else 0)); {55#false} is VALID [2020-07-17 22:23:38,521 INFO L280 TraceCheckUtils]: 21: Hoare triple {55#false} ~cond := #in~cond; {55#false} is VALID [2020-07-17 22:23:38,522 INFO L280 TraceCheckUtils]: 22: Hoare triple {55#false} assume 0 == ~cond; {55#false} is VALID [2020-07-17 22:23:38,522 INFO L280 TraceCheckUtils]: 23: Hoare triple {55#false} assume !false; {55#false} is VALID [2020-07-17 22:23:38,527 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-17 22:23:38,528 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342777772] [2020-07-17 22:23:38,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:23:38,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-17 22:23:38,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456307510] [2020-07-17 22:23:38,537 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-07-17 22:23:38,539 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:23:38,543 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-17 22:23:38,585 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:23:38,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-17 22:23:38,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:23:38,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-17 22:23:38,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-07-17 22:23:38,598 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 10 states. [2020-07-17 22:23:40,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:23:40,611 INFO L93 Difference]: Finished difference Result 93 states and 119 transitions. [2020-07-17 22:23:40,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-17 22:23:40,612 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-07-17 22:23:40,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:23:40,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:23:40,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 119 transitions. [2020-07-17 22:23:40,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:23:40,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 119 transitions. [2020-07-17 22:23:40,639 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 119 transitions. [2020-07-17 22:23:40,880 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:23:40,893 INFO L225 Difference]: With dead ends: 93 [2020-07-17 22:23:40,893 INFO L226 Difference]: Without dead ends: 42 [2020-07-17 22:23:40,897 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-07-17 22:23:40,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-17 22:23:40,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-07-17 22:23:40,981 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:23:40,982 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 42 states. [2020-07-17 22:23:40,982 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2020-07-17 22:23:40,982 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2020-07-17 22:23:40,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:23:40,990 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2020-07-17 22:23:40,990 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2020-07-17 22:23:40,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:23:40,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:23:40,992 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2020-07-17 22:23:40,992 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2020-07-17 22:23:40,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:23:40,999 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2020-07-17 22:23:41,000 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2020-07-17 22:23:41,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:23:41,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:23:41,001 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:23:41,002 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:23:41,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-17 22:23:41,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2020-07-17 22:23:41,008 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 24 [2020-07-17 22:23:41,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:23:41,008 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2020-07-17 22:23:41,008 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-17 22:23:41,008 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2020-07-17 22:23:41,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-17 22:23:41,010 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:23:41,011 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-07-17 22:23:41,012 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:23:41,012 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:23:41,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:23:41,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1712930862, now seen corresponding path program 1 times [2020-07-17 22:23:41,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:23:41,013 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367253740] [2020-07-17 22:23:41,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:23:41,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:41,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:41,150 INFO L280 TraceCheckUtils]: 0: Hoare triple {385#(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; {360#true} is VALID [2020-07-17 22:23:41,150 INFO L280 TraceCheckUtils]: 1: Hoare triple {360#true} assume true; {360#true} is VALID [2020-07-17 22:23:41,150 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {360#true} {360#true} #90#return; {360#true} is VALID [2020-07-17 22:23:41,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:41,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:41,266 INFO L280 TraceCheckUtils]: 0: Hoare triple {386#(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; {360#true} is VALID [2020-07-17 22:23:41,266 INFO L280 TraceCheckUtils]: 1: Hoare triple {360#true} assume true; {360#true} is VALID [2020-07-17 22:23:41,267 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {360#true} {387#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} #68#return; {387#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-17 22:23:41,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:41,276 INFO L280 TraceCheckUtils]: 0: Hoare triple {386#(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; {360#true} is VALID [2020-07-17 22:23:41,277 INFO L280 TraceCheckUtils]: 1: Hoare triple {360#true} assume true; {360#true} is VALID [2020-07-17 22:23:41,278 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {360#true} {387#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} #70#return; {387#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-17 22:23:41,280 INFO L280 TraceCheckUtils]: 0: Hoare triple {386#(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; {387#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-17 22:23:41,281 INFO L263 TraceCheckUtils]: 1: Hoare triple {387#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} call #t~ret4.base, #t~ret4.offset := nondet_tree(); {386#(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-17 22:23:41,281 INFO L280 TraceCheckUtils]: 2: Hoare triple {386#(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; {360#true} is VALID [2020-07-17 22:23:41,282 INFO L280 TraceCheckUtils]: 3: Hoare triple {360#true} assume true; {360#true} is VALID [2020-07-17 22:23:41,283 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {360#true} {387#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} #68#return; {387#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-17 22:23:41,283 INFO L280 TraceCheckUtils]: 5: Hoare triple {387#(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; {387#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-17 22:23:41,284 INFO L263 TraceCheckUtils]: 6: Hoare triple {387#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} call #t~ret5.base, #t~ret5.offset := nondet_tree(); {386#(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-17 22:23:41,285 INFO L280 TraceCheckUtils]: 7: Hoare triple {386#(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; {360#true} is VALID [2020-07-17 22:23:41,285 INFO L280 TraceCheckUtils]: 8: Hoare triple {360#true} assume true; {360#true} is VALID [2020-07-17 22:23:41,286 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {360#true} {387#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} #70#return; {387#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-17 22:23:41,287 INFO L280 TraceCheckUtils]: 10: Hoare triple {387#(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; {394#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} is VALID [2020-07-17 22:23:41,288 INFO L280 TraceCheckUtils]: 11: Hoare triple {394#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} assume true; {394#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} is VALID [2020-07-17 22:23:41,288 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {394#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} {360#true} #76#return; {378#(not (= 0 |main_#t~ret15.base|))} is VALID [2020-07-17 22:23:41,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:23:41,337 INFO L280 TraceCheckUtils]: 0: Hoare triple {360#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {395#(= max_~n.base |max_#in~n.base|)} is VALID [2020-07-17 22:23:41,338 INFO L280 TraceCheckUtils]: 1: Hoare triple {395#(= max_~n.base |max_#in~n.base|)} assume ~n.base == 0 && ~n.offset == 0;#res := -2147483648; {396#(= 0 |max_#in~n.base|)} is VALID [2020-07-17 22:23:41,338 INFO L280 TraceCheckUtils]: 2: Hoare triple {396#(= 0 |max_#in~n.base|)} assume true; {396#(= 0 |max_#in~n.base|)} is VALID [2020-07-17 22:23:41,340 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {396#(= 0 |max_#in~n.base|)} {380#(not (= 0 task_~n.base))} #86#return; {361#false} is VALID [2020-07-17 22:23:41,341 INFO L263 TraceCheckUtils]: 0: Hoare triple {360#true} call ULTIMATE.init(); {385#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:23:41,341 INFO L280 TraceCheckUtils]: 1: Hoare triple {385#(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; {360#true} is VALID [2020-07-17 22:23:41,341 INFO L280 TraceCheckUtils]: 2: Hoare triple {360#true} assume true; {360#true} is VALID [2020-07-17 22:23:41,342 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {360#true} {360#true} #90#return; {360#true} is VALID [2020-07-17 22:23:41,342 INFO L263 TraceCheckUtils]: 4: Hoare triple {360#true} call #t~ret16 := main(); {360#true} is VALID [2020-07-17 22:23:41,343 INFO L263 TraceCheckUtils]: 5: Hoare triple {360#true} call #t~ret15.base, #t~ret15.offset := nondet_tree(); {386#(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-17 22:23:41,348 INFO L280 TraceCheckUtils]: 6: Hoare triple {386#(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; {387#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-17 22:23:41,349 INFO L263 TraceCheckUtils]: 7: Hoare triple {387#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} call #t~ret4.base, #t~ret4.offset := nondet_tree(); {386#(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-17 22:23:41,349 INFO L280 TraceCheckUtils]: 8: Hoare triple {386#(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; {360#true} is VALID [2020-07-17 22:23:41,349 INFO L280 TraceCheckUtils]: 9: Hoare triple {360#true} assume true; {360#true} is VALID [2020-07-17 22:23:41,350 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {360#true} {387#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} #68#return; {387#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-17 22:23:41,350 INFO L280 TraceCheckUtils]: 11: Hoare triple {387#(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; {387#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-17 22:23:41,352 INFO L263 TraceCheckUtils]: 12: Hoare triple {387#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} call #t~ret5.base, #t~ret5.offset := nondet_tree(); {386#(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-17 22:23:41,353 INFO L280 TraceCheckUtils]: 13: Hoare triple {386#(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; {360#true} is VALID [2020-07-17 22:23:41,353 INFO L280 TraceCheckUtils]: 14: Hoare triple {360#true} assume true; {360#true} is VALID [2020-07-17 22:23:41,355 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {360#true} {387#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} #70#return; {387#(or (<= (+ nondet_tree_~n~0.base 1) 0) (<= 1 nondet_tree_~n~0.base))} is VALID [2020-07-17 22:23:41,357 INFO L280 TraceCheckUtils]: 16: Hoare triple {387#(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; {394#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} is VALID [2020-07-17 22:23:41,358 INFO L280 TraceCheckUtils]: 17: Hoare triple {394#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} assume true; {394#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} is VALID [2020-07-17 22:23:41,358 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {394#(or (<= (+ |nondet_tree_#res.base| 1) 0) (<= 1 |nondet_tree_#res.base|))} {360#true} #76#return; {378#(not (= 0 |main_#t~ret15.base|))} is VALID [2020-07-17 22:23:41,359 INFO L263 TraceCheckUtils]: 19: Hoare triple {378#(not (= 0 |main_#t~ret15.base|))} call task(#t~ret15.base, #t~ret15.offset); {379#(not (= |task_#in~n.base| 0))} is VALID [2020-07-17 22:23:41,359 INFO L280 TraceCheckUtils]: 20: Hoare triple {379#(not (= |task_#in~n.base| 0))} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {380#(not (= 0 task_~n.base))} is VALID [2020-07-17 22:23:41,360 INFO L263 TraceCheckUtils]: 21: Hoare triple {380#(not (= 0 task_~n.base))} call #t~ret14 := max(~n.base, ~n.offset); {360#true} is VALID [2020-07-17 22:23:41,360 INFO L280 TraceCheckUtils]: 22: Hoare triple {360#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {395#(= max_~n.base |max_#in~n.base|)} is VALID [2020-07-17 22:23:41,361 INFO L280 TraceCheckUtils]: 23: Hoare triple {395#(= max_~n.base |max_#in~n.base|)} assume ~n.base == 0 && ~n.offset == 0;#res := -2147483648; {396#(= 0 |max_#in~n.base|)} is VALID [2020-07-17 22:23:41,361 INFO L280 TraceCheckUtils]: 24: Hoare triple {396#(= 0 |max_#in~n.base|)} assume true; {396#(= 0 |max_#in~n.base|)} is VALID [2020-07-17 22:23:41,362 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {396#(= 0 |max_#in~n.base|)} {380#(not (= 0 task_~n.base))} #86#return; {361#false} is VALID [2020-07-17 22:23:41,363 INFO L280 TraceCheckUtils]: 26: Hoare triple {361#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647;~a~1 := #t~ret14;havoc #t~ret14; {361#false} is VALID [2020-07-17 22:23:41,363 INFO L263 TraceCheckUtils]: 27: Hoare triple {361#false} call check(~n.base, ~n.offset, ~a~1); {361#false} is VALID [2020-07-17 22:23:41,364 INFO L280 TraceCheckUtils]: 28: Hoare triple {361#false} ~n.base, ~n.offset := #in~n.base, #in~n.offset;~a := #in~a; {361#false} is VALID [2020-07-17 22:23:41,364 INFO L280 TraceCheckUtils]: 29: Hoare triple {361#false} assume ~n.base != 0 || ~n.offset != 0;call #t~mem10 := read~int(~n.base, ~n.offset, 4); {361#false} is VALID [2020-07-17 22:23:41,364 INFO L263 TraceCheckUtils]: 30: Hoare triple {361#false} call __VERIFIER_assert((if #t~mem10 <= ~a then 1 else 0)); {361#false} is VALID [2020-07-17 22:23:41,365 INFO L280 TraceCheckUtils]: 31: Hoare triple {361#false} ~cond := #in~cond; {361#false} is VALID [2020-07-17 22:23:41,365 INFO L280 TraceCheckUtils]: 32: Hoare triple {361#false} assume 0 == ~cond; {361#false} is VALID [2020-07-17 22:23:41,366 INFO L280 TraceCheckUtils]: 33: Hoare triple {361#false} assume !false; {361#false} is VALID [2020-07-17 22:23:41,369 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-17 22:23:41,369 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367253740] [2020-07-17 22:23:41,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:23:41,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-17 22:23:41,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90231734] [2020-07-17 22:23:41,371 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2020-07-17 22:23:41,372 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:23:41,372 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-17 22:23:41,421 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:23:41,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-17 22:23:41,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:23:41,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-17 22:23:41,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2020-07-17 22:23:41,423 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand 11 states. [2020-07-17 22:23:42,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:23:42,765 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2020-07-17 22:23:42,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-17 22:23:42,765 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2020-07-17 22:23:42,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:23:42,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-17 22:23:42,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 71 transitions. [2020-07-17 22:23:42,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-17 22:23:42,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 71 transitions. [2020-07-17 22:23:42,774 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 71 transitions. [2020-07-17 22:23:42,879 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-17 22:23:42,883 INFO L225 Difference]: With dead ends: 59 [2020-07-17 22:23:42,883 INFO L226 Difference]: Without dead ends: 44 [2020-07-17 22:23:42,884 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2020-07-17 22:23:42,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-17 22:23:42,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-07-17 22:23:42,939 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:23:42,939 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2020-07-17 22:23:42,939 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2020-07-17 22:23:42,940 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2020-07-17 22:23:42,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:23:42,945 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2020-07-17 22:23:42,946 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2020-07-17 22:23:42,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:23:42,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:23:42,948 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2020-07-17 22:23:42,948 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2020-07-17 22:23:42,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:23:42,952 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2020-07-17 22:23:42,952 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2020-07-17 22:23:42,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:23:42,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:23:42,954 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:23:42,954 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:23:42,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-17 22:23:42,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2020-07-17 22:23:42,958 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 34 [2020-07-17 22:23:42,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:23:42,958 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2020-07-17 22:23:42,958 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-17 22:23:42,959 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2020-07-17 22:23:42,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-07-17 22:23:42,960 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:23:42,961 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] [2020-07-17 22:23:42,961 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:23:42,961 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:23:42,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:23:42,962 INFO L82 PathProgramCache]: Analyzing trace with hash 27177221, now seen corresponding path program 1 times [2020-07-17 22:23:42,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:23:42,962 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247604153] [2020-07-17 22:23:42,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:23:43,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:23:43,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:23:43,066 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-17 22:23:43,066 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-17 22:23:43,067 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 22:23:43,135 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-17 22:23:43,135 WARN L170 areAnnotationChecker]: taskENTRY has no Hoare annotation [2020-07-17 22:23:43,135 WARN L170 areAnnotationChecker]: nondet_treeENTRY has no Hoare annotation [2020-07-17 22:23:43,135 WARN L170 areAnnotationChecker]: nondet_treeENTRY has no Hoare annotation [2020-07-17 22:23:43,135 WARN L170 areAnnotationChecker]: maxENTRY has no Hoare annotation [2020-07-17 22:23:43,135 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:23:43,135 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:23:43,136 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-17 22:23:43,136 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-17 22:23:43,136 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-17 22:23:43,136 WARN L170 areAnnotationChecker]: checkENTRY has no Hoare annotation [2020-07-17 22:23:43,136 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:23:43,136 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2020-07-17 22:23:43,136 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2020-07-17 22:23:43,137 WARN L170 areAnnotationChecker]: nondet_treeFINAL has no Hoare annotation [2020-07-17 22:23:43,137 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-17 22:23:43,137 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-17 22:23:43,137 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-17 22:23:43,137 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-17 22:23:43,137 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:23:43,137 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:23:43,137 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2020-07-17 22:23:43,137 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2020-07-17 22:23:43,138 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-17 22:23:43,138 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-17 22:23:43,138 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-17 22:23:43,138 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-17 22:23:43,138 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:23:43,138 WARN L170 areAnnotationChecker]: L53-1 has no Hoare annotation [2020-07-17 22:23:43,138 WARN L170 areAnnotationChecker]: nondet_treeEXIT has no Hoare annotation [2020-07-17 22:23:43,138 WARN L170 areAnnotationChecker]: nondet_treeEXIT has no Hoare annotation [2020-07-17 22:23:43,139 WARN L170 areAnnotationChecker]: nondet_treeEXIT has no Hoare annotation [2020-07-17 22:23:43,139 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-17 22:23:43,139 WARN L170 areAnnotationChecker]: maxFINAL has no Hoare annotation [2020-07-17 22:23:43,139 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-17 22:23:43,139 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-17 22:23:43,139 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:23:43,139 WARN L170 areAnnotationChecker]: L58-1 has no Hoare annotation [2020-07-17 22:23:43,140 WARN L170 areAnnotationChecker]: L9-1 has no Hoare annotation [2020-07-17 22:23:43,140 WARN L170 areAnnotationChecker]: L9-1 has no Hoare annotation [2020-07-17 22:23:43,140 WARN L170 areAnnotationChecker]: L9-3 has no Hoare annotation [2020-07-17 22:23:43,140 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-17 22:23:43,140 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-17 22:23:43,140 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2020-07-17 22:23:43,140 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2020-07-17 22:23:43,141 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2020-07-17 22:23:43,141 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2020-07-17 22:23:43,141 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-17 22:23:43,141 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2020-07-17 22:23:43,141 WARN L170 areAnnotationChecker]: maxEXIT has no Hoare annotation [2020-07-17 22:23:43,141 WARN L170 areAnnotationChecker]: maxEXIT has no Hoare annotation [2020-07-17 22:23:43,141 WARN L170 areAnnotationChecker]: maxEXIT has no Hoare annotation [2020-07-17 22:23:43,142 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2020-07-17 22:23:43,142 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:23:43,142 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:23:43,142 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2020-07-17 22:23:43,142 WARN L170 areAnnotationChecker]: checkEXIT has no Hoare annotation [2020-07-17 22:23:43,142 WARN L170 areAnnotationChecker]: checkEXIT has no Hoare annotation [2020-07-17 22:23:43,142 WARN L170 areAnnotationChecker]: checkEXIT has no Hoare annotation [2020-07-17 22:23:43,143 WARN L170 areAnnotationChecker]: taskFINAL has no Hoare annotation [2020-07-17 22:23:43,143 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2020-07-17 22:23:43,143 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2020-07-17 22:23:43,143 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2020-07-17 22:23:43,143 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:23:43,143 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-17 22:23:43,143 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-17 22:23:43,143 WARN L170 areAnnotationChecker]: L45-1 has no Hoare annotation [2020-07-17 22:23:43,144 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2020-07-17 22:23:43,144 WARN L170 areAnnotationChecker]: taskEXIT has no Hoare annotation [2020-07-17 22:23:43,144 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-17 22:23:43,144 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2020-07-17 22:23:43,144 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2020-07-17 22:23:43,144 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2020-07-17 22:23:43,144 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-17 22:23:43,144 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-17 22:23:43,144 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-17 22:23:43,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:23:43 BoogieIcfgContainer [2020-07-17 22:23:43,150 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:23:43,156 INFO L168 Benchmark]: Toolchain (without parser) took 6212.16 ms. Allocated memory was 144.7 MB in the beginning and 307.8 MB in the end (delta: 163.1 MB). Free memory was 100.1 MB in the beginning and 256.9 MB in the end (delta: -156.8 MB). Peak memory consumption was 6.2 MB. Max. memory is 7.1 GB. [2020-07-17 22:23:43,157 INFO L168 Benchmark]: CDTParser took 1.36 ms. Allocated memory is still 144.7 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-17 22:23:43,159 INFO L168 Benchmark]: CACSL2BoogieTranslator took 352.64 ms. Allocated memory was 144.7 MB in the beginning and 201.3 MB in the end (delta: 56.6 MB). Free memory was 99.9 MB in the beginning and 179.0 MB in the end (delta: -79.1 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. [2020-07-17 22:23:43,159 INFO L168 Benchmark]: Boogie Preprocessor took 41.15 ms. Allocated memory is still 201.3 MB. Free memory was 179.0 MB in the beginning and 176.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-07-17 22:23:43,161 INFO L168 Benchmark]: RCFGBuilder took 530.45 ms. Allocated memory is still 201.3 MB. Free memory was 176.4 MB in the beginning and 145.4 MB in the end (delta: 31.0 MB). Peak memory consumption was 31.0 MB. Max. memory is 7.1 GB. [2020-07-17 22:23:43,163 INFO L168 Benchmark]: TraceAbstraction took 5280.83 ms. Allocated memory was 201.3 MB in the beginning and 307.8 MB in the end (delta: 106.4 MB). Free memory was 144.7 MB in the beginning and 256.9 MB in the end (delta: -112.2 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-17 22:23:43,175 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 1.36 ms. Allocated memory is still 144.7 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 352.64 ms. Allocated memory was 144.7 MB in the beginning and 201.3 MB in the end (delta: 56.6 MB). Free memory was 99.9 MB in the beginning and 179.0 MB in the end (delta: -79.1 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.15 ms. Allocated memory is still 201.3 MB. Free memory was 179.0 MB in the beginning and 176.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 530.45 ms. Allocated memory is still 201.3 MB. Free memory was 176.4 MB in the beginning and 145.4 MB in the end (delta: 31.0 MB). Peak memory consumption was 31.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5280.83 ms. Allocated memory was 201.3 MB in the beginning and 307.8 MB in the end (delta: 106.4 MB). Free memory was 144.7 MB in the beginning and 256.9 MB in the end (delta: -112.2 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 9]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L58] CALL, EXPR nondet_tree() [L18] COND FALSE !(__VERIFIER_nondet_bool()) [L21] struct node *n = (struct node *)malloc(sizeof(struct node)); [L22] n->data = __VERIFIER_nondet_int() [L23] CALL, EXPR nondet_tree() [L18] COND TRUE __VERIFIER_nondet_bool() [L19] return 0; VAL [\result={0:0}] [L23] RET, EXPR nondet_tree() VAL [malloc(sizeof(struct node))={-1:0}, n={-1:0}, nondet_tree()={0:0}] [L23] n->left = nondet_tree() [L24] CALL, EXPR nondet_tree() [L18] COND TRUE __VERIFIER_nondet_bool() [L19] return 0; VAL [\result={0:0}] [L24] RET, EXPR nondet_tree() VAL [malloc(sizeof(struct node))={-1:0}, n={-1:0}, nondet_tree()={0:0}] [L24] n->right = nondet_tree() [L25] return n; VAL [\result={-1:0}, malloc(sizeof(struct node))={-1:0}, n={-1:0}] [L58] RET, EXPR nondet_tree() VAL [nondet_tree()={-1:0}] [L58] CALL task(nondet_tree()) VAL [n={-1:0}] [L53] CALL, EXPR max(n) VAL [n={-1:0}] [L30] COND FALSE !(!n) [L33] EXPR n->left VAL [n={-1:0}, n={-1:0}, n->left={0:0}] [L33] CALL, EXPR max(n->left) VAL [n={0:0}] [L30] COND TRUE !n [L31] return -2147483648; VAL [\result=-2147483648, n={0:0}, n={0:0}] [L33] RET, EXPR max(n->left) VAL [max(n->left)=-2147483648, n={-1:0}, n={-1:0}, n->left={0:0}] [L33] int a = max(n->left); [L34] EXPR n->right VAL [a=-2147483648, n={-1:0}, n={-1:0}, n->right={0:0}] [L34] CALL, EXPR max(n->right) VAL [n={0:0}] [L30] COND TRUE !n [L31] return -2147483648; VAL [\result=-2147483648, n={0:0}, n={0:0}] [L34] RET, EXPR max(n->right) VAL [a=-2147483648, max(n->right)=-2147483648, n={-1:0}, n={-1:0}, n->right={0:0}] [L34] int b = max(n->right); [L35] COND TRUE a >= b [L35] return a; VAL [\result=-2147483648, a=-2147483648, b=-2147483648, n={-1:0}, n={-1:0}] [L53] RET, EXPR max(n) VAL [max(n)=-2147483648, n={-1:0}, n={-1:0}] [L53] int a = max(n); [L54] CALL check(n, a) VAL [\old(a)=-2147483648, n={-1:0}] [L41] COND TRUE \read(*n) [L42] EXPR n->data VAL [\old(a)=-2147483648, a=-2147483648, n={-1:0}, n={-1:0}, n->data=-2147483647] [L42] CALL __VERIFIER_assert(n->data <= a) VAL [\old(cond)=0] [L9] COND TRUE !cond VAL [\old(cond)=0, cond=0] [L9] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 5.1s, OverallIterations: 3, TraceHistogramMax: 3, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 79 SDtfs, 141 SDslu, 268 SDs, 0 SdLazy, 527 SolverSat, 103 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 105 NumberOfCodeBlocks, 105 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 56 ConstructedInterpolants, 0 QuantifiedInterpolants, 7549 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 9/9 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...