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-9-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0302a3f [2019-02-27 13:08:08,579 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-27 13:08:08,580 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-27 13:08:08,597 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-27 13:08:08,597 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-27 13:08:08,598 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-27 13:08:08,599 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-27 13:08:08,601 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-27 13:08:08,603 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-27 13:08:08,603 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-27 13:08:08,604 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-27 13:08:08,605 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-27 13:08:08,606 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-27 13:08:08,606 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-27 13:08:08,608 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-27 13:08:08,608 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-27 13:08:08,609 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-27 13:08:08,611 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-27 13:08:08,613 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-27 13:08:08,615 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-27 13:08:08,616 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-27 13:08:08,617 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-27 13:08:08,621 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-27 13:08:08,622 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-27 13:08:08,622 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-27 13:08:08,623 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-27 13:08:08,624 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-27 13:08:08,624 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-27 13:08:08,625 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-27 13:08:08,626 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-27 13:08:08,626 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-27 13:08:08,627 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-27 13:08:08,627 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-27 13:08:08,628 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-27 13:08:08,629 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-27 13:08:08,630 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-27 13:08:08,631 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 13:08:08,648 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-27 13:08:08,648 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-27 13:08:08,649 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-27 13:08:08,649 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-27 13:08:08,650 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-27 13:08:08,650 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-27 13:08:08,650 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-27 13:08:08,650 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-27 13:08:08,650 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-27 13:08:08,651 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-27 13:08:08,651 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-27 13:08:08,651 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-27 13:08:08,651 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-27 13:08:08,651 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-27 13:08:08,652 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-27 13:08:08,652 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-27 13:08:08,653 INFO L133 SettingsManager]: * Use SBE=true [2019-02-27 13:08:08,653 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-27 13:08:08,653 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-27 13:08:08,653 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-27 13:08:08,653 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-27 13:08:08,653 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-27 13:08:08,654 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-27 13:08:08,654 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-27 13:08:08,654 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-27 13:08:08,654 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-27 13:08:08,654 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-27 13:08:08,655 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-27 13:08:08,656 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-27 13:08:08,657 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-27 13:08:08,657 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-27 13:08:08,657 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-27 13:08:08,657 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-27 13:08:08,657 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-27 13:08:08,658 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-27 13:08:08,658 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-27 13:08:08,658 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-27 13:08:08,658 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-27 13:08:08,658 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-27 13:08:08,658 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-27 13:08:08,697 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-27 13:08:08,710 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-27 13:08:08,713 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-27 13:08:08,714 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-27 13:08:08,715 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-27 13:08:08,715 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-9-unlimited.bpl [2019-02-27 13:08:08,716 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-9-unlimited.bpl' [2019-02-27 13:08:08,759 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-27 13:08:08,761 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-27 13:08:08,761 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-27 13:08:08,761 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-27 13:08:08,762 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-27 13:08:08,778 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 01:08:08" (1/1) ... [2019-02-27 13:08:08,790 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 01:08:08" (1/1) ... [2019-02-27 13:08:08,819 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-27 13:08:08,820 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-27 13:08:08,820 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-27 13:08:08,820 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-27 13:08:08,830 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 01:08:08" (1/1) ... [2019-02-27 13:08:08,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 01:08:08" (1/1) ... [2019-02-27 13:08:08,833 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 01:08:08" (1/1) ... [2019-02-27 13:08:08,833 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 01:08:08" (1/1) ... [2019-02-27 13:08:08,838 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 01:08:08" (1/1) ... [2019-02-27 13:08:08,842 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 01:08:08" (1/1) ... [2019-02-27 13:08:08,843 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 01:08:08" (1/1) ... [2019-02-27 13:08:08,845 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-27 13:08:08,846 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-27 13:08:08,846 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-27 13:08:08,846 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-27 13:08:08,847 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 01:08:08" (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 13:08:08,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-27 13:08:08,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-27 13:08:10,100 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-27 13:08:10,101 INFO L286 CfgBuilder]: Removed 21 assue(true) statements. [2019-02-27 13:08:10,102 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.02 01:08:10 BoogieIcfgContainer [2019-02-27 13:08:10,102 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-27 13:08:10,104 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-27 13:08:10,104 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-27 13:08:10,107 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-27 13:08:10,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 27.02 01:08:08" (1/2) ... [2019-02-27 13:08:10,108 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77fa6dd9 and model type speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.02 01:08:10, skipping insertion in model container [2019-02-27 13:08:10,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-9-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.02 01:08:10" (2/2) ... [2019-02-27 13:08:10,110 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-9-unlimited.bpl [2019-02-27 13:08:10,118 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-27 13:08:10,125 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2019-02-27 13:08:10,141 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2019-02-27 13:08:10,171 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-27 13:08:10,172 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-27 13:08:10,172 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-27 13:08:10,172 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-27 13:08:10,172 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-27 13:08:10,172 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-27 13:08:10,173 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-27 13:08:10,173 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-27 13:08:10,185 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-02-27 13:08:10,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-27 13:08:10,191 INFO L394 BasicCegarLoop]: Found error trace [2019-02-27 13:08:10,192 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-27 13:08:10,195 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-02-27 13:08:10,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 13:08:10,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1000, now seen corresponding path program 1 times [2019-02-27 13:08:10,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-27 13:08:10,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 13:08:10,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-27 13:08:10,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 13:08:10,258 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-27 13:08:10,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 13:08:10,468 INFO L273 TraceCheckUtils]: 0: Hoare triple {24#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8, main_p9;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;#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]; {26#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-02-27 13:08:10,473 INFO L273 TraceCheckUtils]: 1: Hoare triple {26#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {25#false} is VALID [2019-02-27 13:08:10,475 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 13:08:10,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-27 13:08:10,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-27 13:08:10,477 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-27 13:08:10,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-27 13:08:10,483 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-27 13:08:10,486 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-02-27 13:08:10,512 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 13:08:10,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-27 13:08:10,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-27 13:08:10,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-27 13:08:10,521 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2019-02-27 13:08:10,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 13:08:10,926 INFO L93 Difference]: Finished difference Result 41 states and 57 transitions. [2019-02-27 13:08:10,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-27 13:08:10,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-27 13:08:10,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-27 13:08:10,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-27 13:08:10,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2019-02-27 13:08:10,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-27 13:08:10,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2019-02-27 13:08:10,935 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 57 transitions. [2019-02-27 13:08:11,334 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-27 13:08:11,346 INFO L225 Difference]: With dead ends: 41 [2019-02-27 13:08:11,346 INFO L226 Difference]: Without dead ends: 36 [2019-02-27 13:08:11,349 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 13:08:11,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-02-27 13:08:11,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 20. [2019-02-27 13:08:11,400 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-27 13:08:11,401 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 20 states. [2019-02-27 13:08:11,401 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 20 states. [2019-02-27 13:08:11,401 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 20 states. [2019-02-27 13:08:11,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 13:08:11,409 INFO L93 Difference]: Finished difference Result 36 states and 52 transitions. [2019-02-27 13:08:11,409 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2019-02-27 13:08:11,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 13:08:11,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 13:08:11,410 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 36 states. [2019-02-27 13:08:11,410 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 36 states. [2019-02-27 13:08:11,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 13:08:11,414 INFO L93 Difference]: Finished difference Result 36 states and 52 transitions. [2019-02-27 13:08:11,414 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2019-02-27 13:08:11,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 13:08:11,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 13:08:11,415 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-27 13:08:11,416 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-27 13:08:11,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-02-27 13:08:11,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 37 transitions. [2019-02-27 13:08:11,420 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 37 transitions. Word has length 2 [2019-02-27 13:08:11,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-27 13:08:11,420 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 37 transitions. [2019-02-27 13:08:11,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-27 13:08:11,420 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 37 transitions. [2019-02-27 13:08:11,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-27 13:08:11,421 INFO L394 BasicCegarLoop]: Found error trace [2019-02-27 13:08:11,421 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-27 13:08:11,422 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-02-27 13:08:11,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 13:08:11,422 INFO L82 PathProgramCache]: Analyzing trace with hash 30388, now seen corresponding path program 1 times [2019-02-27 13:08:11,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-27 13:08:11,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 13:08:11,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-27 13:08:11,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 13:08:11,424 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-27 13:08:11,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 13:08:11,556 INFO L273 TraceCheckUtils]: 0: Hoare triple {166#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8, main_p9;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;#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]; {168#(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 13:08:11,562 INFO L273 TraceCheckUtils]: 1: Hoare triple {168#(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]; {169#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-02-27 13:08:11,567 INFO L273 TraceCheckUtils]: 2: Hoare triple {169#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {167#false} is VALID [2019-02-27 13:08:11,567 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 13:08:11,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-27 13:08:11,568 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-27 13:08:11,568 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-27 13:08:11,570 INFO L207 CegarAbsIntRunner]: [0], [18], [39] [2019-02-27 13:08:11,608 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-27 13:08:11,609 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-27 13:08:11,736 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-27 13:08:11,737 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 94 root evaluator evaluations with a maximum evaluation depth of 2. Performed 94 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-27 13:08:11,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 13:08:11,745 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-27 13:08:11,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-27 13:08:11,745 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 13:08:11,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-27 13:08:11,762 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-27 13:08:11,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 13:08:11,801 WARN L254 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 17 conjunts are in the unsatisfiable core [2019-02-27 13:08:11,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 13:08:11,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-27 13:08:12,233 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 30 treesize of output 33 [2019-02-27 13:08:12,285 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:08:12,289 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 33 treesize of output 39 [2019-02-27 13:08:12,358 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:08:12,360 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:08:12,362 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 35 treesize of output 49 [2019-02-27 13:08:12,519 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:08:12,542 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:08:12,563 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:08:12,566 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 37 treesize of output 63 [2019-02-27 13:08:12,644 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:08:12,645 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:08:12,646 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:08:12,648 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:08:12,649 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 39 treesize of output 81 [2019-02-27 13:08:12,692 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:08:12,694 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:08:12,697 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:08:12,699 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:08:12,701 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:08:12,704 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 41 treesize of output 103 [2019-02-27 13:08:12,775 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:08:12,776 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:08:12,777 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:08:12,784 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:08:12,785 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:08:12,786 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:08:12,790 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 43 treesize of output 129 [2019-02-27 13:08:12,901 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:08:12,903 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:08:12,904 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:08:12,906 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:08:12,910 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:08:12,911 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:08:12,914 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:08:12,917 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 45 treesize of output 159 [2019-02-27 13:08:13,091 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 158 [2019-02-27 13:08:13,113 INFO L301 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-27 13:08:13,262 INFO L301 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:08:13,345 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:08:13,444 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:08:13,568 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:08:13,611 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:08:13,646 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:08:13,669 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:08:13,693 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:08:14,188 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 85 [2019-02-27 13:08:14,194 INFO L301 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-02-27 13:08:14,230 INFO L301 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:08:14,249 INFO L301 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:08:14,283 INFO L301 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:08:14,328 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:08:14,376 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:08:14,428 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:08:14,591 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:08:14,783 INFO L301 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-02-27 13:08:14,784 INFO L208 ElimStorePlain]: Needed 18 recursive calls to eliminate 9 variables, input treesize:150, output treesize:158 [2019-02-27 13:08:16,828 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-27 13:08:16,828 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_47|, 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, |v_#valid_11|]. (let ((.cse1 (store |v_#valid_11| ULTIMATE.start_main_p1 1))) (let ((.cse3 (store .cse1 ULTIMATE.start_main_p2 1))) (let ((.cse2 (store .cse3 ULTIMATE.start_main_p3 1))) (let ((.cse0 (store .cse2 ULTIMATE.start_main_p4 1))) (let ((.cse4 (store .cse0 ULTIMATE.start_main_p5 1))) (let ((.cse5 (store .cse4 ULTIMATE.start_main_p6 1))) (and (= (select .cse0 ULTIMATE.start_main_p5) 0) (= 0 (select .cse1 ULTIMATE.start_main_p2)) (= (select .cse2 ULTIMATE.start_main_p4) 0) (= (select .cse3 ULTIMATE.start_main_p3) 0) (= 0 (select .cse4 ULTIMATE.start_main_p6)) (= (store (store (store (store (store (store (store (store (store |v_#memory_int_47| 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) |#memory_int|) (= (select (store .cse5 ULTIMATE.start_main_p7 1) ULTIMATE.start_main_p8) 0) (= (select .cse5 ULTIMATE.start_main_p7) 0)))))))) [2019-02-27 13:08:16,829 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p2, ULTIMATE.start_main_p7, ULTIMATE.start_main_p8, ULTIMATE.start_main_p5, ULTIMATE.start_main_p3, ULTIMATE.start_main_p9, ULTIMATE.start_main_p6]. (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p9)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p4)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p4)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5))) [2019-02-27 13:08:19,535 WARN L181 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2019-02-27 13:08:19,735 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:08:19,737 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 153 [2019-02-27 13:08:19,747 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-27 13:08:19,861 INFO L301 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-02-27 13:08:19,862 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:163, output treesize:125 [2019-02-27 13:08:22,056 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-27 13:08:22,057 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_48|, ULTIMATE.start_main_p4, ULTIMATE.start_main_p2, ULTIMATE.start_main_p7, ULTIMATE.start_main_p8, ULTIMATE.start_main_p5, ULTIMATE.start_main_p3, ULTIMATE.start_main_p6]. (let ((.cse0 (select |v_#memory_int_48| ULTIMATE.start_main_p4))) (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p7)) (= 0 (select |v_#memory_int_48| ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p7)) (= (store |v_#memory_int_48| ULTIMATE.start_main_p4 (+ .cse0 (- 1))) |#memory_int|) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)) (= 0 (select |v_#memory_int_48| ULTIMATE.start_main_p3)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (= 0 (select |v_#memory_int_48| ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p6)) (= 0 (select |v_#memory_int_48| ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p8)) (= 0 (select |v_#memory_int_48| ULTIMATE.start_main_p6)) (= 0 (select |v_#memory_int_48| ULTIMATE.start_main_p2)) (= 0 (select |v_#memory_int_48| ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 .cse0) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5)))) [2019-02-27 13:08:22,057 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p2, ULTIMATE.start_main_p7, ULTIMATE.start_main_p5, ULTIMATE.start_main_p3, ULTIMATE.start_main_p6, ULTIMATE.start_main_p8, ULTIMATE.start_main_p4]. (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p4) (- 1)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5))) [2019-02-27 13:08:24,362 INFO L273 TraceCheckUtils]: 0: Hoare triple {166#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8, main_p9;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;#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]; {173#(and (exists ((ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p8 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p4)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5)))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)))} is VALID [2019-02-27 13:08:25,107 INFO L273 TraceCheckUtils]: 1: Hoare triple {173#(and (exists ((ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p8 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p4)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5)))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)))} #memory_int := #memory_int[main_p4 := #memory_int[main_p4] - 1]; {177#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p4 Int)) (= (+ (select |#memory_int| ULTIMATE.start_main_p4) 1) 0)) (exists ((ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p8 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5)))))} is VALID [2019-02-27 13:08:25,109 INFO L273 TraceCheckUtils]: 2: Hoare triple {177#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p4 Int)) (= (+ (select |#memory_int| ULTIMATE.start_main_p4) 1) 0)) (exists ((ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p8 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5)))))} assume !(#memory_int[main_p1] >= 0); {167#false} is VALID [2019-02-27 13:08:25,109 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 13:08:25,110 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-27 13:08:25,207 INFO L273 TraceCheckUtils]: 2: Hoare triple {181#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {167#false} is VALID [2019-02-27 13:08:25,208 INFO L273 TraceCheckUtils]: 1: Hoare triple {185#(<= 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]; {181#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2019-02-27 13:08:25,212 INFO L273 TraceCheckUtils]: 0: Hoare triple {166#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8, main_p9;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;#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]; {185#(<= 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 13:08:25,213 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 13:08:25,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-27 13:08:25,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-27 13:08:25,235 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-27 13:08:25,235 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-27 13:08:25,236 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-27 13:08:25,236 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2019-02-27 13:08:26,306 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-27 13:08:26,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-27 13:08:26,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-27 13:08:26,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-27 13:08:26,307 INFO L87 Difference]: Start difference. First operand 20 states and 37 transitions. Second operand 6 states. [2019-02-27 13:08:27,192 WARN L181 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-02-27 13:08:28,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 13:08:28,143 INFO L93 Difference]: Finished difference Result 71 states and 104 transitions. [2019-02-27 13:08:28,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-27 13:08:28,143 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-27 13:08:28,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-27 13:08:28,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-27 13:08:28,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2019-02-27 13:08:28,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-27 13:08:28,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2019-02-27 13:08:28,149 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 104 transitions. [2019-02-27 13:08:51,221 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-27 13:08:51,224 INFO L225 Difference]: With dead ends: 71 [2019-02-27 13:08:51,224 INFO L226 Difference]: Without dead ends: 69 [2019-02-27 13:08:51,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-27 13:08:51,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-02-27 13:08:51,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 24. [2019-02-27 13:08:51,276 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-27 13:08:51,276 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 24 states. [2019-02-27 13:08:51,276 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 24 states. [2019-02-27 13:08:51,276 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 24 states. [2019-02-27 13:08:51,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 13:08:51,282 INFO L93 Difference]: Finished difference Result 69 states and 101 transitions. [2019-02-27 13:08:51,282 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 101 transitions. [2019-02-27 13:08:51,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 13:08:51,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 13:08:51,283 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 69 states. [2019-02-27 13:08:51,284 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 69 states. [2019-02-27 13:08:51,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 13:08:51,289 INFO L93 Difference]: Finished difference Result 69 states and 101 transitions. [2019-02-27 13:08:51,289 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 101 transitions. [2019-02-27 13:08:51,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-27 13:08:51,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-27 13:08:51,290 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-27 13:08:51,290 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-27 13:08:51,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-02-27 13:08:51,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 52 transitions. [2019-02-27 13:08:51,293 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 52 transitions. Word has length 3 [2019-02-27 13:08:51,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-27 13:08:51,293 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 52 transitions. [2019-02-27 13:08:51,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-27 13:08:51,294 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 52 transitions. [2019-02-27 13:08:51,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-27 13:08:51,294 INFO L394 BasicCegarLoop]: Found error trace [2019-02-27 13:08:51,294 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-27 13:08:51,295 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr7ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr8ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT]=== [2019-02-27 13:08:51,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 13:08:51,295 INFO L82 PathProgramCache]: Analyzing trace with hash 30884, now seen corresponding path program 1 times [2019-02-27 13:08:51,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-27 13:08:51,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 13:08:51,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-27 13:08:51,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-27 13:08:51,297 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-27 13:08:51,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 13:08:51,447 INFO L273 TraceCheckUtils]: 0: Hoare triple {430#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8, main_p9;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;#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]; {432#(and (= 0 (select (store |#memory_int| ULTIMATE.start_main_p8 (+ (select |#memory_int| ULTIMATE.start_main_p8) (- 1))) ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p8) 0))} is VALID [2019-02-27 13:08:51,452 INFO L273 TraceCheckUtils]: 1: Hoare triple {432#(and (= 0 (select (store |#memory_int| ULTIMATE.start_main_p8 (+ (select |#memory_int| ULTIMATE.start_main_p8) (- 1))) ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p8) 0))} #memory_int := #memory_int[main_p8 := #memory_int[main_p8] - 1]; {433#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-02-27 13:08:51,456 INFO L273 TraceCheckUtils]: 2: Hoare triple {433#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {431#false} is VALID [2019-02-27 13:08:51,456 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 13:08:51,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-27 13:08:51,457 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-27 13:08:51,457 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-27 13:08:51,457 INFO L207 CegarAbsIntRunner]: [0], [34], [39] [2019-02-27 13:08:51,458 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-27 13:08:51,458 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-27 13:08:51,476 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-27 13:08:51,476 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 94 root evaluator evaluations with a maximum evaluation depth of 2. Performed 94 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-27 13:08:51,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-27 13:08:51,477 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-27 13:08:51,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-27 13:08:51,477 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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-27 13:08:51,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-27 13:08:51,486 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-27 13:08:51,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 13:08:51,501 WARN L254 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 17 conjunts are in the unsatisfiable core [2019-02-27 13:08:51,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-27 13:08:51,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-27 13:08:52,065 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 85 [2019-02-27 13:08:52,094 INFO L301 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-27 13:08:52,421 INFO L301 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:08:52,432 INFO L301 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:08:52,445 INFO L301 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:08:52,475 INFO L301 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:08:52,512 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:08:52,564 INFO L301 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:08:52,635 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:08:52,719 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 33 [2019-02-27 13:08:52,748 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 39 [2019-02-27 13:08:52,836 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 18 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 49 [2019-02-27 13:08:52,857 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 22 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 63 [2019-02-27 13:08:52,913 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 25 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 81 [2019-02-27 13:08:53,121 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 27 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-02-27 13:08:53,159 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 28 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 129 [2019-02-27 13:08:53,269 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 45 treesize of output 159 [2019-02-27 13:08:53,355 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 158 [2019-02-27 13:08:53,360 INFO L301 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-02-27 13:08:53,441 INFO L301 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:08:53,503 INFO L301 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:08:53,559 INFO L301 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:08:53,595 INFO L301 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:08:53,625 INFO L301 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:08:53,649 INFO L301 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:08:53,670 INFO L301 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:08:53,690 INFO L301 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-27 13:08:53,813 INFO L301 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-02-27 13:08:53,814 INFO L208 ElimStorePlain]: Needed 18 recursive calls to eliminate 9 variables, input treesize:150, output treesize:158 [2019-02-27 13:08:56,203 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-27 13:08:56,203 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_50|, ULTIMATE.start_main_p2, ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6, ULTIMATE.start_main_p7, ULTIMATE.start_main_p9, |v_#valid_12|]. (let ((.cse4 (store |v_#valid_12| ULTIMATE.start_main_p1 1))) (let ((.cse0 (store .cse4 ULTIMATE.start_main_p2 1))) (let ((.cse5 (store .cse0 ULTIMATE.start_main_p3 1))) (let ((.cse3 (store .cse5 ULTIMATE.start_main_p4 1))) (let ((.cse1 (store .cse3 ULTIMATE.start_main_p5 1))) (let ((.cse2 (store .cse1 ULTIMATE.start_main_p6 1))) (and (= (store (store (store (store (store (store (store (store (store |v_#memory_int_50| 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) |#memory_int|) (= 0 (select .cse0 ULTIMATE.start_main_p3)) (= (select .cse1 ULTIMATE.start_main_p6) 0) (= (select .cse2 ULTIMATE.start_main_p7) 0) (= 0 (select .cse3 ULTIMATE.start_main_p5)) (= 0 (select .cse4 ULTIMATE.start_main_p2)) (= 0 (select (store .cse2 ULTIMATE.start_main_p7 1) ULTIMATE.start_main_p8)) (= 0 (select .cse5 ULTIMATE.start_main_p4))))))))) [2019-02-27 13:08:56,204 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p2, ULTIMATE.start_main_p7, ULTIMATE.start_main_p4, ULTIMATE.start_main_p5, ULTIMATE.start_main_p3, ULTIMATE.start_main_p9, ULTIMATE.start_main_p6]. (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p9)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p4)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p4)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5))) [2019-02-27 13:08:58,731 WARN L181 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 85 [2019-02-27 13:08:58,902 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-27 13:08:58,904 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 153 [2019-02-27 13:08:58,909 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-27 13:08:59,017 INFO L301 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-02-27 13:08:59,018 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:163, output treesize:125 [2019-02-27 13:09:01,399 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-27 13:09:01,399 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_51|, ULTIMATE.start_main_p8, ULTIMATE.start_main_p3, ULTIMATE.start_main_p2, ULTIMATE.start_main_p7, ULTIMATE.start_main_p4, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6]. (let ((.cse0 (select |v_#memory_int_51| ULTIMATE.start_main_p8))) (and (= (select |v_#memory_int_51| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p4)) (= |#memory_int| (store |v_#memory_int_51| ULTIMATE.start_main_p8 (+ .cse0 (- 1)))) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p4)) (= (select |v_#memory_int_51| ULTIMATE.start_main_p7) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= (select |v_#memory_int_51| ULTIMATE.start_main_p5) 0) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |v_#memory_int_51| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p8)) (= .cse0 0) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (= (select |v_#memory_int_51| ULTIMATE.start_main_p4) 0) (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4)) (= (select |v_#memory_int_51| ULTIMATE.start_main_p2) 0) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (= (select |v_#memory_int_51| ULTIMATE.start_main_p6) 0) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5)))) [2019-02-27 13:09:01,400 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p2, ULTIMATE.start_main_p7, ULTIMATE.start_main_p5, ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, ULTIMATE.start_main_p6, ULTIMATE.start_main_p8]. (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p7)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p4)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p4)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (= (- 1) (select |#memory_int| ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5))) [2019-02-27 13:09:03,559 INFO L273 TraceCheckUtils]: 0: Hoare triple {430#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8, main_p9;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;#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]; {437#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p8)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p4)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5)))) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)))} is VALID [2019-02-27 13:09:04,075 INFO L273 TraceCheckUtils]: 1: Hoare triple {437#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p8)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p4)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p8)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p8 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5)))) (= 0 (select |#memory_int| ULTIMATE.start_main_p8)))} #memory_int := #memory_int[main_p8 := #memory_int[main_p8] - 1]; {441#(and (exists ((ULTIMATE.start_main_p8 Int)) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p8) 1))) (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p4)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5)))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0))} is VALID [2019-02-27 13:09:04,079 INFO L273 TraceCheckUtils]: 2: Hoare triple {441#(and (exists ((ULTIMATE.start_main_p8 Int)) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p8) 1))) (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p7 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p7)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p7 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p4)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p6)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p6 ULTIMATE.start_main_p5)))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0))} assume !(#memory_int[main_p1] >= 0); {431#false} is VALID [2019-02-27 13:09:04,080 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 13:09:04,080 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-27 13:09:04,103 INFO L273 TraceCheckUtils]: 2: Hoare triple {445#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {431#false} is VALID [2019-02-27 13:09:04,104 INFO L273 TraceCheckUtils]: 1: Hoare triple {449#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p8 (+ (select |#memory_int| ULTIMATE.start_main_p8) (- 1))) ULTIMATE.start_main_p1))} #memory_int := #memory_int[main_p8 := #memory_int[main_p8] - 1]; {445#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2019-02-27 13:09:04,107 INFO L273 TraceCheckUtils]: 0: Hoare triple {430#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6, main_p7, main_p8, main_p9;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;#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]; {449#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p8 (+ (select |#memory_int| ULTIMATE.start_main_p8) (- 1))) ULTIMATE.start_main_p1))} is VALID [2019-02-27 13:09:04,107 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 13:09:04,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-27 13:09:04,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-27 13:09:04,126 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-27 13:09:04,126 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-27 13:09:04,126 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-27 13:09:04,127 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2019-02-27 13:09:05,041 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-27 13:09:05,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-27 13:09:05,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-27 13:09:05,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-27 13:09:05,042 INFO L87 Difference]: Start difference. First operand 24 states and 52 transitions. Second operand 6 states. [2019-02-27 13:09:06,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-27 13:09:06,037 INFO L93 Difference]: Finished difference Result 54 states and 87 transitions. [2019-02-27 13:09:06,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-27 13:09:06,038 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-27 13:09:06,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-27 13:09:06,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-27 13:09:06,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2019-02-27 13:09:06,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-27 13:09:06,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2019-02-27 13:09:06,046 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 77 transitions. [2019-02-27 13:09:19,555 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-02-27 13:09:19,556 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.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkValidity(IncrementalHoareTripleChecker.java:666) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:133) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.checkEnhancement(BasicCegarLoop.java:848) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:744) 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) ... 27 more [2019-02-27 13:09:19,560 INFO L168 Benchmark]: Toolchain (without parser) took 70800.57 ms. Allocated memory was 136.8 MB in the beginning and 326.1 MB in the end (delta: 189.3 MB). Free memory was 108.6 MB in the beginning and 246.6 MB in the end (delta: -138.0 MB). Peak memory consumption was 51.3 MB. Max. memory is 7.1 GB. [2019-02-27 13:09:19,561 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 136.8 MB. Free memory is still 109.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-27 13:09:19,562 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.23 ms. Allocated memory is still 136.8 MB. Free memory was 108.6 MB in the beginning and 105.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-02-27 13:09:19,563 INFO L168 Benchmark]: Boogie Preprocessor took 25.54 ms. Allocated memory is still 136.8 MB. Free memory was 105.9 MB in the beginning and 104.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-02-27 13:09:19,563 INFO L168 Benchmark]: RCFGBuilder took 1256.78 ms. Allocated memory is still 136.8 MB. Free memory was 104.6 MB in the beginning and 70.3 MB in the end (delta: 34.3 MB). Peak memory consumption was 34.3 MB. Max. memory is 7.1 GB. [2019-02-27 13:09:19,564 INFO L168 Benchmark]: TraceAbstraction took 69455.24 ms. Allocated memory was 136.8 MB in the beginning and 326.1 MB in the end (delta: 189.3 MB). Free memory was 69.9 MB in the beginning and 250.7 MB in the end (delta: -180.8 MB). Peak memory consumption was 8.5 MB. Max. memory is 7.1 GB. [2019-02-27 13:09:19,568 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.17 ms. Allocated memory is still 136.8 MB. Free memory is still 109.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.23 ms. Allocated memory is still 136.8 MB. Free memory was 108.6 MB in the beginning and 105.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.54 ms. Allocated memory is still 136.8 MB. Free memory was 105.9 MB in the beginning and 104.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1256.78 ms. Allocated memory is still 136.8 MB. Free memory was 104.6 MB in the beginning and 70.3 MB in the end (delta: 34.3 MB). Peak memory consumption was 34.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 69455.24 ms. Allocated memory was 136.8 MB in the beginning and 326.1 MB in the end (delta: 189.3 MB). Free memory was 69.9 MB in the beginning and 250.7 MB in the end (delta: -180.8 MB). Peak memory consumption was 8.5 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...