java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-10-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0302a3f [2019-02-27 12:57:30,315 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-27 12:57:30,317 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-27 12:57:30,334 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-27 12:57:30,335 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-27 12:57:30,336 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-27 12:57:30,338 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-27 12:57:30,340 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-27 12:57:30,342 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-27 12:57:30,350 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-27 12:57:30,351 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-27 12:57:30,352 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-27 12:57:30,353 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-27 12:57:30,353 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-27 12:57:30,357 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-27 12:57:30,358 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-27 12:57:30,360 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-27 12:57:30,364 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-27 12:57:30,367 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-27 12:57:30,369 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-27 12:57:30,370 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-27 12:57:30,372 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-27 12:57:30,375 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-27 12:57:30,375 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-27 12:57:30,376 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-27 12:57:30,376 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-27 12:57:30,377 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-27 12:57:30,378 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-27 12:57:30,379 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-27 12:57:30,382 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-27 12:57:30,383 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-27 12:57:30,383 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-27 12:57:30,383 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-27 12:57:30,384 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-27 12:57:30,385 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-27 12:57:30,386 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-27 12:57:30,387 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-02-27 12:57:30,414 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-27 12:57:30,414 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-27 12:57:30,415 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-27 12:57:30,415 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-27 12:57:30,416 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-27 12:57:30,416 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-27 12:57:30,416 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-27 12:57:30,416 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-27 12:57:30,416 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-27 12:57:30,417 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-27 12:57:30,417 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-27 12:57:30,417 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-27 12:57:30,417 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-27 12:57:30,417 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-27 12:57:30,418 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-27 12:57:30,418 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-27 12:57:30,418 INFO L133 SettingsManager]: * Use SBE=true [2019-02-27 12:57:30,419 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-27 12:57:30,419 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-27 12:57:30,419 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-27 12:57:30,419 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-27 12:57:30,419 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-27 12:57:30,419 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-27 12:57:30,420 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-27 12:57:30,420 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-27 12:57:30,420 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-27 12:57:30,420 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-27 12:57:30,420 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-27 12:57:30,421 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-27 12:57:30,421 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-27 12:57:30,421 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-27 12:57:30,421 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-27 12:57:30,421 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-27 12:57:30,421 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-27 12:57:30,422 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-27 12:57:30,422 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-27 12:57:30,422 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-27 12:57:30,422 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-27 12:57:30,422 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-27 12:57:30,423 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-27 12:57:30,452 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-27 12:57:30,464 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-27 12:57:30,468 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-27 12:57:30,470 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-27 12:57:30,471 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-27 12:57:30,472 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-10-limited.bpl [2019-02-27 12:57:30,472 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-10-limited.bpl' [2019-02-27 12:57:30,519 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-27 12:57:30,520 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-27 12:57:30,521 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-27 12:57:30,521 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-27 12:57:30,521 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-27 12:57:30,539 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 12:57:30" (1/1) ... [2019-02-27 12:57:30,552 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 12:57:30" (1/1) ... [2019-02-27 12:57:30,583 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-27 12:57:30,584 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-27 12:57:30,584 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-27 12:57:30,584 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-27 12:57:30,595 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 12:57:30" (1/1) ... [2019-02-27 12:57:30,595 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 12:57:30" (1/1) ... [2019-02-27 12:57:30,598 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 12:57:30" (1/1) ... [2019-02-27 12:57:30,598 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 12:57:30" (1/1) ... [2019-02-27 12:57:30,603 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 12:57:30" (1/1) ... [2019-02-27 12:57:30,607 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 12:57:30" (1/1) ... [2019-02-27 12:57:30,608 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 12:57:30" (1/1) ... [2019-02-27 12:57:30,611 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-27 12:57:30,611 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-27 12:57:30,612 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-27 12:57:30,612 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-27 12:57:30,613 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 12:57:30" (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 [2019-02-27 12:57:30,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-27 12:57:30,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-27 12:57:32,026 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-27 12:57:32,026 INFO L286 CfgBuilder]: Removed 23 assue(true) statements. [2019-02-27 12:57:32,028 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.02 12:57:32 BoogieIcfgContainer [2019-02-27 12:57:32,028 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-27 12:57:32,029 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-27 12:57:32,029 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-27 12:57:32,032 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-27 12:57:32,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 12:57:30" (1/2) ... [2019-02-27 12:57:32,034 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50f8822 and model type speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.02 12:57:32, skipping insertion in model container [2019-02-27 12:57:32,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.02 12:57:32" (2/2) ... [2019-02-27 12:57:32,036 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-10-limited.bpl [2019-02-27 12:57:32,057 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-27 12:57:32,065 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2019-02-27 12:57:32,082 INFO L257 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2019-02-27 12:57:32,113 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-27 12:57:32,113 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-27 12:57:32,114 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-27 12:57:32,114 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-27 12:57:32,114 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-27 12:57:32,114 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-27 12:57:32,114 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-27 12:57:32,114 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-27 12:57:32,130 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-02-27 12:57:32,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-27 12:57:32,136 INFO L394 BasicCegarLoop]: Found error trace [2019-02-27 12:57:32,137 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-27 12:57:32,140 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr9ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-27 12:57:32,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 12:57:32,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1004, now seen corresponding path program 1 times [2019-02-27 12:57:32,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-27 12:57:32,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:57:32,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-27 12:57:32,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:57:32,192 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-27 12:57:32,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:57:32,430 INFO L273 TraceCheckUtils]: 0: Hoare triple {26#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8, main_p9, main_p10;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p4 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p5 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p6 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p7 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p8 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p9 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p10 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;assume main_p3 < main_p4;assume main_p4 < main_p5;assume main_p5 < main_p6;assume main_p6 < main_p7;assume main_p7 < main_p8;assume main_p8 < main_p9;assume main_p9 < main_p10;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0];#memory_int := #memory_int[main_p4 := 0];#memory_int := #memory_int[main_p5 := 0];#memory_int := #memory_int[main_p6 := 0];#memory_int := #memory_int[main_p7 := 0];#memory_int := #memory_int[main_p8 := 0];#memory_int := #memory_int[main_p9 := 0];#memory_int := #memory_int[main_p10 := 0]; {28#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-02-27 12:57:32,451 INFO L273 TraceCheckUtils]: 1: Hoare triple {28#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {27#false} is VALID [2019-02-27 12:57:32,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-27 12:57:32,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-27 12:57:32,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-27 12:57:32,460 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-27 12:57:32,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-27 12:57:32,468 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-27 12:57:32,472 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-02-27 12:57:32,501 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-27 12:57:32,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-27 12:57:32,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-27 12:57:32,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-27 12:57:32,514 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2019-02-27 12:57:33,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:57:33,085 INFO L93 Difference]: Finished difference Result 45 states and 63 transitions. [2019-02-27 12:57:33,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-27 12:57:33,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-27 12:57:33,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-27 12:57:33,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-27 12:57:33,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2019-02-27 12:57:33,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-27 12:57:33,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2019-02-27 12:57:33,097 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 63 transitions. [2019-02-27 12:57:33,558 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-27 12:57:33,577 INFO L225 Difference]: With dead ends: 45 [2019-02-27 12:57:33,577 INFO L226 Difference]: Without dead ends: 40 [2019-02-27 12:57:33,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-27 12:57:33,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-02-27 12:57:33,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 22. [2019-02-27 12:57:33,655 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-27 12:57:33,655 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 22 states. [2019-02-27 12:57:33,656 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 22 states. [2019-02-27 12:57:33,656 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 22 states. [2019-02-27 12:57:33,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:57:33,668 INFO L93 Difference]: Finished difference Result 40 states and 58 transitions. [2019-02-27 12:57:33,668 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2019-02-27 12:57:33,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:57:33,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:57:33,671 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 40 states. [2019-02-27 12:57:33,672 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 40 states. [2019-02-27 12:57:33,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 12:57:33,686 INFO L93 Difference]: Finished difference Result 40 states and 58 transitions. [2019-02-27 12:57:33,686 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2019-02-27 12:57:33,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 12:57:33,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 12:57:33,690 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-27 12:57:33,690 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-27 12:57:33,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-02-27 12:57:33,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 41 transitions. [2019-02-27 12:57:33,698 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 41 transitions. Word has length 2 [2019-02-27 12:57:33,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-27 12:57:33,699 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 41 transitions. [2019-02-27 12:57:33,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-27 12:57:33,699 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 41 transitions. [2019-02-27 12:57:33,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-27 12:57:33,700 INFO L394 BasicCegarLoop]: Found error trace [2019-02-27 12:57:33,700 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-27 12:57:33,701 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr9ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-27 12:57:33,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 12:57:33,701 INFO L82 PathProgramCache]: Analyzing trace with hash 30392, now seen corresponding path program 1 times [2019-02-27 12:57:33,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-27 12:57:33,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:57:33,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-27 12:57:33,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 12:57:33,704 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-27 12:57:33,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:57:34,149 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-02-27 12:57:34,242 INFO L273 TraceCheckUtils]: 0: Hoare triple {182#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8, main_p9, main_p10;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p4 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p5 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p6 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p7 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p8 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p9 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p10 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;assume main_p3 < main_p4;assume main_p4 < main_p5;assume main_p5 < main_p6;assume main_p6 < main_p7;assume main_p7 < main_p8;assume main_p8 < main_p9;assume main_p9 < main_p10;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0];#memory_int := #memory_int[main_p4 := 0];#memory_int := #memory_int[main_p5 := 0];#memory_int := #memory_int[main_p6 := 0];#memory_int := #memory_int[main_p7 := 0];#memory_int := #memory_int[main_p8 := 0];#memory_int := #memory_int[main_p9 := 0];#memory_int := #memory_int[main_p10 := 0]; {184#(and (= 0 (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)))} is VALID [2019-02-27 12:57:34,248 INFO L273 TraceCheckUtils]: 1: Hoare triple {184#(and (= 0 (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)))} #memory_int := #memory_int[main_p4 := #memory_int[main_p4] - 1]; {185#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-02-27 12:57:34,249 INFO L273 TraceCheckUtils]: 2: Hoare triple {185#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {183#false} is VALID [2019-02-27 12:57:34,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-27 12:57:34,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-27 12:57:34,250 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-27 12:57:34,251 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-27 12:57:34,253 INFO L207 CegarAbsIntRunner]: [0], [18], [43] [2019-02-27 12:57:34,288 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-27 12:57:34,289 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-27 12:57:34,416 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-27 12:57:34,417 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 122 root evaluator evaluations with a maximum evaluation depth of 3. Performed 122 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-27 12:57:34,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 12:57:34,424 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-27 12:57:34,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-27 12:57:34,424 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-27 12:57:34,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-27 12:57:34,434 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-27 12:57:34,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:57:34,537 WARN L254 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 22 conjunts are in the unsatisfiable core [2019-02-27 12:57:34,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 12:57:34,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-27 12:57:34,722 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 36 [2019-02-27 12:57:34,785 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:34,788 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 42 [2019-02-27 12:57:34,859 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:34,861 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:34,863 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 52 [2019-02-27 12:57:34,943 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:34,965 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:34,967 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:34,969 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 66 [2019-02-27 12:57:35,031 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:35,033 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:35,034 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:35,037 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:35,040 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 84 [2019-02-27 12:57:35,093 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:35,097 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:35,098 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:35,108 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:35,110 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:35,113 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 106 [2019-02-27 12:57:35,223 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:35,227 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:35,233 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:35,253 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:35,259 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:35,261 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:35,264 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 132 [2019-02-27 12:57:35,373 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:35,396 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:35,413 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:35,430 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:35,435 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:35,436 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:35,437 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:35,440 INFO L292 Elim1Store]: Index analysis took 108 ms [2019-02-27 12:57:35,442 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 162 [2019-02-27 12:57:35,671 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:35,672 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:35,674 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:35,675 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:35,677 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:35,678 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:35,680 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:35,681 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:35,687 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 196 [2019-02-27 12:57:35,872 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:35,881 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:35,883 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:35,884 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:35,885 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:35,886 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:35,888 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:35,890 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:35,892 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:35,897 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 231 [2019-02-27 12:57:35,910 INFO L301 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-27 12:57:36,222 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 12:57:36,331 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 12:57:36,424 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 12:57:36,509 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 12:57:36,574 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 12:57:36,625 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 12:57:36,680 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 12:57:36,729 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 12:57:36,822 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 12:57:36,948 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:36,950 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:36,951 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:36,953 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:36,954 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:36,956 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:36,968 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:36,969 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:36,971 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:36,973 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:36,974 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:36,986 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:36,987 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:36,988 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:36,989 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:36,991 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:36,992 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:36,995 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:36,996 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:37,009 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:37,019 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:37,020 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:37,022 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:37,040 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:37,041 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:37,042 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:37,043 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:37,045 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:37,046 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:37,047 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:37,049 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:37,050 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:37,052 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:37,054 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-27 12:57:37,058 INFO L301 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-02-27 12:57:37,060 INFO L301 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 12:57:37,062 INFO L301 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 12:57:37,064 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 12:57:37,067 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 12:57:37,070 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 12:57:37,141 INFO L301 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-1 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2019-02-27 12:57:37,142 INFO L208 ElimStorePlain]: Needed 17 recursive calls to eliminate 10 variables, input treesize:155, output treesize:78 [2019-02-27 12:57:39,630 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-27 12:57:39,631 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_52|, ULTIMATE.start_main_p2, ULTIMATE.start_main_p3, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6, ULTIMATE.start_main_p7, ULTIMATE.start_main_p8, ULTIMATE.start_main_p9, ULTIMATE.start_main_p10, |v_#valid_12|]. (let ((.cse1 (store |v_#valid_12| ULTIMATE.start_main_p1 1))) (let ((.cse2 (store (store .cse1 ULTIMATE.start_main_p2 1) ULTIMATE.start_main_p3 1))) (let ((.cse0 (store (store .cse2 ULTIMATE.start_main_p4 1) ULTIMATE.start_main_p5 1))) (let ((.cse3 (store .cse0 ULTIMATE.start_main_p6 1))) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= (select .cse0 ULTIMATE.start_main_p6) 0) (< ULTIMATE.start_main_p9 ULTIMATE.start_main_p10) (= (store (store (store (store (store (store (store (store (store (store |v_#memory_int_52| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0) ULTIMATE.start_main_p3 0) ULTIMATE.start_main_p4 0) ULTIMATE.start_main_p5 0) ULTIMATE.start_main_p6 0) ULTIMATE.start_main_p7 0) ULTIMATE.start_main_p8 0) ULTIMATE.start_main_p9 0) ULTIMATE.start_main_p10 0) |#memory_int|) (= 0 (select .cse1 ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= 0 (select .cse2 ULTIMATE.start_main_p4)) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (select .cse3 ULTIMATE.start_main_p7) 0) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (< ULTIMATE.start_main_p8 ULTIMATE.start_main_p9) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (= 0 (select (store (store .cse3 ULTIMATE.start_main_p7 1) ULTIMATE.start_main_p8 1) ULTIMATE.start_main_p9)) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)))))) [2019-02-27 12:57:39,631 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3, ULTIMATE.start_main_p10, ULTIMATE.start_main_p9, ULTIMATE.start_main_p2, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6, ULTIMATE.start_main_p7, ULTIMATE.start_main_p8]. (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p10)) (< ULTIMATE.start_main_p9 ULTIMATE.start_main_p10) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= 0 (select |#memory_int| ULTIMATE.start_main_p9)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (< ULTIMATE.start_main_p8 ULTIMATE.start_main_p9) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p6))) [2019-02-27 12:57:42,333 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:42,357 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:42,377 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:42,379 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:42,381 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:42,383 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:42,384 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:42,385 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:42,386 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:42,387 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:42,389 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:42,390 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:42,391 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:42,393 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:42,394 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:42,396 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:42,397 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:42,399 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:42,400 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:42,402 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:42,404 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:42,405 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:42,406 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:42,407 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:42,408 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:42,409 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:42,410 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:42,412 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:42,413 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:42,414 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:42,416 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:42,417 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:42,419 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:42,425 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:42,426 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:42,427 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:42,428 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:42,430 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:42,431 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:42,433 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:42,443 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:42,445 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:42,446 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:42,446 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:42,448 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:42,449 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 12:57:42,449 INFO L292 Elim1Store]: Index analysis took 144 ms [2019-02-27 12:57:42,453 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 46 disjoint index pairs (out of 45 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 231 [2019-02-27 12:57:42,482 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-27 12:57:42,800 INFO L301 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-1 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2019-02-27 12:57:42,801 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 10 variables, input treesize:88, output treesize:78 [2019-02-27 12:57:44,876 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-27 12:57:44,877 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_53|, ULTIMATE.start_main_p4, ULTIMATE.start_main_p9, ULTIMATE.start_main_p3, ULTIMATE.start_main_p7, ULTIMATE.start_main_p10, ULTIMATE.start_main_p8, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6, ULTIMATE.start_main_p2]. (let ((.cse0 (select |v_#memory_int_53| ULTIMATE.start_main_p4))) (and (= (select |v_#memory_int_53| ULTIMATE.start_main_p9) 0) (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= (select |v_#memory_int_53| ULTIMATE.start_main_p7) 0) (< ULTIMATE.start_main_p9 ULTIMATE.start_main_p10) (= (select |v_#memory_int_53| ULTIMATE.start_main_p8) 0) (= .cse0 0) (= (select |v_#memory_int_53| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (select |v_#memory_int_53| ULTIMATE.start_main_p5) 0) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= (store |v_#memory_int_53| ULTIMATE.start_main_p4 (+ .cse0 (- 1))) |#memory_int|) (< ULTIMATE.start_main_p8 ULTIMATE.start_main_p9) (= (select |v_#memory_int_53| ULTIMATE.start_main_p6) 0) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (= (select |v_#memory_int_53| ULTIMATE.start_main_p2) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |v_#memory_int_53| ULTIMATE.start_main_p10)) (= (select |v_#memory_int_53| ULTIMATE.start_main_p1) 0))) [2019-02-27 12:57:44,877 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, ULTIMATE.start_main_p10, ULTIMATE.start_main_p9, ULTIMATE.start_main_p2, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6, ULTIMATE.start_main_p7, ULTIMATE.start_main_p8]. (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p10)) (< ULTIMATE.start_main_p9 ULTIMATE.start_main_p10) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= 0 (select |#memory_int| ULTIMATE.start_main_p9)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= (select |#memory_int| ULTIMATE.start_main_p4) (- 1)) (< ULTIMATE.start_main_p8 ULTIMATE.start_main_p9) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6))) [2019-02-27 12:57:50,753 INFO L273 TraceCheckUtils]: 0: Hoare triple {182#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8, main_p9, main_p10;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p4 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p5 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p6 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p7 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p8 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p9 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p10 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;assume main_p3 < main_p4;assume main_p4 < main_p5;assume main_p5 < main_p6;assume main_p6 < main_p7;assume main_p7 < main_p8;assume main_p8 < main_p9;assume main_p9 < main_p10;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0];#memory_int := #memory_int[main_p4 := 0];#memory_int := #memory_int[main_p5 := 0];#memory_int := #memory_int[main_p6 := 0];#memory_int := #memory_int[main_p7 := 0];#memory_int := #memory_int[main_p8 := 0];#memory_int := #memory_int[main_p9 := 0];#memory_int := #memory_int[main_p10 := 0]; {189#(and (exists ((ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p10 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p8 Int) (ULTIMATE.start_main_p9 Int)) (and (= 0 (select |#memory_int| ULTIMATE.start_main_p10)) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (< ULTIMATE.start_main_p9 ULTIMATE.start_main_p10) (< ULTIMATE.start_main_p8 ULTIMATE.start_main_p9) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (= 0 (select |#memory_int| ULTIMATE.start_main_p9)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (= (select |#memory_int| ULTIMATE.start_main_p4) 0))} is VALID [2019-02-27 12:57:53,259 INFO L273 TraceCheckUtils]: 1: Hoare triple {189#(and (exists ((ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p10 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p8 Int) (ULTIMATE.start_main_p9 Int)) (and (= 0 (select |#memory_int| ULTIMATE.start_main_p10)) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (< ULTIMATE.start_main_p9 ULTIMATE.start_main_p10) (< ULTIMATE.start_main_p8 ULTIMATE.start_main_p9) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (= 0 (select |#memory_int| ULTIMATE.start_main_p9)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (= (select |#memory_int| ULTIMATE.start_main_p4) 0))} #memory_int := #memory_int[main_p4 := #memory_int[main_p4] - 1]; {193#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p10 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p8 Int) (ULTIMATE.start_main_p9 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p10)) (< ULTIMATE.start_main_p9 ULTIMATE.start_main_p10) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p9)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= (+ (select |#memory_int| ULTIMATE.start_main_p4) 1) 0) (< ULTIMATE.start_main_p8 ULTIMATE.start_main_p9) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))))} is UNKNOWN [2019-02-27 12:57:53,261 INFO L273 TraceCheckUtils]: 2: Hoare triple {193#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p10 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p8 Int) (ULTIMATE.start_main_p9 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p10)) (< ULTIMATE.start_main_p9 ULTIMATE.start_main_p10) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p9)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p6 ULTIMATE.start_main_p7) (= (+ (select |#memory_int| ULTIMATE.start_main_p4) 1) 0) (< ULTIMATE.start_main_p8 ULTIMATE.start_main_p9) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (< ULTIMATE.start_main_p7 ULTIMATE.start_main_p8) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))))} assume !(#memory_int[main_p1] >= 0); {183#false} is VALID [2019-02-27 12:57:53,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-27 12:57:53,261 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-27 12:57:53,299 INFO L273 TraceCheckUtils]: 2: Hoare triple {197#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {183#false} is VALID [2019-02-27 12:57:53,300 INFO L273 TraceCheckUtils]: 1: Hoare triple {201#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1))} #memory_int := #memory_int[main_p4 := #memory_int[main_p4] - 1]; {197#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2019-02-27 12:57:53,303 INFO L273 TraceCheckUtils]: 0: Hoare triple {182#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8, main_p9, main_p10;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p1 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p2 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p3 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p4 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p5 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p6 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p7 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p8 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p9 := malloc_ptr;malloc_old_#valid := #valid;havoc malloc_ptr;havoc #valid;assume malloc_old_#valid[malloc_ptr] == 0;assume #valid == malloc_old_#valid[malloc_ptr := 1];main_p10 := malloc_ptr;assume main_p1 < main_p2;assume main_p2 < main_p3;assume main_p3 < main_p4;assume main_p4 < main_p5;assume main_p5 < main_p6;assume main_p6 < main_p7;assume main_p7 < main_p8;assume main_p8 < main_p9;assume main_p9 < main_p10;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0];#memory_int := #memory_int[main_p4 := 0];#memory_int := #memory_int[main_p5 := 0];#memory_int := #memory_int[main_p6 := 0];#memory_int := #memory_int[main_p7 := 0];#memory_int := #memory_int[main_p8 := 0];#memory_int := #memory_int[main_p9 := 0];#memory_int := #memory_int[main_p10 := 0]; {201#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1))} is VALID [2019-02-27 12:57:53,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-27 12:57:53,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-27 12:57:53,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-27 12:57:53,326 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-27 12:57:53,326 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-27 12:57:53,326 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-27 12:57:53,327 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2019-02-27 12:57:55,909 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 5 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2019-02-27 12:57:55,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-27 12:57:55,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-27 12:57:55,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=31, Unknown=1, NotChecked=0, Total=56 [2019-02-27 12:57:55,910 INFO L87 Difference]: Start difference. First operand 22 states and 41 transitions. Second operand 6 states. [2019-02-27 12:58:01,328 WARN L181 SmtUtils]: Spent 2.95 s on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-02-27 12:58:06,474 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-02-27 12:58:06,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-27 12:58:06,476 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUtils.isInductiveHelper(PredicateUtils.java:346) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.isInductive(MonolithicHoareTripleChecker.java:208) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.isInductive(MonolithicHoareTripleChecker.java:163) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.MonolithicHoareTripleChecker.checkInternal(MonolithicHoareTripleChecker.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.EfficientHoareTripleChecker.reviewInductiveInternal(EfficientHoareTripleChecker.java:113) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.EfficientHoareTripleChecker.checkInternal(EfficientHoareTripleChecker.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:699) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:628) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:472) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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:316) 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) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 43 more [2019-02-27 12:58:06,480 INFO L168 Benchmark]: Toolchain (without parser) took 35961.08 ms. Allocated memory was 138.4 MB in the beginning and 266.3 MB in the end (delta: 127.9 MB). Free memory was 105.6 MB in the beginning and 110.1 MB in the end (delta: -4.5 MB). Peak memory consumption was 123.4 MB. Max. memory is 7.1 GB. [2019-02-27 12:58:06,482 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 138.4 MB. Free memory is still 107.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-27 12:58:06,482 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.02 ms. Allocated memory is still 138.4 MB. Free memory was 105.6 MB in the beginning and 102.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-02-27 12:58:06,483 INFO L168 Benchmark]: Boogie Preprocessor took 27.50 ms. Allocated memory is still 138.4 MB. Free memory was 102.8 MB in the beginning and 101.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-02-27 12:58:06,484 INFO L168 Benchmark]: RCFGBuilder took 1416.50 ms. Allocated memory is still 138.4 MB. Free memory was 101.2 MB in the beginning and 60.6 MB in the end (delta: 40.7 MB). Peak memory consumption was 40.7 MB. Max. memory is 7.1 GB. [2019-02-27 12:58:06,485 INFO L168 Benchmark]: TraceAbstraction took 34450.24 ms. Allocated memory was 138.4 MB in the beginning and 266.3 MB in the end (delta: 127.9 MB). Free memory was 60.4 MB in the beginning and 110.1 MB in the end (delta: -49.7 MB). Peak memory consumption was 78.2 MB. Max. memory is 7.1 GB. [2019-02-27 12:58:06,489 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 138.4 MB. Free memory is still 107.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.02 ms. Allocated memory is still 138.4 MB. Free memory was 105.6 MB in the beginning and 102.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.50 ms. Allocated memory is still 138.4 MB. Free memory was 102.8 MB in the beginning and 101.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1416.50 ms. Allocated memory is still 138.4 MB. Free memory was 101.2 MB in the beginning and 60.6 MB in the end (delta: 40.7 MB). Peak memory consumption was 40.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 34450.24 ms. Allocated memory was 138.4 MB in the beginning and 266.3 MB in the end (delta: 127.9 MB). Free memory was 60.4 MB in the beginning and 110.1 MB in the end (delta: -49.7 MB). Peak memory consumption was 78.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...