/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/verifythis/tree_max_incorrect.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 00:14:38,466 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 00:14:38,468 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 00:14:38,480 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 00:14:38,480 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 00:14:38,481 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 00:14:38,483 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 00:14:38,485 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 00:14:38,486 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 00:14:38,487 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 00:14:38,488 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 00:14:38,489 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 00:14:38,490 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 00:14:38,491 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 00:14:38,492 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 00:14:38,493 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 00:14:38,494 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 00:14:38,495 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 00:14:38,497 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 00:14:38,499 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 00:14:38,501 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 00:14:38,502 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 00:14:38,503 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 00:14:38,504 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 00:14:38,506 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 00:14:38,507 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 00:14:38,507 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 00:14:38,508 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 00:14:38,508 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 00:14:38,509 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 00:14:38,509 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 00:14:38,510 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 00:14:38,511 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 00:14:38,512 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 00:14:38,513 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 00:14:38,513 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 00:14:38,514 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 00:14:38,514 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 00:14:38,514 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 00:14:38,515 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 00:14:38,516 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 00:14:38,517 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 00:14:38,526 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 00:14:38,527 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 00:14:38,528 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 00:14:38,528 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 00:14:38,528 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 00:14:38,529 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 00:14:38,529 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 00:14:38,529 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 00:14:38,529 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 00:14:38,529 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 00:14:38,530 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 00:14:38,530 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 00:14:38,530 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 00:14:38,530 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 00:14:38,530 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 00:14:38,531 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 00:14:38,531 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 00:14:38,531 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 00:14:38,531 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:14:38,532 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 00:14:38,532 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 00:14:38,532 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 00:14:38,532 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-18 00:14:38,794 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 00:14:38,807 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 00:14:38,810 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 00:14:38,812 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 00:14:38,812 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 00:14:38,813 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-18 00:14:38,892 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b06c06bc/61ff6f17bc144038806162ee76f1e093/FLAGcd2d9b0ba [2020-07-18 00:14:39,386 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 00:14:39,387 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_max_incorrect.c [2020-07-18 00:14:39,395 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b06c06bc/61ff6f17bc144038806162ee76f1e093/FLAGcd2d9b0ba [2020-07-18 00:14:39,714 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b06c06bc/61ff6f17bc144038806162ee76f1e093 [2020-07-18 00:14:39,723 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 00:14:39,726 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 00:14:39,727 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 00:14:39,727 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 00:14:39,731 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 00:14:39,732 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:14:39" (1/1) ... [2020-07-18 00:14:39,735 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@172af72e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:39, skipping insertion in model container [2020-07-18 00:14:39,735 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:14:39" (1/1) ... [2020-07-18 00:14:39,742 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 00:14:39,763 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 00:14:39,961 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:14:39,973 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 00:14:39,999 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:14:40,020 INFO L208 MainTranslator]: Completed translation [2020-07-18 00:14:40,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:40 WrapperNode [2020-07-18 00:14:40,021 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 00:14:40,021 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 00:14:40,022 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 00:14:40,022 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 00:14:40,120 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:40" (1/1) ... [2020-07-18 00:14:40,121 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:40" (1/1) ... [2020-07-18 00:14:40,131 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:40" (1/1) ... [2020-07-18 00:14:40,132 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:40" (1/1) ... [2020-07-18 00:14:40,147 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:40" (1/1) ... [2020-07-18 00:14:40,150 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:40" (1/1) ... [2020-07-18 00:14:40,152 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:40" (1/1) ... [2020-07-18 00:14:40,155 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 00:14:40,155 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 00:14:40,155 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 00:14:40,156 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 00:14:40,157 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:40" (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-18 00:14:40,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 00:14:40,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 00:14:40,215 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-18 00:14:40,215 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2020-07-18 00:14:40,215 INFO L138 BoogieDeclarations]: Found implementation of procedure max [2020-07-18 00:14:40,215 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2020-07-18 00:14:40,215 INFO L138 BoogieDeclarations]: Found implementation of procedure task [2020-07-18 00:14:40,216 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 00:14:40,216 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-18 00:14:40,216 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-18 00:14:40,216 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 00:14:40,216 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2020-07-18 00:14:40,216 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 00:14:40,216 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-18 00:14:40,216 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2020-07-18 00:14:40,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-18 00:14:40,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-18 00:14:40,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-18 00:14:40,218 INFO L130 BoogieDeclarations]: Found specification of procedure max [2020-07-18 00:14:40,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-18 00:14:40,218 INFO L130 BoogieDeclarations]: Found specification of procedure check [2020-07-18 00:14:40,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-18 00:14:40,219 INFO L130 BoogieDeclarations]: Found specification of procedure task [2020-07-18 00:14:40,219 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 00:14:40,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 00:14:40,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 00:14:40,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-18 00:14:40,778 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 00:14:40,779 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-18 00:14:40,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:14:40 BoogieIcfgContainer [2020-07-18 00:14:40,784 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 00:14:40,786 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 00:14:40,786 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 00:14:40,790 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 00:14:40,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 12:14:39" (1/3) ... [2020-07-18 00:14:40,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1398fa76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:14:40, skipping insertion in model container [2020-07-18 00:14:40,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:14:40" (2/3) ... [2020-07-18 00:14:40,792 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1398fa76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:14:40, skipping insertion in model container [2020-07-18 00:14:40,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:14:40" (3/3) ... [2020-07-18 00:14:40,794 INFO L109 eAbstractionObserver]: Analyzing ICFG tree_max_incorrect.c [2020-07-18 00:14:40,806 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 00:14:40,814 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 00:14:40,829 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 00:14:40,853 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 00:14:40,854 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 00:14:40,854 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-18 00:14:40,854 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 00:14:40,854 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 00:14:40,855 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 00:14:40,855 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 00:14:40,855 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 00:14:40,874 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states. [2020-07-18 00:14:40,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-18 00:14:40,888 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:14:40,889 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] [2020-07-18 00:14:40,890 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:14:40,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:14:40,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1509507830, now seen corresponding path program 1 times [2020-07-18 00:14:40,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:14:40,908 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [997558949] [2020-07-18 00:14:40,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:14:41,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:41,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:41,322 INFO L280 TraceCheckUtils]: 0: Hoare triple {108#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {86#true} is VALID [2020-07-18 00:14:41,323 INFO L280 TraceCheckUtils]: 1: Hoare triple {86#true} #valid := #valid[0 := 0]; {86#true} is VALID [2020-07-18 00:14:41,323 INFO L280 TraceCheckUtils]: 2: Hoare triple {86#true} assume 0 < #StackHeapBarrier; {86#true} is VALID [2020-07-18 00:14:41,324 INFO L280 TraceCheckUtils]: 3: Hoare triple {86#true} assume true; {86#true} is VALID [2020-07-18 00:14:41,325 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {86#true} {86#true} #122#return; {86#true} is VALID [2020-07-18 00:14:41,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:41,464 INFO L280 TraceCheckUtils]: 0: Hoare triple {109#(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; {86#true} is VALID [2020-07-18 00:14:41,465 INFO L280 TraceCheckUtils]: 1: Hoare triple {86#true} havoc #t~nondet1; {86#true} is VALID [2020-07-18 00:14:41,467 INFO L280 TraceCheckUtils]: 2: Hoare triple {86#true} #res.base, #res.offset := 0, 0; {110#(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-18 00:14:41,468 INFO L280 TraceCheckUtils]: 3: Hoare triple {110#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} assume true; {110#(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-18 00:14:41,470 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {110#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} {86#true} #108#return; {98#(and (= |main_#t~ret15.offset| 0) (= 0 |main_#t~ret15.base|))} is VALID [2020-07-18 00:14:41,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:41,483 INFO L280 TraceCheckUtils]: 0: Hoare triple {86#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {86#true} is VALID [2020-07-18 00:14:41,484 INFO L280 TraceCheckUtils]: 1: Hoare triple {86#true} assume ~n.base == 0 && ~n.offset == 0; {86#true} is VALID [2020-07-18 00:14:41,484 INFO L280 TraceCheckUtils]: 2: Hoare triple {86#true} #res := -2147483648; {86#true} is VALID [2020-07-18 00:14:41,485 INFO L280 TraceCheckUtils]: 3: Hoare triple {86#true} assume true; {86#true} is VALID [2020-07-18 00:14:41,487 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {86#true} {100#(and (= 0 task_~n.base) (= 0 task_~n.offset))} #118#return; {100#(and (= 0 task_~n.base) (= 0 task_~n.offset))} is VALID [2020-07-18 00:14:41,489 INFO L263 TraceCheckUtils]: 0: Hoare triple {86#true} call ULTIMATE.init(); {108#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:14:41,490 INFO L280 TraceCheckUtils]: 1: Hoare triple {108#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {86#true} is VALID [2020-07-18 00:14:41,490 INFO L280 TraceCheckUtils]: 2: Hoare triple {86#true} #valid := #valid[0 := 0]; {86#true} is VALID [2020-07-18 00:14:41,491 INFO L280 TraceCheckUtils]: 3: Hoare triple {86#true} assume 0 < #StackHeapBarrier; {86#true} is VALID [2020-07-18 00:14:41,491 INFO L280 TraceCheckUtils]: 4: Hoare triple {86#true} assume true; {86#true} is VALID [2020-07-18 00:14:41,491 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {86#true} {86#true} #122#return; {86#true} is VALID [2020-07-18 00:14:41,492 INFO L263 TraceCheckUtils]: 6: Hoare triple {86#true} call #t~ret16 := main(); {86#true} is VALID [2020-07-18 00:14:41,493 INFO L263 TraceCheckUtils]: 7: Hoare triple {86#true} call #t~ret15.base, #t~ret15.offset := nondet_tree(); {109#(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-18 00:14:41,494 INFO L280 TraceCheckUtils]: 8: Hoare triple {109#(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; {86#true} is VALID [2020-07-18 00:14:41,494 INFO L280 TraceCheckUtils]: 9: Hoare triple {86#true} havoc #t~nondet1; {86#true} is VALID [2020-07-18 00:14:41,495 INFO L280 TraceCheckUtils]: 10: Hoare triple {86#true} #res.base, #res.offset := 0, 0; {110#(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-18 00:14:41,497 INFO L280 TraceCheckUtils]: 11: Hoare triple {110#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} assume true; {110#(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-18 00:14:41,500 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {110#(and (<= |nondet_tree_#res.base| 0) (<= 0 |nondet_tree_#res.offset|) (<= |nondet_tree_#res.offset| 0) (<= 0 |nondet_tree_#res.base|))} {86#true} #108#return; {98#(and (= |main_#t~ret15.offset| 0) (= 0 |main_#t~ret15.base|))} is VALID [2020-07-18 00:14:41,502 INFO L263 TraceCheckUtils]: 13: Hoare triple {98#(and (= |main_#t~ret15.offset| 0) (= 0 |main_#t~ret15.base|))} call task(#t~ret15.base, #t~ret15.offset); {99#(and (= 0 |task_#in~n.offset|) (= |task_#in~n.base| 0))} is VALID [2020-07-18 00:14:41,505 INFO L280 TraceCheckUtils]: 14: Hoare triple {99#(and (= 0 |task_#in~n.offset|) (= |task_#in~n.base| 0))} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {100#(and (= 0 task_~n.base) (= 0 task_~n.offset))} is VALID [2020-07-18 00:14:41,506 INFO L263 TraceCheckUtils]: 15: Hoare triple {100#(and (= 0 task_~n.base) (= 0 task_~n.offset))} call #t~ret14 := max(~n.base, ~n.offset); {86#true} is VALID [2020-07-18 00:14:41,506 INFO L280 TraceCheckUtils]: 16: Hoare triple {86#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {86#true} is VALID [2020-07-18 00:14:41,506 INFO L280 TraceCheckUtils]: 17: Hoare triple {86#true} assume ~n.base == 0 && ~n.offset == 0; {86#true} is VALID [2020-07-18 00:14:41,507 INFO L280 TraceCheckUtils]: 18: Hoare triple {86#true} #res := -2147483648; {86#true} is VALID [2020-07-18 00:14:41,507 INFO L280 TraceCheckUtils]: 19: Hoare triple {86#true} assume true; {86#true} is VALID [2020-07-18 00:14:41,509 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {86#true} {100#(and (= 0 task_~n.base) (= 0 task_~n.offset))} #118#return; {100#(and (= 0 task_~n.base) (= 0 task_~n.offset))} is VALID [2020-07-18 00:14:41,510 INFO L280 TraceCheckUtils]: 21: Hoare triple {100#(and (= 0 task_~n.base) (= 0 task_~n.offset))} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {100#(and (= 0 task_~n.base) (= 0 task_~n.offset))} is VALID [2020-07-18 00:14:41,511 INFO L280 TraceCheckUtils]: 22: Hoare triple {100#(and (= 0 task_~n.base) (= 0 task_~n.offset))} ~a~1 := #t~ret14; {100#(and (= 0 task_~n.base) (= 0 task_~n.offset))} is VALID [2020-07-18 00:14:41,512 INFO L280 TraceCheckUtils]: 23: Hoare triple {100#(and (= 0 task_~n.base) (= 0 task_~n.offset))} havoc #t~ret14; {100#(and (= 0 task_~n.base) (= 0 task_~n.offset))} is VALID [2020-07-18 00:14:41,514 INFO L263 TraceCheckUtils]: 24: Hoare triple {100#(and (= 0 task_~n.base) (= 0 task_~n.offset))} call check(~n.base, ~n.offset, ~a~1); {106#(and (= 0 |check_#in~n.offset|) (= 0 |check_#in~n.base|))} is VALID [2020-07-18 00:14:41,516 INFO L280 TraceCheckUtils]: 25: Hoare triple {106#(and (= 0 |check_#in~n.offset|) (= 0 |check_#in~n.base|))} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {107#(and (= 0 check_~n.offset) (= 0 check_~n.base))} is VALID [2020-07-18 00:14:41,517 INFO L280 TraceCheckUtils]: 26: Hoare triple {107#(and (= 0 check_~n.offset) (= 0 check_~n.base))} ~a := #in~a; {107#(and (= 0 check_~n.offset) (= 0 check_~n.base))} is VALID [2020-07-18 00:14:41,518 INFO L280 TraceCheckUtils]: 27: Hoare triple {107#(and (= 0 check_~n.offset) (= 0 check_~n.base))} assume ~n.base != 0 || ~n.offset != 0; {87#false} is VALID [2020-07-18 00:14:41,519 INFO L280 TraceCheckUtils]: 28: Hoare triple {87#false} SUMMARY for call #t~mem10 := read~int(~n.base, ~n.offset, 4); srcloc: L42 {87#false} is VALID [2020-07-18 00:14:41,519 INFO L263 TraceCheckUtils]: 29: Hoare triple {87#false} call __VERIFIER_assert((if #t~mem10 <= ~a then 1 else 0)); {87#false} is VALID [2020-07-18 00:14:41,519 INFO L280 TraceCheckUtils]: 30: Hoare triple {87#false} ~cond := #in~cond; {87#false} is VALID [2020-07-18 00:14:41,520 INFO L280 TraceCheckUtils]: 31: Hoare triple {87#false} assume 0 == ~cond; {87#false} is VALID [2020-07-18 00:14:41,520 INFO L280 TraceCheckUtils]: 32: Hoare triple {87#false} assume !false; {87#false} is VALID [2020-07-18 00:14:41,526 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-18 00:14:41,533 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:14:41,535 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [997558949] [2020-07-18 00:14:41,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:14:41,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-18 00:14:41,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811264782] [2020-07-18 00:14:41,546 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2020-07-18 00:14:41,549 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:14:41,553 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-18 00:14:41,630 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:14:41,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-18 00:14:41,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:14:41,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-18 00:14:41,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-07-18 00:14:41,645 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 10 states. [2020-07-18 00:14:44,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:44,673 INFO L93 Difference]: Finished difference Result 134 states and 160 transitions. [2020-07-18 00:14:44,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-18 00:14:44,673 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2020-07-18 00:14:44,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:14:44,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-18 00:14:44,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 160 transitions. [2020-07-18 00:14:44,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-18 00:14:44,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 160 transitions. [2020-07-18 00:14:44,704 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 160 transitions. [2020-07-18 00:14:44,975 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:14:45,010 INFO L225 Difference]: With dead ends: 134 [2020-07-18 00:14:45,010 INFO L226 Difference]: Without dead ends: 74 [2020-07-18 00:14:45,019 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-07-18 00:14:45,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-07-18 00:14:45,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-07-18 00:14:45,224 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:14:45,225 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 74 states. [2020-07-18 00:14:45,225 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 74 states. [2020-07-18 00:14:45,226 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 74 states. [2020-07-18 00:14:45,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:45,236 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2020-07-18 00:14:45,236 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2020-07-18 00:14:45,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:14:45,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:14:45,239 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 74 states. [2020-07-18 00:14:45,239 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 74 states. [2020-07-18 00:14:45,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:14:45,247 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2020-07-18 00:14:45,248 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2020-07-18 00:14:45,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:14:45,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:14:45,251 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:14:45,251 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:14:45,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-07-18 00:14:45,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2020-07-18 00:14:45,259 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 33 [2020-07-18 00:14:45,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:14:45,260 INFO L479 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2020-07-18 00:14:45,260 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-18 00:14:45,260 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 74 states and 83 transitions. [2020-07-18 00:14:45,399 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:14:45,399 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2020-07-18 00:14:45,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-18 00:14:45,403 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:14:45,403 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-07-18 00:14:45,403 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 00:14:45,403 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:14:45,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:14:45,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1181568947, now seen corresponding path program 1 times [2020-07-18 00:14:45,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:14:45,405 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1345472454] [2020-07-18 00:14:45,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:14:45,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:45,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:45,532 INFO L280 TraceCheckUtils]: 0: Hoare triple {735#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {694#true} is VALID [2020-07-18 00:14:45,533 INFO L280 TraceCheckUtils]: 1: Hoare triple {694#true} #valid := #valid[0 := 0]; {694#true} is VALID [2020-07-18 00:14:45,533 INFO L280 TraceCheckUtils]: 2: Hoare triple {694#true} assume 0 < #StackHeapBarrier; {694#true} is VALID [2020-07-18 00:14:45,533 INFO L280 TraceCheckUtils]: 3: Hoare triple {694#true} assume true; {694#true} is VALID [2020-07-18 00:14:45,534 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {694#true} {694#true} #122#return; {694#true} is VALID [2020-07-18 00:14:45,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:45,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:45,654 INFO L280 TraceCheckUtils]: 0: Hoare triple {736#(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; {694#true} is VALID [2020-07-18 00:14:45,655 INFO L280 TraceCheckUtils]: 1: Hoare triple {694#true} havoc #t~nondet1; {694#true} is VALID [2020-07-18 00:14:45,655 INFO L280 TraceCheckUtils]: 2: Hoare triple {694#true} #res.base, #res.offset := 0, 0; {694#true} is VALID [2020-07-18 00:14:45,655 INFO L280 TraceCheckUtils]: 3: Hoare triple {694#true} assume true; {694#true} is VALID [2020-07-18 00:14:45,656 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {694#true} {738#(not (= 0 nondet_tree_~n~0.base))} #100#return; {738#(not (= 0 nondet_tree_~n~0.base))} is VALID [2020-07-18 00:14:45,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:45,666 INFO L280 TraceCheckUtils]: 0: Hoare triple {736#(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; {694#true} is VALID [2020-07-18 00:14:45,667 INFO L280 TraceCheckUtils]: 1: Hoare triple {694#true} havoc #t~nondet1; {694#true} is VALID [2020-07-18 00:14:45,667 INFO L280 TraceCheckUtils]: 2: Hoare triple {694#true} #res.base, #res.offset := 0, 0; {694#true} is VALID [2020-07-18 00:14:45,667 INFO L280 TraceCheckUtils]: 3: Hoare triple {694#true} assume true; {694#true} is VALID [2020-07-18 00:14:45,668 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {694#true} {738#(not (= 0 nondet_tree_~n~0.base))} #102#return; {738#(not (= 0 nondet_tree_~n~0.base))} is VALID [2020-07-18 00:14:45,669 INFO L280 TraceCheckUtils]: 0: Hoare triple {736#(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); {694#true} is VALID [2020-07-18 00:14:45,669 INFO L280 TraceCheckUtils]: 1: Hoare triple {694#true} havoc #t~nondet1; {694#true} is VALID [2020-07-18 00:14:45,670 INFO L280 TraceCheckUtils]: 2: Hoare triple {694#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12); srcloc: L21 {737#(not (= 0 |nondet_tree_#t~malloc2.base|))} is VALID [2020-07-18 00:14:45,670 INFO L280 TraceCheckUtils]: 3: Hoare triple {737#(not (= 0 |nondet_tree_#t~malloc2.base|))} ~n~0.base, ~n~0.offset := #t~malloc2.base, #t~malloc2.offset; {738#(not (= 0 nondet_tree_~n~0.base))} is VALID [2020-07-18 00:14:45,671 INFO L280 TraceCheckUtils]: 4: Hoare triple {738#(not (= 0 nondet_tree_~n~0.base))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {738#(not (= 0 nondet_tree_~n~0.base))} is VALID [2020-07-18 00:14:45,672 INFO L280 TraceCheckUtils]: 5: Hoare triple {738#(not (= 0 nondet_tree_~n~0.base))} SUMMARY for call write~int(#t~nondet3, ~n~0.base, ~n~0.offset, 4); srcloc: L22-1 {738#(not (= 0 nondet_tree_~n~0.base))} is VALID [2020-07-18 00:14:45,672 INFO L280 TraceCheckUtils]: 6: Hoare triple {738#(not (= 0 nondet_tree_~n~0.base))} havoc #t~nondet3; {738#(not (= 0 nondet_tree_~n~0.base))} is VALID [2020-07-18 00:14:45,673 INFO L263 TraceCheckUtils]: 7: Hoare triple {738#(not (= 0 nondet_tree_~n~0.base))} call #t~ret4.base, #t~ret4.offset := nondet_tree(); {736#(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-18 00:14:45,674 INFO L280 TraceCheckUtils]: 8: Hoare triple {736#(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; {694#true} is VALID [2020-07-18 00:14:45,674 INFO L280 TraceCheckUtils]: 9: Hoare triple {694#true} havoc #t~nondet1; {694#true} is VALID [2020-07-18 00:14:45,674 INFO L280 TraceCheckUtils]: 10: Hoare triple {694#true} #res.base, #res.offset := 0, 0; {694#true} is VALID [2020-07-18 00:14:45,675 INFO L280 TraceCheckUtils]: 11: Hoare triple {694#true} assume true; {694#true} is VALID [2020-07-18 00:14:45,676 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {694#true} {738#(not (= 0 nondet_tree_~n~0.base))} #100#return; {738#(not (= 0 nondet_tree_~n~0.base))} is VALID [2020-07-18 00:14:45,676 INFO L280 TraceCheckUtils]: 13: Hoare triple {738#(not (= 0 nondet_tree_~n~0.base))} SUMMARY for call write~$Pointer$(#t~ret4.base, #t~ret4.offset, ~n~0.base, 4 + ~n~0.offset, 4); srcloc: L23-1 {738#(not (= 0 nondet_tree_~n~0.base))} is VALID [2020-07-18 00:14:45,677 INFO L280 TraceCheckUtils]: 14: Hoare triple {738#(not (= 0 nondet_tree_~n~0.base))} havoc #t~ret4.base, #t~ret4.offset; {738#(not (= 0 nondet_tree_~n~0.base))} is VALID [2020-07-18 00:14:45,678 INFO L263 TraceCheckUtils]: 15: Hoare triple {738#(not (= 0 nondet_tree_~n~0.base))} call #t~ret5.base, #t~ret5.offset := nondet_tree(); {736#(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-18 00:14:45,679 INFO L280 TraceCheckUtils]: 16: Hoare triple {736#(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; {694#true} is VALID [2020-07-18 00:14:45,679 INFO L280 TraceCheckUtils]: 17: Hoare triple {694#true} havoc #t~nondet1; {694#true} is VALID [2020-07-18 00:14:45,679 INFO L280 TraceCheckUtils]: 18: Hoare triple {694#true} #res.base, #res.offset := 0, 0; {694#true} is VALID [2020-07-18 00:14:45,679 INFO L280 TraceCheckUtils]: 19: Hoare triple {694#true} assume true; {694#true} is VALID [2020-07-18 00:14:45,680 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {694#true} {738#(not (= 0 nondet_tree_~n~0.base))} #102#return; {738#(not (= 0 nondet_tree_~n~0.base))} is VALID [2020-07-18 00:14:45,681 INFO L280 TraceCheckUtils]: 21: Hoare triple {738#(not (= 0 nondet_tree_~n~0.base))} SUMMARY for call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~n~0.base, 8 + ~n~0.offset, 4); srcloc: L24-1 {738#(not (= 0 nondet_tree_~n~0.base))} is VALID [2020-07-18 00:14:45,682 INFO L280 TraceCheckUtils]: 22: Hoare triple {738#(not (= 0 nondet_tree_~n~0.base))} havoc #t~ret5.base, #t~ret5.offset; {738#(not (= 0 nondet_tree_~n~0.base))} is VALID [2020-07-18 00:14:45,682 INFO L280 TraceCheckUtils]: 23: Hoare triple {738#(not (= 0 nondet_tree_~n~0.base))} #res.base, #res.offset := ~n~0.base, ~n~0.offset; {749#(not (= |nondet_tree_#res.base| 0))} is VALID [2020-07-18 00:14:45,683 INFO L280 TraceCheckUtils]: 24: Hoare triple {749#(not (= |nondet_tree_#res.base| 0))} assume true; {749#(not (= |nondet_tree_#res.base| 0))} is VALID [2020-07-18 00:14:45,684 INFO L275 TraceCheckUtils]: 25: Hoare quadruple {749#(not (= |nondet_tree_#res.base| 0))} {694#true} #108#return; {727#(not (= 0 |main_#t~ret15.base|))} is VALID [2020-07-18 00:14:45,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:14:45,726 INFO L280 TraceCheckUtils]: 0: Hoare triple {694#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {750#(= max_~n.base |max_#in~n.base|)} is VALID [2020-07-18 00:14:45,732 INFO L280 TraceCheckUtils]: 1: Hoare triple {750#(= max_~n.base |max_#in~n.base|)} assume ~n.base == 0 && ~n.offset == 0; {751#(= 0 |max_#in~n.base|)} is VALID [2020-07-18 00:14:45,733 INFO L280 TraceCheckUtils]: 2: Hoare triple {751#(= 0 |max_#in~n.base|)} #res := -2147483648; {751#(= 0 |max_#in~n.base|)} is VALID [2020-07-18 00:14:45,733 INFO L280 TraceCheckUtils]: 3: Hoare triple {751#(= 0 |max_#in~n.base|)} assume true; {751#(= 0 |max_#in~n.base|)} is VALID [2020-07-18 00:14:45,734 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {751#(= 0 |max_#in~n.base|)} {729#(not (= 0 task_~n.base))} #118#return; {695#false} is VALID [2020-07-18 00:14:45,736 INFO L263 TraceCheckUtils]: 0: Hoare triple {694#true} call ULTIMATE.init(); {735#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:14:45,736 INFO L280 TraceCheckUtils]: 1: Hoare triple {735#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {694#true} is VALID [2020-07-18 00:14:45,737 INFO L280 TraceCheckUtils]: 2: Hoare triple {694#true} #valid := #valid[0 := 0]; {694#true} is VALID [2020-07-18 00:14:45,737 INFO L280 TraceCheckUtils]: 3: Hoare triple {694#true} assume 0 < #StackHeapBarrier; {694#true} is VALID [2020-07-18 00:14:45,737 INFO L280 TraceCheckUtils]: 4: Hoare triple {694#true} assume true; {694#true} is VALID [2020-07-18 00:14:45,737 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {694#true} {694#true} #122#return; {694#true} is VALID [2020-07-18 00:14:45,738 INFO L263 TraceCheckUtils]: 6: Hoare triple {694#true} call #t~ret16 := main(); {694#true} is VALID [2020-07-18 00:14:45,738 INFO L263 TraceCheckUtils]: 7: Hoare triple {694#true} call #t~ret15.base, #t~ret15.offset := nondet_tree(); {736#(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-18 00:14:45,739 INFO L280 TraceCheckUtils]: 8: Hoare triple {736#(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); {694#true} is VALID [2020-07-18 00:14:45,739 INFO L280 TraceCheckUtils]: 9: Hoare triple {694#true} havoc #t~nondet1; {694#true} is VALID [2020-07-18 00:14:45,743 INFO L280 TraceCheckUtils]: 10: Hoare triple {694#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12); srcloc: L21 {737#(not (= 0 |nondet_tree_#t~malloc2.base|))} is VALID [2020-07-18 00:14:45,743 INFO L280 TraceCheckUtils]: 11: Hoare triple {737#(not (= 0 |nondet_tree_#t~malloc2.base|))} ~n~0.base, ~n~0.offset := #t~malloc2.base, #t~malloc2.offset; {738#(not (= 0 nondet_tree_~n~0.base))} is VALID [2020-07-18 00:14:45,744 INFO L280 TraceCheckUtils]: 12: Hoare triple {738#(not (= 0 nondet_tree_~n~0.base))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {738#(not (= 0 nondet_tree_~n~0.base))} is VALID [2020-07-18 00:14:45,744 INFO L280 TraceCheckUtils]: 13: Hoare triple {738#(not (= 0 nondet_tree_~n~0.base))} SUMMARY for call write~int(#t~nondet3, ~n~0.base, ~n~0.offset, 4); srcloc: L22-1 {738#(not (= 0 nondet_tree_~n~0.base))} is VALID [2020-07-18 00:14:45,745 INFO L280 TraceCheckUtils]: 14: Hoare triple {738#(not (= 0 nondet_tree_~n~0.base))} havoc #t~nondet3; {738#(not (= 0 nondet_tree_~n~0.base))} is VALID [2020-07-18 00:14:45,745 INFO L263 TraceCheckUtils]: 15: Hoare triple {738#(not (= 0 nondet_tree_~n~0.base))} call #t~ret4.base, #t~ret4.offset := nondet_tree(); {736#(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-18 00:14:45,746 INFO L280 TraceCheckUtils]: 16: Hoare triple {736#(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; {694#true} is VALID [2020-07-18 00:14:45,746 INFO L280 TraceCheckUtils]: 17: Hoare triple {694#true} havoc #t~nondet1; {694#true} is VALID [2020-07-18 00:14:45,746 INFO L280 TraceCheckUtils]: 18: Hoare triple {694#true} #res.base, #res.offset := 0, 0; {694#true} is VALID [2020-07-18 00:14:45,746 INFO L280 TraceCheckUtils]: 19: Hoare triple {694#true} assume true; {694#true} is VALID [2020-07-18 00:14:45,747 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {694#true} {738#(not (= 0 nondet_tree_~n~0.base))} #100#return; {738#(not (= 0 nondet_tree_~n~0.base))} is VALID [2020-07-18 00:14:45,748 INFO L280 TraceCheckUtils]: 21: Hoare triple {738#(not (= 0 nondet_tree_~n~0.base))} SUMMARY for call write~$Pointer$(#t~ret4.base, #t~ret4.offset, ~n~0.base, 4 + ~n~0.offset, 4); srcloc: L23-1 {738#(not (= 0 nondet_tree_~n~0.base))} is VALID [2020-07-18 00:14:45,748 INFO L280 TraceCheckUtils]: 22: Hoare triple {738#(not (= 0 nondet_tree_~n~0.base))} havoc #t~ret4.base, #t~ret4.offset; {738#(not (= 0 nondet_tree_~n~0.base))} is VALID [2020-07-18 00:14:45,749 INFO L263 TraceCheckUtils]: 23: Hoare triple {738#(not (= 0 nondet_tree_~n~0.base))} call #t~ret5.base, #t~ret5.offset := nondet_tree(); {736#(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-18 00:14:45,749 INFO L280 TraceCheckUtils]: 24: Hoare triple {736#(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; {694#true} is VALID [2020-07-18 00:14:45,749 INFO L280 TraceCheckUtils]: 25: Hoare triple {694#true} havoc #t~nondet1; {694#true} is VALID [2020-07-18 00:14:45,750 INFO L280 TraceCheckUtils]: 26: Hoare triple {694#true} #res.base, #res.offset := 0, 0; {694#true} is VALID [2020-07-18 00:14:45,750 INFO L280 TraceCheckUtils]: 27: Hoare triple {694#true} assume true; {694#true} is VALID [2020-07-18 00:14:45,754 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {694#true} {738#(not (= 0 nondet_tree_~n~0.base))} #102#return; {738#(not (= 0 nondet_tree_~n~0.base))} is VALID [2020-07-18 00:14:45,756 INFO L280 TraceCheckUtils]: 29: Hoare triple {738#(not (= 0 nondet_tree_~n~0.base))} SUMMARY for call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~n~0.base, 8 + ~n~0.offset, 4); srcloc: L24-1 {738#(not (= 0 nondet_tree_~n~0.base))} is VALID [2020-07-18 00:14:45,759 INFO L280 TraceCheckUtils]: 30: Hoare triple {738#(not (= 0 nondet_tree_~n~0.base))} havoc #t~ret5.base, #t~ret5.offset; {738#(not (= 0 nondet_tree_~n~0.base))} is VALID [2020-07-18 00:14:45,760 INFO L280 TraceCheckUtils]: 31: Hoare triple {738#(not (= 0 nondet_tree_~n~0.base))} #res.base, #res.offset := ~n~0.base, ~n~0.offset; {749#(not (= |nondet_tree_#res.base| 0))} is VALID [2020-07-18 00:14:45,761 INFO L280 TraceCheckUtils]: 32: Hoare triple {749#(not (= |nondet_tree_#res.base| 0))} assume true; {749#(not (= |nondet_tree_#res.base| 0))} is VALID [2020-07-18 00:14:45,762 INFO L275 TraceCheckUtils]: 33: Hoare quadruple {749#(not (= |nondet_tree_#res.base| 0))} {694#true} #108#return; {727#(not (= 0 |main_#t~ret15.base|))} is VALID [2020-07-18 00:14:45,763 INFO L263 TraceCheckUtils]: 34: Hoare triple {727#(not (= 0 |main_#t~ret15.base|))} call task(#t~ret15.base, #t~ret15.offset); {728#(not (= |task_#in~n.base| 0))} is VALID [2020-07-18 00:14:45,764 INFO L280 TraceCheckUtils]: 35: Hoare triple {728#(not (= |task_#in~n.base| 0))} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {729#(not (= 0 task_~n.base))} is VALID [2020-07-18 00:14:45,764 INFO L263 TraceCheckUtils]: 36: Hoare triple {729#(not (= 0 task_~n.base))} call #t~ret14 := max(~n.base, ~n.offset); {694#true} is VALID [2020-07-18 00:14:45,764 INFO L280 TraceCheckUtils]: 37: Hoare triple {694#true} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {750#(= max_~n.base |max_#in~n.base|)} is VALID [2020-07-18 00:14:45,765 INFO L280 TraceCheckUtils]: 38: Hoare triple {750#(= max_~n.base |max_#in~n.base|)} assume ~n.base == 0 && ~n.offset == 0; {751#(= 0 |max_#in~n.base|)} is VALID [2020-07-18 00:14:45,765 INFO L280 TraceCheckUtils]: 39: Hoare triple {751#(= 0 |max_#in~n.base|)} #res := -2147483648; {751#(= 0 |max_#in~n.base|)} is VALID [2020-07-18 00:14:45,766 INFO L280 TraceCheckUtils]: 40: Hoare triple {751#(= 0 |max_#in~n.base|)} assume true; {751#(= 0 |max_#in~n.base|)} is VALID [2020-07-18 00:14:45,769 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {751#(= 0 |max_#in~n.base|)} {729#(not (= 0 task_~n.base))} #118#return; {695#false} is VALID [2020-07-18 00:14:45,769 INFO L280 TraceCheckUtils]: 42: Hoare triple {695#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {695#false} is VALID [2020-07-18 00:14:45,769 INFO L280 TraceCheckUtils]: 43: Hoare triple {695#false} ~a~1 := #t~ret14; {695#false} is VALID [2020-07-18 00:14:45,769 INFO L280 TraceCheckUtils]: 44: Hoare triple {695#false} havoc #t~ret14; {695#false} is VALID [2020-07-18 00:14:45,770 INFO L263 TraceCheckUtils]: 45: Hoare triple {695#false} call check(~n.base, ~n.offset, ~a~1); {695#false} is VALID [2020-07-18 00:14:45,770 INFO L280 TraceCheckUtils]: 46: Hoare triple {695#false} ~n.base, ~n.offset := #in~n.base, #in~n.offset; {695#false} is VALID [2020-07-18 00:14:45,771 INFO L280 TraceCheckUtils]: 47: Hoare triple {695#false} ~a := #in~a; {695#false} is VALID [2020-07-18 00:14:45,771 INFO L280 TraceCheckUtils]: 48: Hoare triple {695#false} assume ~n.base != 0 || ~n.offset != 0; {695#false} is VALID [2020-07-18 00:14:45,772 INFO L280 TraceCheckUtils]: 49: Hoare triple {695#false} SUMMARY for call #t~mem10 := read~int(~n.base, ~n.offset, 4); srcloc: L42 {695#false} is VALID [2020-07-18 00:14:45,772 INFO L263 TraceCheckUtils]: 50: Hoare triple {695#false} call __VERIFIER_assert((if #t~mem10 <= ~a then 1 else 0)); {695#false} is VALID [2020-07-18 00:14:45,772 INFO L280 TraceCheckUtils]: 51: Hoare triple {695#false} ~cond := #in~cond; {695#false} is VALID [2020-07-18 00:14:45,772 INFO L280 TraceCheckUtils]: 52: Hoare triple {695#false} assume 0 == ~cond; {695#false} is VALID [2020-07-18 00:14:45,773 INFO L280 TraceCheckUtils]: 53: Hoare triple {695#false} assume !false; {695#false} is VALID [2020-07-18 00:14:45,777 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-18 00:14:46,299 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:14:46,300 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1345472454] [2020-07-18 00:14:46,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:14:46,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2020-07-18 00:14:46,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028756735] [2020-07-18 00:14:46,303 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 54 [2020-07-18 00:14:46,304 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:14:46,304 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2020-07-18 00:14:46,332 WARN L140 InductivityCheck]: Transition 754#(and (<= 0 (+ task_~a~1 2147483648)) (<= task_~a~1 2147483647) (= 0 |max_#in~n.base|)) ( _ , call check(~n.base, ~n.offset, ~a~1); , 755#(and (<= 0 (+ |check_#in~a| 2147483648)) (<= |check_#in~a| 2147483647) (= 0 |max_#in~n.base|)) ) not inductive [2020-07-18 00:14:46,333 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 00:14:46,334 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inductivity failed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:583) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:455) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-18 00:14:46,340 INFO L168 Benchmark]: Toolchain (without parser) took 6614.27 ms. Allocated memory was 143.7 MB in the beginning and 291.0 MB in the end (delta: 147.3 MB). Free memory was 101.7 MB in the beginning and 115.1 MB in the end (delta: -13.3 MB). Peak memory consumption was 134.0 MB. Max. memory is 7.1 GB. [2020-07-18 00:14:46,341 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 143.7 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-18 00:14:46,342 INFO L168 Benchmark]: CACSL2BoogieTranslator took 294.04 ms. Allocated memory is still 143.7 MB. Free memory was 101.3 MB in the beginning and 89.9 MB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 7.1 GB. [2020-07-18 00:14:46,343 INFO L168 Benchmark]: Boogie Preprocessor took 133.54 ms. Allocated memory was 143.7 MB in the beginning and 201.9 MB in the end (delta: 58.2 MB). Free memory was 89.9 MB in the beginning and 179.1 MB in the end (delta: -89.3 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. [2020-07-18 00:14:46,344 INFO L168 Benchmark]: RCFGBuilder took 629.21 ms. Allocated memory is still 201.9 MB. Free memory was 179.1 MB in the beginning and 142.4 MB in the end (delta: 36.8 MB). Peak memory consumption was 36.8 MB. Max. memory is 7.1 GB. [2020-07-18 00:14:46,345 INFO L168 Benchmark]: TraceAbstraction took 5550.85 ms. Allocated memory was 201.9 MB in the beginning and 291.0 MB in the end (delta: 89.1 MB). Free memory was 141.7 MB in the beginning and 115.1 MB in the end (delta: 26.6 MB). Peak memory consumption was 115.7 MB. Max. memory is 7.1 GB. [2020-07-18 00:14:46,349 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.23 ms. Allocated memory is still 143.7 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 294.04 ms. Allocated memory is still 143.7 MB. Free memory was 101.3 MB in the beginning and 89.9 MB in the end (delta: 11.4 MB). Peak memory consumption was 11.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 133.54 ms. Allocated memory was 143.7 MB in the beginning and 201.9 MB in the end (delta: 58.2 MB). Free memory was 89.9 MB in the beginning and 179.1 MB in the end (delta: -89.3 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 629.21 ms. Allocated memory is still 201.9 MB. Free memory was 179.1 MB in the beginning and 142.4 MB in the end (delta: 36.8 MB). Peak memory consumption was 36.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5550.85 ms. Allocated memory was 201.9 MB in the beginning and 291.0 MB in the end (delta: 89.1 MB). Free memory was 141.7 MB in the beginning and 115.1 MB in the end (delta: 26.6 MB). Peak memory consumption was 115.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inductivity failed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:142) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...