/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/verifythis/tree_del_rec.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 13:15:26,478 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 13:15:26,480 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 13:15:26,500 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 13:15:26,501 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 13:15:26,503 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 13:15:26,505 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 13:15:26,516 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 13:15:26,520 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 13:15:26,523 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 13:15:26,525 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 13:15:26,528 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 13:15:26,528 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 13:15:26,530 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 13:15:26,532 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 13:15:26,533 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 13:15:26,535 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 13:15:26,536 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 13:15:26,537 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 13:15:26,542 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 13:15:26,547 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 13:15:26,551 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 13:15:26,553 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 13:15:26,553 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 13:15:26,556 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 13:15:26,556 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 13:15:26,556 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 13:15:26,558 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 13:15:26,559 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 13:15:26,564 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 13:15:26,564 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 13:15:26,565 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 13:15:26,566 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 13:15:26,567 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 13:15:26,568 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 13:15:26,568 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 13:15:26,569 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 13:15:26,569 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 13:15:26,569 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 13:15:26,570 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 13:15:26,571 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 13:15:26,572 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-17 13:15:26,600 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 13:15:26,600 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 13:15:26,604 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 13:15:26,605 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 13:15:26,605 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 13:15:26,605 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 13:15:26,605 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 13:15:26,605 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 13:15:26,606 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 13:15:26,606 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 13:15:26,606 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 13:15:26,606 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 13:15:26,606 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 13:15:26,606 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 13:15:26,607 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 13:15:26,607 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-17 13:15:26,607 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 13:15:26,610 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 13:15:26,610 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 13:15:26,610 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 13:15:26,611 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-17 13:15:26,611 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 13:15:26,611 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-17 13:15:26,909 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 13:15:26,925 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 13:15:26,929 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 13:15:26,930 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 13:15:26,931 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 13:15:26,932 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/tree_del_rec.c [2020-07-17 13:15:27,009 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/365c6a3f0/53c8c3a7e5a4422fb3f8107251ae3355/FLAG5d970b741 [2020-07-17 13:15:27,528 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 13:15:27,528 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/tree_del_rec.c [2020-07-17 13:15:27,534 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/365c6a3f0/53c8c3a7e5a4422fb3f8107251ae3355/FLAG5d970b741 [2020-07-17 13:15:27,895 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/365c6a3f0/53c8c3a7e5a4422fb3f8107251ae3355 [2020-07-17 13:15:27,903 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 13:15:27,906 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 13:15:27,907 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 13:15:27,908 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 13:15:27,911 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 13:15:27,912 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 01:15:27" (1/1) ... [2020-07-17 13:15:27,915 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22ffc7f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:15:27, skipping insertion in model container [2020-07-17 13:15:27,916 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 01:15:27" (1/1) ... [2020-07-17 13:15:27,924 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 13:15:27,948 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 13:15:28,143 WARN L1484 CHandler]: Possible shadowing of function min [2020-07-17 13:15:28,145 WARN L1484 CHandler]: Possible shadowing of function min [2020-07-17 13:15:28,162 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 13:15:28,178 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 13:15:28,291 WARN L1484 CHandler]: Possible shadowing of function min [2020-07-17 13:15:28,293 WARN L1484 CHandler]: Possible shadowing of function min [2020-07-17 13:15:28,308 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 13:15:28,331 INFO L208 MainTranslator]: Completed translation [2020-07-17 13:15:28,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:15:28 WrapperNode [2020-07-17 13:15:28,332 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 13:15:28,332 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 13:15:28,333 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 13:15:28,333 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 13:15:28,345 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:15:28" (1/1) ... [2020-07-17 13:15:28,346 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:15:28" (1/1) ... [2020-07-17 13:15:28,358 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:15:28" (1/1) ... [2020-07-17 13:15:28,358 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:15:28" (1/1) ... [2020-07-17 13:15:28,375 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:15:28" (1/1) ... [2020-07-17 13:15:28,380 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:15:28" (1/1) ... [2020-07-17 13:15:28,384 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:15:28" (1/1) ... [2020-07-17 13:15:28,388 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 13:15:28,388 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 13:15:28,389 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 13:15:28,389 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 13:15:28,390 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:15:28" (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 13:15:28,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 13:15:28,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 13:15:28,446 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_cycle_if_not [2020-07-17 13:15:28,446 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-17 13:15:28,447 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_tree [2020-07-17 13:15:28,447 INFO L138 BoogieDeclarations]: Found implementation of procedure min [2020-07-17 13:15:28,447 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_del [2020-07-17 13:15:28,447 INFO L138 BoogieDeclarations]: Found implementation of procedure tree_inorder [2020-07-17 13:15:28,447 INFO L138 BoogieDeclarations]: Found implementation of procedure size [2020-07-17 13:15:28,448 INFO L138 BoogieDeclarations]: Found implementation of procedure task [2020-07-17 13:15:28,448 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 13:15:28,448 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2020-07-17 13:15:28,448 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-17 13:15:28,448 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-17 13:15:28,448 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-17 13:15:28,448 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 13:15:28,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2020-07-17 13:15:28,449 INFO L130 BoogieDeclarations]: Found specification of procedure assume_cycle_if_not [2020-07-17 13:15:28,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 13:15:28,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-17 13:15:28,456 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_tree [2020-07-17 13:15:28,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-17 13:15:28,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-17 13:15:28,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-17 13:15:28,456 INFO L130 BoogieDeclarations]: Found specification of procedure min [2020-07-17 13:15:28,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-17 13:15:28,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-17 13:15:28,457 INFO L130 BoogieDeclarations]: Found specification of procedure tree_del [2020-07-17 13:15:28,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-17 13:15:28,457 INFO L130 BoogieDeclarations]: Found specification of procedure tree_inorder [2020-07-17 13:15:28,457 INFO L130 BoogieDeclarations]: Found specification of procedure size [2020-07-17 13:15:28,457 INFO L130 BoogieDeclarations]: Found specification of procedure task [2020-07-17 13:15:28,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-17 13:15:28,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2020-07-17 13:15:28,458 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 13:15:28,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 13:15:28,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 13:15:29,120 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 13:15:29,121 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-17 13:15:29,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 01:15:29 BoogieIcfgContainer [2020-07-17 13:15:29,128 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 13:15:29,129 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 13:15:29,129 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 13:15:29,133 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 13:15:29,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 01:15:27" (1/3) ... [2020-07-17 13:15:29,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21a21bf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 01:15:29, skipping insertion in model container [2020-07-17 13:15:29,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 01:15:28" (2/3) ... [2020-07-17 13:15:29,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21a21bf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 01:15:29, skipping insertion in model container [2020-07-17 13:15:29,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 01:15:29" (3/3) ... [2020-07-17 13:15:29,137 INFO L109 eAbstractionObserver]: Analyzing ICFG tree_del_rec.c [2020-07-17 13:15:29,148 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-17 13:15:29,156 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 13:15:29,171 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 13:15:29,194 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 13:15:29,194 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 13:15:29,194 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-17 13:15:29,195 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 13:15:29,195 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 13:15:29,195 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 13:15:29,195 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 13:15:29,195 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 13:15:29,215 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states. [2020-07-17 13:15:29,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-07-17 13:15:29,232 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 13:15:29,234 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 13:15:29,234 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 13:15:29,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 13:15:29,240 INFO L82 PathProgramCache]: Analyzing trace with hash -2147081424, now seen corresponding path program 1 times [2020-07-17 13:15:29,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 13:15:29,248 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2081646544] [2020-07-17 13:15:29,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 13:15:29,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:29,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:29,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:29,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:29,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:29,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:29,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:29,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:29,732 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 13:15:30,652 WARN L193 SmtUtils]: Spent 668.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2020-07-17 13:15:30,653 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-17 13:15:30,655 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2081646544] [2020-07-17 13:15:30,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 13:15:30,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-07-17 13:15:30,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922001236] [2020-07-17 13:15:30,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-17 13:15:30,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 13:15:30,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-17 13:15:30,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2020-07-17 13:15:30,682 INFO L87 Difference]: Start difference. First operand 190 states. Second operand 18 states. [2020-07-17 13:15:32,741 WARN L193 SmtUtils]: Spent 660.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2020-07-17 13:15:33,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 13:15:33,586 INFO L93 Difference]: Finished difference Result 338 states and 397 transitions. [2020-07-17 13:15:33,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-17 13:15:33,588 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 60 [2020-07-17 13:15:33,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 13:15:33,605 INFO L225 Difference]: With dead ends: 338 [2020-07-17 13:15:33,606 INFO L226 Difference]: Without dead ends: 184 [2020-07-17 13:15:33,613 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=128, Invalid=742, Unknown=0, NotChecked=0, Total=870 [2020-07-17 13:15:33,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2020-07-17 13:15:33,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 171. [2020-07-17 13:15:33,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2020-07-17 13:15:33,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 192 transitions. [2020-07-17 13:15:33,698 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 192 transitions. Word has length 60 [2020-07-17 13:15:33,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 13:15:33,699 INFO L479 AbstractCegarLoop]: Abstraction has 171 states and 192 transitions. [2020-07-17 13:15:33,699 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-17 13:15:33,699 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 192 transitions. [2020-07-17 13:15:33,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2020-07-17 13:15:33,708 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 13:15:33,720 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 13:15:33,720 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 13:15:33,721 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 13:15:33,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 13:15:33,721 INFO L82 PathProgramCache]: Analyzing trace with hash -143602014, now seen corresponding path program 1 times [2020-07-17 13:15:33,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-17 13:15:33,722 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1708710303] [2020-07-17 13:15:33,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 13:15:33,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:33,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:33,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:34,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:34,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:34,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:34,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:34,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:34,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:34,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:34,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:34,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:34,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:34,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:34,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:34,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 13:15:34,243 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2020-07-17 13:15:34,870 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-17 13:15:34,871 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1708710303] [2020-07-17 13:15:34,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 13:15:34,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2020-07-17 13:15:34,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894069710] [2020-07-17 13:15:34,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2020-07-17 13:15:34,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-17 13:15:34,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2020-07-17 13:15:34,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=854, Unknown=0, NotChecked=0, Total=930 [2020-07-17 13:15:34,876 INFO L87 Difference]: Start difference. First operand 171 states and 192 transitions. Second operand 31 states. [2020-07-17 13:15:37,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 13:15:37,912 INFO L93 Difference]: Finished difference Result 302 states and 343 transitions. [2020-07-17 13:15:37,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-07-17 13:15:37,913 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 137 [2020-07-17 13:15:37,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 13:15:37,915 INFO L225 Difference]: With dead ends: 302 [2020-07-17 13:15:37,915 INFO L226 Difference]: Without dead ends: 0 [2020-07-17 13:15:37,924 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=250, Invalid=2612, Unknown=0, NotChecked=0, Total=2862 [2020-07-17 13:15:37,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-17 13:15:37,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-17 13:15:37,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-17 13:15:37,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-17 13:15:37,926 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 137 [2020-07-17 13:15:37,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 13:15:37,926 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-17 13:15:37,927 INFO L480 AbstractCegarLoop]: Interpolant automaton has 31 states. [2020-07-17 13:15:37,927 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 13:15:37,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 13:15:37,927 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 13:15:37,930 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-17 13:15:40,825 WARN L193 SmtUtils]: Spent 1.83 s on a formula simplification. DAG size of input: 46 DAG size of output: 17 [2020-07-17 13:15:43,035 WARN L193 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 46 DAG size of output: 17 [2020-07-17 13:15:45,658 WARN L193 SmtUtils]: Spent 2.62 s on a formula simplification. DAG size of input: 45 DAG size of output: 20 [2020-07-17 13:15:49,603 WARN L193 SmtUtils]: Spent 2.42 s on a formula simplification. DAG size of input: 46 DAG size of output: 17 [2020-07-17 13:15:50,261 WARN L193 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 1 [2020-07-17 13:15:50,332 INFO L264 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (= |#valid| |old(#valid)|) [2020-07-17 13:15:50,333 INFO L271 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-07-17 13:15:50,333 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-17 13:15:50,333 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#NULL.base)| |#NULL.base|) (= |#NULL.offset| |old(#NULL.offset)|)) [2020-07-17 13:15:50,333 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-17 13:15:50,333 INFO L271 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: true [2020-07-17 13:15:50,334 INFO L271 CegarLoopResult]: At program point L42-1(line 42) the Hoare annotation is: true [2020-07-17 13:15:50,334 INFO L271 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: true [2020-07-17 13:15:50,334 INFO L271 CegarLoopResult]: At program point L40-1(line 40) the Hoare annotation is: true [2020-07-17 13:15:50,334 INFO L271 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: true [2020-07-17 13:15:50,334 INFO L271 CegarLoopResult]: At program point L40-2(line 40) the Hoare annotation is: true [2020-07-17 13:15:50,334 INFO L271 CegarLoopResult]: At program point L38-1(line 38) the Hoare annotation is: true [2020-07-17 13:15:50,334 INFO L271 CegarLoopResult]: At program point L40-3(line 40) the Hoare annotation is: true [2020-07-17 13:15:50,335 INFO L271 CegarLoopResult]: At program point L36(line 36) the Hoare annotation is: true [2020-07-17 13:15:50,335 INFO L271 CegarLoopResult]: At program point L38-2(line 38) the Hoare annotation is: true [2020-07-17 13:15:50,335 INFO L271 CegarLoopResult]: At program point L40-4(line 40) the Hoare annotation is: true [2020-07-17 13:15:50,335 INFO L271 CegarLoopResult]: At program point L40-5(line 40) the Hoare annotation is: true [2020-07-17 13:15:50,335 INFO L271 CegarLoopResult]: At program point minEXIT(lines 34 45) the Hoare annotation is: true [2020-07-17 13:15:50,335 INFO L271 CegarLoopResult]: At program point minENTRY(lines 34 45) the Hoare annotation is: true [2020-07-17 13:15:50,336 INFO L271 CegarLoopResult]: At program point minFINAL(lines 34 45) the Hoare annotation is: true [2020-07-17 13:15:50,336 INFO L271 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: true [2020-07-17 13:15:50,336 INFO L271 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: true [2020-07-17 13:15:50,336 INFO L271 CegarLoopResult]: At program point L41-1(line 41) the Hoare annotation is: true [2020-07-17 13:15:50,336 INFO L271 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: true [2020-07-17 13:15:50,336 INFO L271 CegarLoopResult]: At program point L39-1(line 39) the Hoare annotation is: true [2020-07-17 13:15:50,337 INFO L271 CegarLoopResult]: At program point L39-2(line 39) the Hoare annotation is: true [2020-07-17 13:15:50,337 INFO L271 CegarLoopResult]: At program point L39-3(line 39) the Hoare annotation is: true [2020-07-17 13:15:50,337 INFO L271 CegarLoopResult]: At program point L35(lines 35 44) the Hoare annotation is: true [2020-07-17 13:15:50,337 INFO L271 CegarLoopResult]: At program point L39-4(line 39) the Hoare annotation is: true [2020-07-17 13:15:50,337 INFO L271 CegarLoopResult]: At program point L39-5(line 39) the Hoare annotation is: true [2020-07-17 13:15:50,337 INFO L264 CegarLoopResult]: At program point L93(line 93) the Hoare annotation is: (and (= task_~x~0.base |task_#t~malloc28.base|) (= |task_#t~malloc28.offset| task_~x~0.offset)) [2020-07-17 13:15:50,338 INFO L264 CegarLoopResult]: At program point L93-3(lines 93 94) the Hoare annotation is: (and (= task_~x~0.base |task_#t~malloc28.base|) (= |task_#t~malloc28.offset| task_~x~0.offset)) [2020-07-17 13:15:50,338 INFO L264 CegarLoopResult]: At program point L89(line 89) the Hoare annotation is: (and (= task_~y~0.offset |task_#t~malloc34.offset|) (<= task_~m~0 2147483647) (not (= 0 |task_#t~malloc34.base|)) (exists ((|v_#length_21| (Array Int Int))) (= |#length| (store |v_#length_21| |task_#t~malloc34.base| (* task_~n~1 4)))) (= task_~x~0.base |task_#t~malloc28.base|) (or (not (= 0 |task_#in~t.offset|)) (not (= |task_#in~t.base| 0))) (= task_~y~0.base |task_#t~malloc34.base|) (= 0 |task_#t~malloc34.offset|) (exists ((|v_#valid_37| (Array Int Int))) (and (= (store |v_#valid_37| |task_#t~malloc34.base| 1) |#valid|) (= 0 (select |v_#valid_37| |task_#t~malloc34.base|)))) (= |task_#t~malloc28.offset| task_~x~0.offset) (<= 0 (+ task_~m~0 2147483648)) (< |task_#t~malloc34.base| |#StackHeapBarrier|)) [2020-07-17 13:15:50,338 INFO L264 CegarLoopResult]: At program point L93-4(line 93) the Hoare annotation is: (and (= task_~x~0.base |task_#t~malloc28.base|) (= |task_#t~malloc28.offset| task_~x~0.offset)) [2020-07-17 13:15:50,338 INFO L264 CegarLoopResult]: At program point L89-1(line 89) the Hoare annotation is: (and (= task_~y~0.offset |task_#t~malloc34.offset|) (<= task_~m~0 2147483647) (not (= 0 |task_#t~malloc34.base|)) (<= 0 (+ task_~m~0 2147483648)) (exists ((|v_#length_21| (Array Int Int))) (= |#length| (store |v_#length_21| |task_#t~malloc34.base| (* task_~n~1 4)))) (= task_~x~0.base |task_#t~malloc28.base|) (or (not (= 0 |task_#in~t.offset|)) (not (= |task_#in~t.base| 0))) (= task_~y~0.base |task_#t~malloc34.base|) (= 0 |task_#t~malloc34.offset|) (exists ((|v_#valid_37| (Array Int Int))) (and (= (store |v_#valid_37| |task_#t~malloc34.base| 1) |#valid|) (= 0 (select |v_#valid_37| |task_#t~malloc34.base|)))) (= |task_#t~malloc28.offset| task_~x~0.offset) (< |task_#t~malloc34.base| |#StackHeapBarrier|)) [2020-07-17 13:15:50,339 INFO L264 CegarLoopResult]: At program point L93-5(line 93) the Hoare annotation is: (and (= task_~x~0.base |task_#t~malloc28.base|) (= |task_#t~malloc28.offset| task_~x~0.offset)) [2020-07-17 13:15:50,339 INFO L264 CegarLoopResult]: At program point L89-2(line 89) the Hoare annotation is: (and (<= 0 (+ task_~m~0 2147483648)) (<= task_~m~0 2147483647) (exists ((|v_#length_21| (Array Int Int))) (= |#length| (store |v_#length_21| |task_#t~malloc34.base| (* task_~n~1 4)))) (<= |task_#t~ret35| 2147483647) (or (not (= 0 |task_#in~t.offset|)) (not (= |task_#in~t.base| 0))) (<= 0 (+ |task_#t~ret35| 2147483648)) (= task_~y~0.offset |task_#t~malloc34.offset|) (not (= 0 |task_#t~malloc34.base|)) (= task_~x~0.base |task_#t~malloc28.base|) (= task_~y~0.base |task_#t~malloc34.base|) (= 0 |task_#t~malloc34.offset|) (exists ((|v_#valid_37| (Array Int Int))) (and (= (store |v_#valid_37| |task_#t~malloc34.base| 1) |#valid|) (= 0 (select |v_#valid_37| |task_#t~malloc34.base|)))) (= |task_#t~malloc28.offset| task_~x~0.offset) (< |task_#t~malloc34.base| |#StackHeapBarrier|)) [2020-07-17 13:15:50,339 INFO L264 CegarLoopResult]: At program point L93-6(lines 93 94) the Hoare annotation is: (and (= task_~x~0.base |task_#t~malloc28.base|) (= |task_#t~malloc28.offset| task_~x~0.offset)) [2020-07-17 13:15:50,339 INFO L264 CegarLoopResult]: At program point L93-7(lines 93 94) the Hoare annotation is: (and (= task_~x~0.base |task_#t~malloc28.base|) (= |task_#t~malloc28.offset| task_~x~0.offset)) [2020-07-17 13:15:50,339 INFO L264 CegarLoopResult]: At program point L85(line 85) the Hoare annotation is: (and (= |task_#t~malloc28.offset| 0) (< |task_#t~malloc28.base| |#StackHeapBarrier|) (exists ((|v_#valid_36| (Array Int Int))) (and (= |#valid| (store |v_#valid_36| |task_#t~malloc28.base| 1)) (= 0 (select |v_#valid_36| |task_#t~malloc28.base|)))) (= task_~x~0.base |task_#t~malloc28.base|) (or (not (= 0 |task_#in~t.offset|)) (not (= |task_#in~t.base| 0))) (exists ((|v_#length_20| (Array Int Int))) (= (store |v_#length_20| |task_#t~malloc28.base| (* task_~n~1 4)) |#length|)) (= |task_#t~malloc28.offset| task_~x~0.offset) (not (= 0 |task_#t~malloc28.base|))) [2020-07-17 13:15:50,340 INFO L264 CegarLoopResult]: At program point L85-1(line 85) the Hoare annotation is: (and (= task_~x~0.base |task_#t~malloc28.base|) (or (not (= 0 |task_#in~t.offset|)) (not (= |task_#in~t.base| 0))) (= |task_#t~malloc28.offset| task_~x~0.offset)) [2020-07-17 13:15:50,340 INFO L264 CegarLoopResult]: At program point L85-2(line 85) the Hoare annotation is: (and (= task_~x~0.base |task_#t~malloc28.base|) (or (not (= 0 |task_#in~t.offset|)) (not (= |task_#in~t.base| 0))) (= task_~r~1.base |task_#t~ret31.base|) (= |task_#t~malloc28.offset| task_~x~0.offset) (= |task_#t~ret31.offset| task_~r~1.offset)) [2020-07-17 13:15:50,340 INFO L264 CegarLoopResult]: At program point L81(line 81) the Hoare annotation is: (and (= |task_#t~malloc28.offset| 0) (< |task_#t~malloc28.base| |#StackHeapBarrier|) (exists ((|v_#valid_36| (Array Int Int))) (and (= |#valid| (store |v_#valid_36| |task_#t~malloc28.base| 1)) (= 0 (select |v_#valid_36| |task_#t~malloc28.base|)))) (or (not (= 0 |task_#in~t.offset|)) (not (= |task_#in~t.base| 0))) (= |#memory_int| |old(#memory_int)|) (exists ((|v_#length_20| (Array Int Int))) (= (store |v_#length_20| |task_#t~malloc28.base| (* task_~n~1 4)) |#length|)) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (not (= 0 |task_#t~malloc28.base|)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-17 13:15:50,340 INFO L264 CegarLoopResult]: At program point L81-1(line 81) the Hoare annotation is: (and (= |task_#t~malloc28.offset| 0) (< |task_#t~malloc28.base| |#StackHeapBarrier|) (exists ((|v_#valid_36| (Array Int Int))) (and (= |#valid| (store |v_#valid_36| |task_#t~malloc28.base| 1)) (= 0 (select |v_#valid_36| |task_#t~malloc28.base|)))) (or (not (= 0 |task_#in~t.offset|)) (not (= |task_#in~t.base| 0))) (exists ((|v_#length_20| (Array Int Int))) (= (store |v_#length_20| |task_#t~malloc28.base| (* task_~n~1 4)) |#length|)) (not (= 0 |task_#t~malloc28.base|))) [2020-07-17 13:15:50,341 INFO L264 CegarLoopResult]: At program point L77(line 77) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (or (not (= 0 |task_#in~t.offset|)) (and (= 0 task_~t.offset) (= 0 task_~t.base)) (not (= |task_#in~t.base| 0))) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-17 13:15:50,341 INFO L264 CegarLoopResult]: At program point L77-1(line 77) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (or (not (= 0 |task_#in~t.offset|)) (and (= 0 task_~t.offset) (= 0 task_~t.base)) (not (= |task_#in~t.base| 0))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-17 13:15:50,341 INFO L264 CegarLoopResult]: At program point L77-2(line 77) the Hoare annotation is: (and (= task_~x~0.base |task_#t~malloc28.base|) (= |task_#t~malloc28.offset| task_~x~0.offset)) [2020-07-17 13:15:50,341 INFO L264 CegarLoopResult]: At program point L94(line 94) the Hoare annotation is: (and (= task_~x~0.base |task_#t~malloc28.base|) (= |task_#t~malloc28.offset| task_~x~0.offset)) [2020-07-17 13:15:50,341 INFO L264 CegarLoopResult]: At program point L94-1(line 94) the Hoare annotation is: (and (= task_~x~0.base |task_#t~malloc28.base|) (= |task_#t~malloc28.offset| task_~x~0.offset)) [2020-07-17 13:15:50,341 INFO L264 CegarLoopResult]: At program point L94-2(line 94) the Hoare annotation is: (and (= task_~x~0.base |task_#t~malloc28.base|) (= |task_#t~malloc28.offset| task_~x~0.offset)) [2020-07-17 13:15:50,342 INFO L264 CegarLoopResult]: At program point L94-3(line 94) the Hoare annotation is: (and (= task_~x~0.base |task_#t~malloc28.base|) (= |task_#t~malloc28.offset| task_~x~0.offset)) [2020-07-17 13:15:50,342 INFO L264 CegarLoopResult]: At program point L94-4(line 94) the Hoare annotation is: (and (= task_~x~0.base |task_#t~malloc28.base|) (= |task_#t~malloc28.offset| task_~x~0.offset)) [2020-07-17 13:15:50,342 INFO L264 CegarLoopResult]: At program point L86(line 86) the Hoare annotation is: (and (= task_~x~0.base |task_#t~malloc28.base|) (or (not (= 0 |task_#in~t.offset|)) (not (= |task_#in~t.base| 0))) (= |task_#t~malloc28.offset| task_~x~0.offset)) [2020-07-17 13:15:50,342 INFO L264 CegarLoopResult]: At program point L86-1(line 86) the Hoare annotation is: (and (= (select (select |#memory_int| |task_~#b~1.base|) |task_~#b~1.offset|) |task_#t~mem32|) (= task_~x~0.base |task_#t~malloc28.base|) (or (not (= 0 |task_#in~t.offset|)) (not (= |task_#in~t.base| 0))) (= |task_#t~malloc28.offset| task_~x~0.offset)) [2020-07-17 13:15:50,342 INFO L264 CegarLoopResult]: At program point L86-2(line 86) the Hoare annotation is: (and (= (select (select |#memory_int| |task_~#b~1.base|) |task_~#b~1.offset|) |task_#t~mem32|) (= task_~x~0.base |task_#t~malloc28.base|) (or (not (= 0 |task_#in~t.offset|)) (not (= |task_#in~t.base| 0))) (= |task_#t~malloc28.offset| task_~x~0.offset)) [2020-07-17 13:15:50,343 INFO L264 CegarLoopResult]: At program point taskENTRY(lines 75 97) the Hoare annotation is: (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)|)) [2020-07-17 13:15:50,343 INFO L264 CegarLoopResult]: At program point L82(line 82) the Hoare annotation is: (and (= |task_#t~malloc28.offset| 0) (< |task_#t~malloc28.base| |#StackHeapBarrier|) (exists ((|v_#valid_36| (Array Int Int))) (and (= |#valid| (store |v_#valid_36| |task_#t~malloc28.base| 1)) (= 0 (select |v_#valid_36| |task_#t~malloc28.base|)))) (= task_~x~0.base |task_#t~malloc28.base|) (or (not (= 0 |task_#in~t.offset|)) (not (= |task_#in~t.base| 0))) (exists ((|v_#length_20| (Array Int Int))) (= (store |v_#length_20| |task_#t~malloc28.base| (* task_~n~1 4)) |#length|)) (= |task_#t~malloc28.offset| task_~x~0.offset) (not (= 0 |task_#t~malloc28.base|))) [2020-07-17 13:15:50,343 INFO L264 CegarLoopResult]: At program point L82-1(line 82) the Hoare annotation is: (and (= |task_#t~malloc28.offset| 0) (< |task_#t~malloc28.base| |#StackHeapBarrier|) (exists ((|v_#valid_36| (Array Int Int))) (and (= |#valid| (store |v_#valid_36| |task_#t~malloc28.base| 1)) (= 0 (select |v_#valid_36| |task_#t~malloc28.base|)))) (= task_~x~0.base |task_#t~malloc28.base|) (or (not (= 0 |task_#in~t.offset|)) (not (= |task_#in~t.base| 0))) (exists ((|v_#length_20| (Array Int Int))) (= (store |v_#length_20| |task_#t~malloc28.base| (* task_~n~1 4)) |#length|)) (= |task_#t~malloc28.offset| task_~x~0.offset) (not (= 0 |task_#t~malloc28.base|))) [2020-07-17 13:15:50,343 INFO L264 CegarLoopResult]: At program point L82-2(line 82) the Hoare annotation is: (and (= |task_#t~malloc28.offset| 0) (< |task_#t~malloc28.base| |#StackHeapBarrier|) (exists ((|v_#valid_36| (Array Int Int))) (and (= |#valid| (store |v_#valid_36| |task_#t~malloc28.base| 1)) (= 0 (select |v_#valid_36| |task_#t~malloc28.base|)))) (= task_~x~0.base |task_#t~malloc28.base|) (or (not (= 0 |task_#in~t.offset|)) (not (= |task_#in~t.base| 0))) (<= 0 (+ |task_#t~ret29| 2147483648)) (exists ((|v_#length_20| (Array Int Int))) (= (store |v_#length_20| |task_#t~malloc28.base| (* task_~n~1 4)) |#length|)) (= |task_#t~malloc28.offset| task_~x~0.offset) (not (= 0 |task_#t~malloc28.base|)) (<= |task_#t~ret29| 2147483647)) [2020-07-17 13:15:50,344 INFO L264 CegarLoopResult]: At program point taskFINAL(lines 75 97) the Hoare annotation is: (and (= task_~x~0.base |task_#t~malloc28.base|) (= |task_#t~malloc28.offset| task_~x~0.offset)) [2020-07-17 13:15:50,344 INFO L264 CegarLoopResult]: At program point L95(line 95) the Hoare annotation is: (and (= task_~x~0.base |task_#t~malloc28.base|) (= |task_#t~malloc28.offset| task_~x~0.offset)) [2020-07-17 13:15:50,344 INFO L264 CegarLoopResult]: At program point L91(line 91) the Hoare annotation is: (and (<= 0 (+ task_~m~0 2147483648)) (= task_~y~0.offset |task_#t~malloc34.offset|) (<= task_~m~0 2147483647) (not (= 0 |task_#t~malloc34.base|)) (exists ((|v_#length_21| (Array Int Int))) (= |#length| (store |v_#length_21| |task_#t~malloc34.base| (* task_~n~1 4)))) (= task_~x~0.base |task_#t~malloc28.base|) (or (not (= 0 |task_#in~t.offset|)) (not (= |task_#in~t.base| 0))) (= task_~y~0.base |task_#t~malloc34.base|) (= 0 |task_#t~malloc34.offset|) (exists ((|v_#valid_37| (Array Int Int))) (and (= (store |v_#valid_37| |task_#t~malloc34.base| 1) |#valid|) (= 0 (select |v_#valid_37| |task_#t~malloc34.base|)))) (= |task_#t~malloc28.offset| task_~x~0.offset) (< |task_#t~malloc34.base| |#StackHeapBarrier|)) [2020-07-17 13:15:50,344 INFO L264 CegarLoopResult]: At program point L91-1(line 91) the Hoare annotation is: (and (= task_~x~0.base |task_#t~malloc28.base|) (= |task_#t~malloc28.offset| task_~x~0.offset)) [2020-07-17 13:15:50,345 INFO L264 CegarLoopResult]: At program point L87(line 87) the Hoare annotation is: (and (= task_~x~0.base |task_#t~malloc28.base|) (or (not (= 0 |task_#in~t.offset|)) (not (= |task_#in~t.base| 0))) (= |task_#t~malloc28.offset| task_~x~0.offset)) [2020-07-17 13:15:50,345 INFO L264 CegarLoopResult]: At program point L87-1(line 87) the Hoare annotation is: (and (= task_~x~0.base |task_#t~malloc28.base|) (or (not (= 0 |task_#in~t.offset|)) (not (= |task_#in~t.base| 0))) (= |task_#t~malloc28.offset| task_~x~0.offset)) [2020-07-17 13:15:50,345 INFO L264 CegarLoopResult]: At program point taskEXIT(lines 75 97) the Hoare annotation is: (and (= task_~x~0.base |task_#t~malloc28.base|) (= |task_#t~malloc28.offset| task_~x~0.offset)) [2020-07-17 13:15:50,345 INFO L264 CegarLoopResult]: At program point L87-2(line 87) the Hoare annotation is: (and (= task_~x~0.base |task_#t~malloc28.base|) (or (not (= 0 |task_#in~t.offset|)) (not (= |task_#in~t.base| 0))) (= |task_#t~malloc28.offset| task_~x~0.offset) (<= 0 (+ |task_#t~ret33| 2147483648)) (<= |task_#t~ret33| 2147483647)) [2020-07-17 13:15:50,345 INFO L264 CegarLoopResult]: At program point L87-3(line 87) the Hoare annotation is: (and (= task_~x~0.base |task_#t~malloc28.base|) (= |task_#t~ret33| task_~m~0) (or (not (= 0 |task_#in~t.offset|)) (not (= |task_#in~t.base| 0))) (= |task_#t~malloc28.offset| task_~x~0.offset) (<= 0 (+ |task_#t~ret33| 2147483648)) (<= |task_#t~ret33| 2147483647)) [2020-07-17 13:15:50,346 INFO L264 CegarLoopResult]: At program point L83(line 83) the Hoare annotation is: (and (= |task_#t~malloc28.offset| 0) (< |task_#t~malloc28.base| |#StackHeapBarrier|) (exists ((|v_#valid_36| (Array Int Int))) (and (= |#valid| (store |v_#valid_36| |task_#t~malloc28.base| 1)) (= 0 (select |v_#valid_36| |task_#t~malloc28.base|)))) (= task_~x~0.base |task_#t~malloc28.base|) (or (not (= 0 |task_#in~t.offset|)) (not (= |task_#in~t.base| 0))) (exists ((|v_#length_20| (Array Int Int))) (= (store |v_#length_20| |task_#t~malloc28.base| (* task_~n~1 4)) |#length|)) (= |task_#t~malloc28.offset| task_~x~0.offset) (not (= 0 |task_#t~malloc28.base|))) [2020-07-17 13:15:50,346 INFO L264 CegarLoopResult]: At program point L83-1(line 83) the Hoare annotation is: (and (= |task_#t~malloc28.offset| 0) (< |task_#t~malloc28.base| |#StackHeapBarrier|) (exists ((|v_#valid_36| (Array Int Int))) (and (= |#valid| (store |v_#valid_36| |task_#t~malloc28.base| 1)) (= 0 (select |v_#valid_36| |task_#t~malloc28.base|)))) (= task_~x~0.base |task_#t~malloc28.base|) (or (not (= 0 |task_#in~t.offset|)) (not (= |task_#in~t.base| 0))) (= |task_#t~mem30| (select (select |#memory_int| task_~x~0.base) task_~x~0.offset)) (exists ((|v_#length_20| (Array Int Int))) (= (store |v_#length_20| |task_#t~malloc28.base| (* task_~n~1 4)) |#length|)) (= |task_#t~malloc28.offset| task_~x~0.offset) (not (= 0 |task_#t~malloc28.base|))) [2020-07-17 13:15:50,346 INFO L264 CegarLoopResult]: At program point L83-2(line 83) the Hoare annotation is: (and (= |task_#t~malloc28.offset| 0) (< |task_#t~malloc28.base| |#StackHeapBarrier|) (exists ((|v_#valid_36| (Array Int Int))) (and (= |#valid| (store |v_#valid_36| |task_#t~malloc28.base| 1)) (= 0 (select |v_#valid_36| |task_#t~malloc28.base|)))) (= task_~x~0.base |task_#t~malloc28.base|) (or (not (= 0 |task_#in~t.offset|)) (not (= |task_#in~t.base| 0))) (= |task_#t~mem30| (select (select |#memory_int| task_~x~0.base) task_~x~0.offset)) (exists ((|v_#length_20| (Array Int Int))) (= (store |v_#length_20| |task_#t~malloc28.base| (* task_~n~1 4)) |#length|)) (= |task_#t~malloc28.offset| task_~x~0.offset) (not (= 0 |task_#t~malloc28.base|))) [2020-07-17 13:15:50,346 INFO L264 CegarLoopResult]: At program point L79(line 79) the Hoare annotation is: (and (or (not (= 0 |task_#in~t.offset|)) (not (= |task_#in~t.base| 0)) (= 0 |task_#t~ret27|)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-17 13:15:50,347 INFO L264 CegarLoopResult]: At program point L79-1(line 79) the Hoare annotation is: (and (or (not (= 0 |task_#in~t.offset|)) (not (= |task_#in~t.base| 0)) (= 0 |task_#t~ret27|)) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-17 13:15:50,347 INFO L264 CegarLoopResult]: At program point L79-2(line 79) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (or (and (= 0 task_~n~1) (= 0 |task_#t~ret27|)) (not (= 0 |task_#in~t.offset|)) (not (= |task_#in~t.base| 0))) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-17 13:15:50,347 INFO L264 CegarLoopResult]: At program point L96(line 96) the Hoare annotation is: (and (= task_~x~0.base |task_#t~malloc28.base|) (= |task_#t~malloc28.offset| task_~x~0.offset)) [2020-07-17 13:15:50,347 INFO L264 CegarLoopResult]: At program point L88(line 88) the Hoare annotation is: (and (<= task_~m~0 2147483647) (= task_~x~0.base |task_#t~malloc28.base|) (or (not (= 0 |task_#in~t.offset|)) (not (= |task_#in~t.base| 0))) (= |task_#t~malloc28.offset| task_~x~0.offset) (<= 0 (+ task_~m~0 2147483648))) [2020-07-17 13:15:50,347 INFO L264 CegarLoopResult]: At program point L88-1(line 88) the Hoare annotation is: (and (<= task_~m~0 2147483647) (not (= 0 |task_#t~malloc34.base|)) (exists ((|v_#length_21| (Array Int Int))) (= |#length| (store |v_#length_21| |task_#t~malloc34.base| (* task_~n~1 4)))) (= task_~x~0.base |task_#t~malloc28.base|) (or (not (= 0 |task_#in~t.offset|)) (not (= |task_#in~t.base| 0))) (<= 0 (+ task_~m~0 2147483648)) (= 0 |task_#t~malloc34.offset|) (exists ((|v_#valid_37| (Array Int Int))) (and (= (store |v_#valid_37| |task_#t~malloc34.base| 1) |#valid|) (= 0 (select |v_#valid_37| |task_#t~malloc34.base|)))) (= |task_#t~malloc28.offset| task_~x~0.offset) (< |task_#t~malloc34.base| |#StackHeapBarrier|)) [2020-07-17 13:15:50,348 INFO L264 CegarLoopResult]: At program point L88-2(line 88) the Hoare annotation is: (and (<= task_~m~0 2147483647) (not (= 0 |task_#t~malloc34.base|)) (exists ((|v_#length_21| (Array Int Int))) (= |#length| (store |v_#length_21| |task_#t~malloc34.base| (* task_~n~1 4)))) (= task_~x~0.base |task_#t~malloc28.base|) (or (not (= 0 |task_#in~t.offset|)) (not (= |task_#in~t.base| 0))) (= 0 |task_#t~malloc34.offset|) (exists ((|v_#valid_37| (Array Int Int))) (and (= (store |v_#valid_37| |task_#t~malloc34.base| 1) |#valid|) (= 0 (select |v_#valid_37| |task_#t~malloc34.base|)))) (= |task_#t~malloc28.offset| task_~x~0.offset) (<= 0 (+ task_~m~0 2147483648)) (< |task_#t~malloc34.base| |#StackHeapBarrier|)) [2020-07-17 13:15:50,348 INFO L264 CegarLoopResult]: At program point L80(line 80) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (or (not (= 0 |task_#in~t.offset|)) (not (= |task_#in~t.base| 0)) (= 0 task_~n~1)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-17 13:15:50,348 INFO L264 CegarLoopResult]: At program point L80-1(line 80) the Hoare annotation is: (and (or (not (= 0 |task_#in~t.offset|)) (not (= |task_#in~t.base| 0))) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-17 13:15:50,348 INFO L264 CegarLoopResult]: At program point L76(line 76) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (or (not (= 0 |task_#in~t.offset|)) (and (= 0 task_~t.offset) (= 0 task_~t.base)) (not (= |task_#in~t.base| 0))) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-17 13:15:50,349 INFO L264 CegarLoopResult]: At program point L76-1(line 76) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (or (not (= 0 |task_#in~t.offset|)) (and (= 0 task_~t.offset) (= 0 task_~t.base)) (not (= |task_#in~t.base| 0))) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-17 13:15:50,349 INFO L264 CegarLoopResult]: At program point L76-2(line 76) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (or (not (= 0 |task_#in~t.offset|)) (and (= 0 task_~t.offset) (= 0 task_~t.base)) (not (= |task_#in~t.base| 0))) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-17 13:15:50,349 INFO L264 CegarLoopResult]: At program point L76-3(line 76) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (or (not (= 0 |task_#in~t.offset|)) (and (= 0 task_~t.offset) (= 0 task_~t.base)) (not (= |task_#in~t.base| 0))) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-17 13:15:50,349 INFO L264 CegarLoopResult]: At program point L72-7(line 72) the Hoare annotation is: (and (= |size_#in~t.base| size_~t.base) (= |size_#in~t.offset| size_~t.offset) (or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))) [2020-07-17 13:15:50,349 INFO L264 CegarLoopResult]: At program point L72-8(line 72) the Hoare annotation is: (and (= |size_#in~t.base| size_~t.base) (= |size_#in~t.offset| size_~t.offset) (or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))) [2020-07-17 13:15:50,350 INFO L264 CegarLoopResult]: At program point L72-9(line 72) the Hoare annotation is: (and (= |size_#in~t.base| size_~t.base) (= |size_#in~t.offset| size_~t.offset) (or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))) [2020-07-17 13:15:50,350 INFO L264 CegarLoopResult]: At program point L72-10(line 72) the Hoare annotation is: (and (= |size_#in~t.base| size_~t.base) (= |size_#in~t.offset| size_~t.offset) (or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))) [2020-07-17 13:15:50,350 INFO L271 CegarLoopResult]: At program point sizeENTRY(lines 70 73) the Hoare annotation is: true [2020-07-17 13:15:50,350 INFO L264 CegarLoopResult]: At program point sizeFINAL(lines 70 73) the Hoare annotation is: (let ((.cse0 (= |size_#in~t.base| size_~t.base)) (.cse1 (= |size_#in~t.offset| size_~t.offset))) (or (and .cse0 .cse1 (or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))) (and .cse0 (= 0 |size_#res|) .cse1))) [2020-07-17 13:15:50,350 INFO L264 CegarLoopResult]: At program point sizeEXIT(lines 70 73) the Hoare annotation is: (let ((.cse0 (= |size_#in~t.base| size_~t.base)) (.cse1 (= |size_#in~t.offset| size_~t.offset))) (or (and .cse0 .cse1 (or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))) (and .cse0 (= 0 |size_#res|) .cse1))) [2020-07-17 13:15:50,350 INFO L264 CegarLoopResult]: At program point L72(line 72) the Hoare annotation is: (and (= |size_#in~t.base| size_~t.base) (= |size_#in~t.offset| size_~t.offset) (or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))) [2020-07-17 13:15:50,351 INFO L264 CegarLoopResult]: At program point L71(lines 71 72) the Hoare annotation is: (and (= |size_#in~t.base| size_~t.base) (= |size_#in~t.offset| size_~t.offset)) [2020-07-17 13:15:50,351 INFO L264 CegarLoopResult]: At program point L72-1(line 72) the Hoare annotation is: (and (= |size_#in~t.base| size_~t.base) (= |size_#in~t.offset| size_~t.offset) (or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))) [2020-07-17 13:15:50,351 INFO L264 CegarLoopResult]: At program point L71-1(line 71) the Hoare annotation is: (and (= |size_#in~t.base| size_~t.base) (= |size_#in~t.offset| size_~t.offset)) [2020-07-17 13:15:50,351 INFO L264 CegarLoopResult]: At program point L72-2(line 72) the Hoare annotation is: (and (= |size_#in~t.base| size_~t.base) (= |size_#in~t.offset| size_~t.offset) (or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))) [2020-07-17 13:15:50,351 INFO L264 CegarLoopResult]: At program point L72-3(line 72) the Hoare annotation is: (and (= |size_#in~t.base| size_~t.base) (= |size_#in~t.offset| size_~t.offset) (or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))) [2020-07-17 13:15:50,351 INFO L264 CegarLoopResult]: At program point L72-4(line 72) the Hoare annotation is: (and (= |size_#in~t.base| size_~t.base) (= |size_#in~t.offset| size_~t.offset) (or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))) [2020-07-17 13:15:50,352 INFO L264 CegarLoopResult]: At program point L72-5(line 72) the Hoare annotation is: (and (= |size_#in~t.base| size_~t.base) (= |size_#in~t.offset| size_~t.offset) (or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))) [2020-07-17 13:15:50,352 INFO L264 CegarLoopResult]: At program point L72-6(line 72) the Hoare annotation is: (and (= |size_#in~t.base| size_~t.base) (= |size_#in~t.offset| size_~t.offset) (or (not (= |size_#in~t.offset| 0)) (not (= 0 |size_#in~t.base|)))) [2020-07-17 13:15:50,352 INFO L271 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: true [2020-07-17 13:15:50,352 INFO L271 CegarLoopResult]: At program point nondet_treeFINAL(lines 22 32) the Hoare annotation is: true [2020-07-17 13:15:50,352 INFO L271 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: true [2020-07-17 13:15:50,352 INFO L271 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: true [2020-07-17 13:15:50,353 INFO L271 CegarLoopResult]: At program point L29-1(line 29) the Hoare annotation is: true [2020-07-17 13:15:50,353 INFO L264 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-17 13:15:50,353 INFO L271 CegarLoopResult]: At program point L28-1(line 28) the Hoare annotation is: true [2020-07-17 13:15:50,353 INFO L271 CegarLoopResult]: At program point L29-2(line 29) the Hoare annotation is: true [2020-07-17 13:15:50,353 INFO L264 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: (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)|)) [2020-07-17 13:15:50,353 INFO L264 CegarLoopResult]: At program point L27-1(line 27) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-17 13:15:50,354 INFO L271 CegarLoopResult]: At program point L28-2(line 28) the Hoare annotation is: true [2020-07-17 13:15:50,354 INFO L264 CegarLoopResult]: At program point L26-1(line 26) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-17 13:15:50,354 INFO L271 CegarLoopResult]: At program point L27-2(line 27) the Hoare annotation is: true [2020-07-17 13:15:50,354 INFO L264 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: (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)|)) [2020-07-17 13:15:50,354 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (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)|)) [2020-07-17 13:15:50,355 INFO L264 CegarLoopResult]: At program point nondet_treeENTRY(lines 22 32) the Hoare annotation is: (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)|)) [2020-07-17 13:15:50,355 INFO L264 CegarLoopResult]: At program point L23-1(line 23) the Hoare annotation is: (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)|)) [2020-07-17 13:15:50,355 INFO L271 CegarLoopResult]: At program point nondet_treeEXIT(lines 22 32) the Hoare annotation is: true [2020-07-17 13:15:50,355 INFO L271 CegarLoopResult]: At program point assume_cycle_if_notENTRY(lines 8 10) the Hoare annotation is: true [2020-07-17 13:15:50,355 INFO L264 CegarLoopResult]: At program point assume_cycle_if_notEXIT(lines 8 10) the Hoare annotation is: (and (= assume_cycle_if_not_~cond |assume_cycle_if_not_#in~cond|) (not (= 0 |assume_cycle_if_not_#in~cond|))) [2020-07-17 13:15:50,355 INFO L264 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: (= assume_cycle_if_not_~cond |assume_cycle_if_not_#in~cond|) [2020-07-17 13:15:50,356 INFO L264 CegarLoopResult]: At program point L9-3(line 9) the Hoare annotation is: (= assume_cycle_if_not_~cond |assume_cycle_if_not_#in~cond|) [2020-07-17 13:15:50,356 INFO L264 CegarLoopResult]: At program point L9-5(lines 8 10) the Hoare annotation is: (and (= assume_cycle_if_not_~cond |assume_cycle_if_not_#in~cond|) (not (= 0 |assume_cycle_if_not_#in~cond|))) [2020-07-17 13:15:50,356 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-17 13:15:50,356 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-17 13:15:50,356 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-17 13:15:50,356 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-17 13:15:50,357 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 99 101) the Hoare annotation is: (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)|)) [2020-07-17 13:15:50,357 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 99 101) the Hoare annotation is: true [2020-07-17 13:15:50,357 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 99 101) the Hoare annotation is: true [2020-07-17 13:15:50,357 INFO L271 CegarLoopResult]: At program point L100(line 100) the Hoare annotation is: true [2020-07-17 13:15:50,357 INFO L271 CegarLoopResult]: At program point L100-1(line 100) the Hoare annotation is: true [2020-07-17 13:15:50,357 INFO L264 CegarLoopResult]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2020-07-17 13:15:50,357 INFO L271 CegarLoopResult]: At program point #Ultimate.meminitEXIT(line -1) the Hoare annotation is: true [2020-07-17 13:15:50,358 INFO L271 CegarLoopResult]: At program point #Ultimate.meminitFINAL(line -1) the Hoare annotation is: true [2020-07-17 13:15:50,358 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 13 15) the Hoare annotation is: true [2020-07-17 13:15:50,358 INFO L264 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: (or (forall ((v_task_~a~1_6 Int)) (not (= |__VERIFIER_assert_#in~cond| (ite (= (select (select |#memory_int| task_~x~0.base) task_~x~0.offset) v_task_~a~1_6) 1 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2020-07-17 13:15:50,358 INFO L264 CegarLoopResult]: At program point L14-1(line 14) the Hoare annotation is: (or (forall ((v_task_~a~1_6 Int)) (not (= |__VERIFIER_assert_#in~cond| (ite (= (select (select |#memory_int| task_~x~0.base) task_~x~0.offset) v_task_~a~1_6) 1 0)))) (and (= 0 __VERIFIER_assert_~cond) (exists ((v_task_~a~1_6 Int)) (= |__VERIFIER_assert_#in~cond| (ite (= (select (select |#memory_int| task_~x~0.base) task_~x~0.offset) v_task_~a~1_6) 1 0))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) [2020-07-17 13:15:50,358 INFO L264 CegarLoopResult]: At program point L14-3(lines 13 15) the Hoare annotation is: (or (forall ((v_task_~a~1_6 Int)) (not (= |__VERIFIER_assert_#in~cond| (ite (= (select (select |#memory_int| task_~x~0.base) task_~x~0.offset) v_task_~a~1_6) 1 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2020-07-17 13:15:50,359 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 13 15) the Hoare annotation is: (or (forall ((v_task_~a~1_6 Int)) (not (= |__VERIFIER_assert_#in~cond| (ite (= (select (select |#memory_int| task_~x~0.base) task_~x~0.offset) v_task_~a~1_6) 1 0)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) [2020-07-17 13:15:50,359 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) the Hoare annotation is: (forall ((v_task_~n~1_14 Int) (v_task_~m~0_8 Int)) (not (= |__VERIFIER_assert_#in~cond| (ite (= v_task_~n~1_14 (+ v_task_~m~0_8 1)) 1 0)))) [2020-07-17 13:15:50,359 INFO L271 CegarLoopResult]: At program point L64(line 64) the Hoare annotation is: true [2020-07-17 13:15:50,359 INFO L271 CegarLoopResult]: At program point L64-1(line 64) the Hoare annotation is: true [2020-07-17 13:15:50,359 INFO L271 CegarLoopResult]: At program point L64-2(line 64) the Hoare annotation is: true [2020-07-17 13:15:50,359 INFO L271 CegarLoopResult]: At program point L64-3(line 64) the Hoare annotation is: true [2020-07-17 13:15:50,360 INFO L264 CegarLoopResult]: At program point L60(lines 60 67) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-17 13:15:50,360 INFO L271 CegarLoopResult]: At program point L64-4(line 64) the Hoare annotation is: true [2020-07-17 13:15:50,360 INFO L264 CegarLoopResult]: At program point tree_inorderENTRY(lines 59 68) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-17 13:15:50,360 INFO L271 CegarLoopResult]: At program point L64-5(line 64) the Hoare annotation is: true [2020-07-17 13:15:50,360 INFO L271 CegarLoopResult]: At program point tree_inorderFINAL(lines 59 68) the Hoare annotation is: true [2020-07-17 13:15:50,360 INFO L271 CegarLoopResult]: At program point L65(line 65) the Hoare annotation is: true [2020-07-17 13:15:50,361 INFO L271 CegarLoopResult]: At program point L65-1(line 65) the Hoare annotation is: true [2020-07-17 13:15:50,361 INFO L264 CegarLoopResult]: At program point L63(line 63) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-17 13:15:50,361 INFO L271 CegarLoopResult]: At program point L65-2(line 65) the Hoare annotation is: true [2020-07-17 13:15:50,361 INFO L264 CegarLoopResult]: At program point L63-1(line 63) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-17 13:15:50,361 INFO L271 CegarLoopResult]: At program point L65-3(line 65) the Hoare annotation is: true [2020-07-17 13:15:50,361 INFO L264 CegarLoopResult]: At program point L61(line 61) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-17 13:15:50,361 INFO L271 CegarLoopResult]: At program point L63-2(line 63) the Hoare annotation is: true [2020-07-17 13:15:50,362 INFO L271 CegarLoopResult]: At program point L65-4(line 65) the Hoare annotation is: true [2020-07-17 13:15:50,362 INFO L271 CegarLoopResult]: At program point L63-3(line 63) the Hoare annotation is: true [2020-07-17 13:15:50,362 INFO L271 CegarLoopResult]: At program point L65-5(line 65) the Hoare annotation is: true [2020-07-17 13:15:50,362 INFO L264 CegarLoopResult]: At program point L59(lines 59 68) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-17 13:15:50,362 INFO L271 CegarLoopResult]: At program point L63-4(line 63) the Hoare annotation is: true [2020-07-17 13:15:50,362 INFO L264 CegarLoopResult]: At program point L59-1(lines 59 68) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-17 13:15:50,362 INFO L271 CegarLoopResult]: At program point L63-5(line 63) the Hoare annotation is: true [2020-07-17 13:15:50,363 INFO L271 CegarLoopResult]: At program point tree_inorderEXIT(lines 59 68) the Hoare annotation is: true [2020-07-17 13:15:50,363 INFO L271 CegarLoopResult]: At program point L66(line 66) the Hoare annotation is: true [2020-07-17 13:15:50,363 INFO L264 CegarLoopResult]: At program point L54(line 54) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-17 13:15:50,363 INFO L264 CegarLoopResult]: At program point L54-1(line 54) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-17 13:15:50,363 INFO L271 CegarLoopResult]: At program point L54-2(line 54) the Hoare annotation is: true [2020-07-17 13:15:50,363 INFO L271 CegarLoopResult]: At program point L54-3(line 54) the Hoare annotation is: true [2020-07-17 13:15:50,364 INFO L264 CegarLoopResult]: At program point L50(line 50) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-17 13:15:50,364 INFO L271 CegarLoopResult]: At program point L54-4(line 54) the Hoare annotation is: true [2020-07-17 13:15:50,364 INFO L264 CegarLoopResult]: At program point L50-1(lines 50 56) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-17 13:15:50,364 INFO L264 CegarLoopResult]: At program point L48(line 48) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-17 13:15:50,364 INFO L264 CegarLoopResult]: At program point L50-2(line 50) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-17 13:15:50,364 INFO L264 CegarLoopResult]: At program point L50-3(line 50) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-17 13:15:50,365 INFO L271 CegarLoopResult]: At program point L55(line 55) the Hoare annotation is: true [2020-07-17 13:15:50,365 INFO L264 CegarLoopResult]: At program point L51(line 51) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-17 13:15:50,365 INFO L264 CegarLoopResult]: At program point L51-1(line 51) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-17 13:15:50,365 INFO L264 CegarLoopResult]: At program point L51-2(line 51) the Hoare annotation is: (= |#valid| |old(#valid)|) [2020-07-17 13:15:50,365 INFO L271 CegarLoopResult]: At program point tree_delFINAL(lines 47 57) the Hoare annotation is: true [2020-07-17 13:15:50,365 INFO L264 CegarLoopResult]: At program point L51-3(line 51) the Hoare annotation is: (= |#valid| |old(#valid)|) [2020-07-17 13:15:50,366 INFO L264 CegarLoopResult]: At program point L47(lines 47 57) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-17 13:15:50,366 INFO L264 CegarLoopResult]: At program point L51-4(line 51) the Hoare annotation is: (= |#valid| |old(#valid)|) [2020-07-17 13:15:50,366 INFO L264 CegarLoopResult]: At program point L51-5(line 51) the Hoare annotation is: (= |#valid| |old(#valid)|) [2020-07-17 13:15:50,366 INFO L264 CegarLoopResult]: At program point L51-6(line 51) the Hoare annotation is: (= |#valid| |old(#valid)|) [2020-07-17 13:15:50,366 INFO L271 CegarLoopResult]: At program point tree_delEXIT(lines 47 57) the Hoare annotation is: true [2020-07-17 13:15:50,366 INFO L271 CegarLoopResult]: At program point L51-7(line 51) the Hoare annotation is: true [2020-07-17 13:15:50,366 INFO L264 CegarLoopResult]: At program point tree_delENTRY(lines 47 57) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-17 13:15:50,387 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_task_~a~1_6,QUANTIFIED] [2020-07-17 13:15:50,388 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-17 13:15:50,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 01:15:50 BoogieIcfgContainer [2020-07-17 13:15:50,391 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 13:15:50,393 INFO L168 Benchmark]: Toolchain (without parser) took 22488.04 ms. Allocated memory was 145.2 MB in the beginning and 332.9 MB in the end (delta: 187.7 MB). Free memory was 103.1 MB in the beginning and 207.5 MB in the end (delta: -104.4 MB). Peak memory consumption was 201.5 MB. Max. memory is 7.1 GB. [2020-07-17 13:15:50,394 INFO L168 Benchmark]: CDTParser took 0.90 ms. Allocated memory is still 145.2 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-17 13:15:50,395 INFO L168 Benchmark]: CACSL2BoogieTranslator took 424.67 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 102.6 MB in the beginning and 179.1 MB in the end (delta: -76.4 MB). Peak memory consumption was 19.7 MB. Max. memory is 7.1 GB. [2020-07-17 13:15:50,396 INFO L168 Benchmark]: Boogie Preprocessor took 55.64 ms. Allocated memory is still 202.4 MB. Free memory was 179.1 MB in the beginning and 176.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-07-17 13:15:50,397 INFO L168 Benchmark]: RCFGBuilder took 739.58 ms. Allocated memory is still 202.4 MB. Free memory was 176.4 MB in the beginning and 134.0 MB in the end (delta: 42.4 MB). Peak memory consumption was 42.4 MB. Max. memory is 7.1 GB. [2020-07-17 13:15:50,397 INFO L168 Benchmark]: TraceAbstraction took 21261.80 ms. Allocated memory was 202.4 MB in the beginning and 332.9 MB in the end (delta: 130.5 MB). Free memory was 133.3 MB in the beginning and 207.5 MB in the end (delta: -74.2 MB). Peak memory consumption was 174.6 MB. Max. memory is 7.1 GB. [2020-07-17 13:15:50,401 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.90 ms. Allocated memory is still 145.2 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 424.67 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 102.6 MB in the beginning and 179.1 MB in the end (delta: -76.4 MB). Peak memory consumption was 19.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 55.64 ms. Allocated memory is still 202.4 MB. Free memory was 179.1 MB in the beginning and 176.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 739.58 ms. Allocated memory is still 202.4 MB. Free memory was 176.4 MB in the beginning and 134.0 MB in the end (delta: 42.4 MB). Peak memory consumption was 42.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 21261.80 ms. Allocated memory was 202.4 MB in the beginning and 332.9 MB in the end (delta: 130.5 MB). Free memory was 133.3 MB in the beginning and 207.5 MB in the end (delta: -74.2 MB). Peak memory consumption was 174.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_task_~a~1_6,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 14]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: x == calloc(n, sizeof(int)) && calloc(n, sizeof(int)) == x - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: cond == \old(cond) - ProcedureContractResult [Line: 34]: Procedure Contract for min Derived contract for procedure min: 1 - ProcedureContractResult [Line: 75]: Procedure Contract for task Derived contract for procedure task: x == calloc(n, sizeof(int)) && calloc(n, sizeof(int)) == x - ProcedureContractResult [Line: 70]: Procedure Contract for size Derived contract for procedure size: ((t == t && t == t) && (!(t == 0) || !(0 == t))) || ((t == t && 0 == \result) && t == t) - ProcedureContractResult [Line: 22]: Procedure Contract for nondet_tree Derived contract for procedure nondet_tree: 1 - ProcedureContractResult [Line: 8]: Procedure Contract for assume_cycle_if_not Derived contract for procedure assume_cycle_if_not: cond == \old(cond) && !(0 == \old(cond)) - ProcedureContractResult [Line: 99]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 13]: Procedure Contract for __VERIFIER_assert [2020-07-17 13:15:50,414 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_task_~a~1_6,QUANTIFIED] [2020-07-17 13:15:50,414 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-17 13:15:50,414 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_task_~a~1_6,QUANTIFIED] [2020-07-17 13:15:50,414 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived contract for procedure __VERIFIER_assert: (forall v_task_~a~1_6 : int :: !(\old(cond) == (if unknown-#memory_int-unknown[x][x] == v_task_~a~1_6 then 1 else 0))) || \old(cond) == cond - ProcedureContractResult [Line: -1]: Procedure Contract for #Ultimate.meminit Derived contract for procedure #Ultimate.meminit: 1 - ProcedureContractResult [Line: 59]: Procedure Contract for tree_inorder Derived contract for procedure tree_inorder: 1 - ProcedureContractResult [Line: 47]: Procedure Contract for tree_del Derived contract for procedure tree_del: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 12 procedures, 190 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 8.7s, OverallIterations: 2, TraceHistogramMax: 4, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 12.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 315 SDtfs, 529 SDslu, 1710 SDs, 0 SdLazy, 3956 SolverSat, 209 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 145 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 682 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=190occurred 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.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 13 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 190 LocationsWithAnnotation, 1001 PreInvPairs, 1151 NumberOfFragments, 2272 HoareAnnotationTreeSize, 1001 FomulaSimplifications, 3801 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 190 FomulaSimplificationsInter, 2991 FormulaSimplificationTreeSizeReductionInter, 11.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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 correct! Received shutdown request...