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-6-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-a9d37a5-m [2019-02-28 13:17:58,592 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-28 13:17:58,594 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-28 13:17:58,606 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-28 13:17:58,606 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-28 13:17:58,607 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-28 13:17:58,609 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-28 13:17:58,611 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-28 13:17:58,613 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-28 13:17:58,613 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-28 13:17:58,614 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-28 13:17:58,615 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-28 13:17:58,616 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-28 13:17:58,617 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-28 13:17:58,618 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-28 13:17:58,619 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-28 13:17:58,620 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-28 13:17:58,622 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-28 13:17:58,624 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-28 13:17:58,626 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-28 13:17:58,627 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-28 13:17:58,628 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-28 13:17:58,631 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-28 13:17:58,631 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-28 13:17:58,632 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-28 13:17:58,633 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-28 13:17:58,634 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-28 13:17:58,635 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-28 13:17:58,636 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-28 13:17:58,637 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-28 13:17:58,637 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-28 13:17:58,638 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-28 13:17:58,638 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-28 13:17:58,638 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-28 13:17:58,639 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-28 13:17:58,640 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-28 13:17:58,641 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-28 13:17:58,660 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-28 13:17:58,660 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-28 13:17:58,661 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-28 13:17:58,661 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-28 13:17:58,662 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-28 13:17:58,662 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-28 13:17:58,662 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-28 13:17:58,662 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-28 13:17:58,662 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-28 13:17:58,663 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-28 13:17:58,666 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-28 13:17:58,666 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-28 13:17:58,666 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-28 13:17:58,666 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-28 13:17:58,667 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-28 13:17:58,667 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-28 13:17:58,667 INFO L133 SettingsManager]: * Use SBE=true [2019-02-28 13:17:58,668 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-28 13:17:58,668 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-28 13:17:58,668 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-28 13:17:58,668 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-28 13:17:58,668 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-28 13:17:58,671 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-28 13:17:58,671 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-28 13:17:58,671 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-28 13:17:58,671 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-28 13:17:58,671 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-28 13:17:58,672 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-28 13:17:58,673 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-28 13:17:58,673 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-28 13:17:58,673 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-28 13:17:58,673 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 13:17:58,673 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-28 13:17:58,674 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-28 13:17:58,674 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-28 13:17:58,674 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-28 13:17:58,674 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-28 13:17:58,674 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in [2019-02-28 13:17:58,674 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-28 13:17:58,675 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-28 13:17:58,720 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-28 13:17:58,735 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-28 13:17:58,743 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-28 13:17:58,745 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-28 13:17:58,746 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-28 13:17:58,746 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-6-limited.bpl [2019-02-28 13:17:58,747 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-6-limited.bpl' [2019-02-28 13:17:58,811 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-28 13:17:58,813 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-28 13:17:58,813 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-28 13:17:58,813 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-28 13:17:58,814 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-28 13:17:58,832 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:17:58" (1/1) ... [2019-02-28 13:17:58,846 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:17:58" (1/1) ... [2019-02-28 13:17:58,884 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-28 13:17:58,885 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-28 13:17:58,885 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-28 13:17:58,885 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-28 13:17:58,898 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:17:58" (1/1) ... [2019-02-28 13:17:58,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:17:58" (1/1) ... [2019-02-28 13:17:58,901 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:17:58" (1/1) ... [2019-02-28 13:17:58,902 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:17:58" (1/1) ... [2019-02-28 13:17:58,909 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:17:58" (1/1) ... [2019-02-28 13:17:58,913 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:17:58" (1/1) ... [2019-02-28 13:17:58,916 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:17:58" (1/1) ... [2019-02-28 13:17:58,922 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-28 13:17:58,923 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-28 13:17:58,923 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-28 13:17:58,923 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-28 13:17:58,925 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:17:58" (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:16092 -smt2 -in -t:200000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 13:17:58,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-28 13:17:58,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-28 13:17:59,652 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-28 13:17:59,653 INFO L286 CfgBuilder]: Removed 15 assue(true) statements. [2019-02-28 13:17:59,654 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 01:17:59 BoogieIcfgContainer [2019-02-28 13:17:59,654 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-28 13:17:59,657 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-28 13:17:59,657 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-28 13:17:59,660 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-28 13:17:59,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:17:58" (1/2) ... [2019-02-28 13:17:59,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b3ee0d0 and model type speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 01:17:59, skipping insertion in model container [2019-02-28 13:17:59,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 01:17:59" (2/2) ... [2019-02-28 13:17:59,665 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-6-limited.bpl [2019-02-28 13:17:59,676 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-28 13:17:59,685 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-02-28 13:17:59,702 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-02-28 13:17:59,736 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-28 13:17:59,736 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-28 13:17:59,737 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-28 13:17:59,737 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-28 13:17:59,737 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-28 13:17:59,737 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-28 13:17:59,737 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-28 13:17:59,738 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-28 13:17:59,751 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2019-02-28 13:17:59,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-28 13:17:59,757 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:17:59,758 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-28 13:17:59,760 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:17:59,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:17:59,766 INFO L82 PathProgramCache]: Analyzing trace with hash 988, now seen corresponding path program 1 times [2019-02-28 13:17:59,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:17:59,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:17:59,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:17:59,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:17:59,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:17:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:18:00,075 INFO L273 TraceCheckUtils]: 0: Hoare triple {18#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6;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;assume main_p1 < main_p2;assume main_p2 < main_p3;assume main_p3 < main_p4;assume main_p4 < main_p5;assume main_p5 < main_p6;#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]; {20#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-02-28 13:18:00,085 INFO L273 TraceCheckUtils]: 1: Hoare triple {20#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {19#false} is VALID [2019-02-28 13:18:00,087 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-28 13:18:00,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 13:18:00,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-28 13:18:00,089 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 13:18:00,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-28 13:18:00,095 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:18:00,099 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-02-28 13:18:00,111 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-28 13:18:00,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 13:18:00,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 13:18:00,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 13:18:00,121 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. [2019-02-28 13:18:00,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:18:00,526 INFO L93 Difference]: Finished difference Result 29 states and 39 transitions. [2019-02-28 13:18:00,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 13:18:00,526 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-28 13:18:00,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:18:00,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-28 13:18:00,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2019-02-28 13:18:00,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-28 13:18:00,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2019-02-28 13:18:00,535 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 39 transitions. [2019-02-28 13:18:00,739 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:18:00,752 INFO L225 Difference]: With dead ends: 29 [2019-02-28 13:18:00,753 INFO L226 Difference]: Without dead ends: 24 [2019-02-28 13:18:00,756 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-28 13:18:00,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-02-28 13:18:00,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 14. [2019-02-28 13:18:00,827 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:18:00,828 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 14 states. [2019-02-28 13:18:00,828 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 14 states. [2019-02-28 13:18:00,829 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 14 states. [2019-02-28 13:18:00,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:18:00,833 INFO L93 Difference]: Finished difference Result 24 states and 34 transitions. [2019-02-28 13:18:00,833 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2019-02-28 13:18:00,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:18:00,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:18:00,834 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 24 states. [2019-02-28 13:18:00,835 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 24 states. [2019-02-28 13:18:00,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:18:00,838 INFO L93 Difference]: Finished difference Result 24 states and 34 transitions. [2019-02-28 13:18:00,838 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2019-02-28 13:18:00,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:18:00,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:18:00,839 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:18:00,840 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:18:00,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-02-28 13:18:00,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2019-02-28 13:18:00,844 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 2 [2019-02-28 13:18:00,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:18:00,844 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2019-02-28 13:18:00,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 13:18:00,845 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2019-02-28 13:18:00,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 13:18:00,845 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:18:00,845 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 13:18:00,846 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:18:00,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:18:00,846 INFO L82 PathProgramCache]: Analyzing trace with hash 30376, now seen corresponding path program 1 times [2019-02-28 13:18:00,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:18:00,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:18:00,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:18:00,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:18:00,848 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:18:00,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:18:01,203 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-02-28 13:18:01,218 INFO L273 TraceCheckUtils]: 0: Hoare triple {118#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6;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;assume main_p1 < main_p2;assume main_p2 < main_p3;assume main_p3 < main_p4;assume main_p4 < main_p5;assume main_p5 < main_p6;#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]; {120#(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-28 13:18:01,220 INFO L273 TraceCheckUtils]: 1: Hoare triple {120#(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]; {121#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-02-28 13:18:01,234 INFO L273 TraceCheckUtils]: 2: Hoare triple {121#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {119#false} is VALID [2019-02-28 13:18:01,235 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-28 13:18:01,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:18:01,235 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 13:18:01,236 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-28 13:18:01,238 INFO L207 CegarAbsIntRunner]: [0], [18], [27] [2019-02-28 13:18:01,280 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 13:18:01,281 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 13:18:01,390 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 13:18:01,391 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-28 13:18:01,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:18:01,396 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 13:18:01,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:18:01,397 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-28 13:18:01,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:18:01,408 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 13:18:01,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:18:01,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-28 13:18:01,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:18:01,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 13:18:01,694 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:01,716 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 3 [2019-02-28 13:18:01,722 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:18:01,733 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:18:01,906 INFO L442 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 21 treesize of output 24 [2019-02-28 13:18:02,019 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:02,021 INFO L442 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 24 treesize of output 26 [2019-02-28 13:18:02,062 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:02,064 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:02,092 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:02,094 INFO L442 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 26 treesize of output 28 [2019-02-28 13:18:02,153 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:02,155 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:02,156 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:02,157 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:02,158 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:02,162 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:02,163 INFO L442 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 28 treesize of output 30 [2019-02-28 13:18:02,233 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:02,236 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:02,237 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:02,245 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:02,247 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:02,254 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:02,256 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:02,259 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:02,261 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:02,262 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:02,264 INFO L442 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 30 treesize of output 32 [2019-02-28 13:18:02,292 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:02,293 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:02,294 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:02,304 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:02,305 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:02,306 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:02,307 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:02,308 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:02,309 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:02,310 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:02,312 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:02,313 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:02,313 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:02,315 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:02,316 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:02,319 INFO L442 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-02-28 13:18:02,340 INFO L315 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-28 13:18:02,385 INFO L315 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:18:02,452 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:18:02,468 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:18:02,481 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:18:02,495 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:18:02,529 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 13:18:02,530 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:45, output treesize:46 [2019-02-28 13:18:02,565 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:18:02,565 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_32|, ULTIMATE.start_main_p2, ULTIMATE.start_main_p3, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6, |v_#valid_8|]. (and (= (store (store (store (store (store (store |v_#memory_int_32| 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) |#memory_int|) (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select (store |v_#valid_8| ULTIMATE.start_main_p1 1) ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) [2019-02-28 13:18:02,566 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p5, ULTIMATE.start_main_p3, ULTIMATE.start_main_p2, ULTIMATE.start_main_p6]. (and (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p6))) [2019-02-28 13:18:02,820 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:02,821 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:02,824 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:02,826 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:02,830 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:02,832 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:02,833 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:02,834 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:02,835 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:02,837 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:02,843 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:02,846 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:02,865 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:02,867 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:02,869 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:02,873 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-02-28 13:18:02,879 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:18:02,936 INFO L315 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-28 13:18:02,936 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:48 [2019-02-28 13:18:04,602 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:18:04,602 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_33|, ULTIMATE.start_main_p4, ULTIMATE.start_main_p3, ULTIMATE.start_main_p6, ULTIMATE.start_main_p5, ULTIMATE.start_main_p2]. (let ((.cse0 (select |v_#memory_int_33| ULTIMATE.start_main_p4))) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |v_#memory_int_33| ULTIMATE.start_main_p6)) (= 0 (select |v_#memory_int_33| ULTIMATE.start_main_p3)) (= (select |v_#memory_int_33| ULTIMATE.start_main_p5) 0) (= 0 (select |v_#memory_int_33| ULTIMATE.start_main_p2)) (= (select |v_#memory_int_33| ULTIMATE.start_main_p1) 0) (= .cse0 0) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= (store |v_#memory_int_33| ULTIMATE.start_main_p4 (+ .cse0 (- 1))) |#memory_int|))) [2019-02-28 13:18:04,603 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, ULTIMATE.start_main_p5, ULTIMATE.start_main_p2, ULTIMATE.start_main_p6]. (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= (+ (select |#memory_int| ULTIMATE.start_main_p4) 1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6))) [2019-02-28 13:18:04,747 INFO L273 TraceCheckUtils]: 0: Hoare triple {118#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6;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;assume main_p1 < main_p2;assume main_p2 < main_p3;assume main_p3 < main_p4;assume main_p4 < main_p5;assume main_p5 < main_p6;#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]; {125#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int)) (and (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))) (exists ((ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (= (select |#memory_int| ULTIMATE.start_main_p4) 0))} is VALID [2019-02-28 13:18:04,778 INFO L273 TraceCheckUtils]: 1: Hoare triple {125#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int)) (and (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))) (exists ((ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (= (select |#memory_int| ULTIMATE.start_main_p4) 0))} #memory_int := #memory_int[main_p4 := #memory_int[main_p4] - 1]; {129#(and (= (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_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (= (+ (select |#memory_int| ULTIMATE.start_main_p4) 1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))))} is VALID [2019-02-28 13:18:04,782 INFO L273 TraceCheckUtils]: 2: Hoare triple {129#(and (= (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_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (= (+ (select |#memory_int| ULTIMATE.start_main_p4) 1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))))} assume !(#memory_int[main_p1] >= 0); {119#false} is VALID [2019-02-28 13:18:04,783 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-28 13:18:04,783 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 13:18:04,864 INFO L273 TraceCheckUtils]: 2: Hoare triple {133#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {119#false} is VALID [2019-02-28 13:18:04,865 INFO L273 TraceCheckUtils]: 1: Hoare triple {137#(<= 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]; {133#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2019-02-28 13:18:04,871 INFO L273 TraceCheckUtils]: 0: Hoare triple {118#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6;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;assume main_p1 < main_p2;assume main_p2 < main_p3;assume main_p3 < main_p4;assume main_p4 < main_p5;assume main_p5 < main_p6;#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]; {137#(<= 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-28 13:18:04,872 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-28 13:18:04,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 13:18:04,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-28 13:18:04,894 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 13:18:04,895 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-28 13:18:04,895 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:18:04,895 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2019-02-28 13:18:04,935 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-28 13:18:04,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-28 13:18:04,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-28 13:18:04,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-28 13:18:04,936 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 6 states. [2019-02-28 13:18:08,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:18:08,361 INFO L93 Difference]: Finished difference Result 47 states and 68 transitions. [2019-02-28 13:18:08,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-28 13:18:08,361 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-28 13:18:08,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:18:08,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-28 13:18:08,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2019-02-28 13:18:08,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-28 13:18:08,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2019-02-28 13:18:08,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 68 transitions. [2019-02-28 13:18:09,525 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:18:09,528 INFO L225 Difference]: With dead ends: 47 [2019-02-28 13:18:09,529 INFO L226 Difference]: Without dead ends: 45 [2019-02-28 13:18:09,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-28 13:18:09,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-02-28 13:18:09,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 18. [2019-02-28 13:18:09,549 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:18:09,549 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 18 states. [2019-02-28 13:18:09,549 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 18 states. [2019-02-28 13:18:09,549 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 18 states. [2019-02-28 13:18:09,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:18:09,554 INFO L93 Difference]: Finished difference Result 45 states and 65 transitions. [2019-02-28 13:18:09,554 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 65 transitions. [2019-02-28 13:18:09,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:18:09,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:18:09,555 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 45 states. [2019-02-28 13:18:09,555 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 45 states. [2019-02-28 13:18:09,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:18:09,559 INFO L93 Difference]: Finished difference Result 45 states and 65 transitions. [2019-02-28 13:18:09,560 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 65 transitions. [2019-02-28 13:18:09,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:18:09,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:18:09,561 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:18:09,561 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:18:09,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-02-28 13:18:09,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 37 transitions. [2019-02-28 13:18:09,563 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 37 transitions. Word has length 3 [2019-02-28 13:18:09,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:18:09,563 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 37 transitions. [2019-02-28 13:18:09,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-28 13:18:09,564 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 37 transitions. [2019-02-28 13:18:09,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 13:18:09,564 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:18:09,564 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 13:18:09,565 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:18:09,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:18:09,565 INFO L82 PathProgramCache]: Analyzing trace with hash 30004, now seen corresponding path program 1 times [2019-02-28 13:18:09,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:18:09,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:18:09,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:18:09,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:18:09,567 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:18:09,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:18:09,649 INFO L273 TraceCheckUtils]: 0: Hoare triple {304#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6;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;assume main_p1 < main_p2;assume main_p2 < main_p3;assume main_p3 < main_p4;assume main_p4 < main_p5;assume main_p5 < main_p6;#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]; {306#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-02-28 13:18:09,671 INFO L273 TraceCheckUtils]: 1: Hoare triple {306#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {307#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2019-02-28 13:18:09,671 INFO L273 TraceCheckUtils]: 2: Hoare triple {307#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {305#false} is VALID [2019-02-28 13:18:09,672 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-28 13:18:09,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:18:09,672 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 13:18:09,672 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-28 13:18:09,672 INFO L207 CegarAbsIntRunner]: [0], [6], [27] [2019-02-28 13:18:09,675 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 13:18:09,675 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 13:18:09,696 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 13:18:09,696 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-28 13:18:09,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:18:09,696 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 13:18:09,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:18:09,696 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-28 13:18:09,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:18:09,706 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 13:18:09,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:18:09,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-28 13:18:09,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:18:09,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 13:18:09,791 INFO L442 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 21 treesize of output 24 [2019-02-28 13:18:09,808 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:09,809 INFO L442 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 24 treesize of output 26 [2019-02-28 13:18:09,820 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:09,822 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:09,825 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:09,826 INFO L442 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 26 treesize of output 28 [2019-02-28 13:18:09,846 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:09,848 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:09,850 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:09,852 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:09,854 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:09,856 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:09,858 INFO L442 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 28 treesize of output 30 [2019-02-28 13:18:09,873 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:09,875 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:09,876 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:09,877 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:09,882 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:09,885 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:09,887 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:09,888 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:09,890 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:09,891 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:09,893 INFO L442 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 30 treesize of output 32 [2019-02-28 13:18:09,928 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:09,932 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:09,934 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:09,936 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:09,938 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:09,941 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:09,943 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:09,946 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:09,948 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:09,950 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:09,952 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:09,954 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:09,957 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:09,960 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:09,963 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:09,967 INFO L442 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-02-28 13:18:09,982 INFO L315 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-28 13:18:09,996 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:18:10,013 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:18:10,028 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:18:10,041 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:18:10,060 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:18:10,097 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:10,111 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 3 [2019-02-28 13:18:10,116 INFO L315 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-28 13:18:10,122 INFO L315 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:18:10,210 INFO L315 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-28 13:18:10,211 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:45, output treesize:46 [2019-02-28 13:18:10,356 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:18:10,356 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_35|, ULTIMATE.start_main_p2, ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6, |v_#valid_9|]. (and (= (select (store |v_#valid_9| ULTIMATE.start_main_p1 1) ULTIMATE.start_main_p2) 0) (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (store (store (store (store (store (store |v_#memory_int_35| 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) |#memory_int|) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) [2019-02-28 13:18:10,356 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, ULTIMATE.start_main_p5, ULTIMATE.start_main_p2, ULTIMATE.start_main_p6]. (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= 0 (select |#memory_int| ULTIMATE.start_main_p6))) [2019-02-28 13:18:10,589 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:10,590 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:10,591 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:10,593 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:10,594 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:10,595 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:10,597 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:10,598 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:10,599 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:10,600 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:10,602 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:10,603 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:10,604 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:10,606 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:10,607 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:10,612 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-02-28 13:18:10,640 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:18:10,694 INFO L315 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-28 13:18:10,695 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:46 [2019-02-28 13:18:10,992 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:18:10,992 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_36|, ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, ULTIMATE.start_main_p2, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6]. (let ((.cse0 (select |v_#memory_int_36| ULTIMATE.start_main_p1))) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= (select |v_#memory_int_36| ULTIMATE.start_main_p2) 0) (= (select |v_#memory_int_36| ULTIMATE.start_main_p4) 0) (= (select |v_#memory_int_36| ULTIMATE.start_main_p5) 0) (= (select |v_#memory_int_36| ULTIMATE.start_main_p3) 0) (= |#memory_int| (store |v_#memory_int_36| ULTIMATE.start_main_p1 (+ .cse0 1))) (= .cse0 0) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |v_#memory_int_36| ULTIMATE.start_main_p6) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) [2019-02-28 13:18:10,992 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, ULTIMATE.start_main_p5, ULTIMATE.start_main_p2, ULTIMATE.start_main_p6]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6))) [2019-02-28 13:18:11,406 INFO L273 TraceCheckUtils]: 0: Hoare triple {304#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6;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;assume main_p1 < main_p2;assume main_p2 < main_p3;assume main_p3 < main_p4;assume main_p4 < main_p5;assume main_p5 < main_p6;#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]; {311#(and (= (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_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))))} is VALID [2019-02-28 13:18:11,487 INFO L273 TraceCheckUtils]: 1: Hoare triple {311#(and (= (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_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {315#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))))} is VALID [2019-02-28 13:18:11,488 INFO L273 TraceCheckUtils]: 2: Hoare triple {315#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))))} assume !(#memory_int[main_p1] >= 0); {305#false} is VALID [2019-02-28 13:18:11,489 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-28 13:18:11,489 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 13:18:11,505 INFO L273 TraceCheckUtils]: 2: Hoare triple {307#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {305#false} is VALID [2019-02-28 13:18:11,506 INFO L273 TraceCheckUtils]: 1: Hoare triple {322#(<= 0 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {307#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2019-02-28 13:18:11,509 INFO L273 TraceCheckUtils]: 0: Hoare triple {304#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6;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;assume main_p1 < main_p2;assume main_p2 < main_p3;assume main_p3 < main_p4;assume main_p4 < main_p5;assume main_p5 < main_p6;#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]; {322#(<= 0 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1))} is VALID [2019-02-28 13:18:11,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:18:11,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-28 13:18:11,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-28 13:18:11,529 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 13:18:11,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-28 13:18:11,530 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:18:11,530 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-02-28 13:18:11,543 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:18:11,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 13:18:11,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 13:18:11,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-28 13:18:11,544 INFO L87 Difference]: Start difference. First operand 18 states and 37 transitions. Second operand 4 states. [2019-02-28 13:18:11,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:18:11,805 INFO L93 Difference]: Finished difference Result 23 states and 60 transitions. [2019-02-28 13:18:11,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-28 13:18:11,805 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-28 13:18:11,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:18:11,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-28 13:18:11,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2019-02-28 13:18:11,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-28 13:18:11,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2019-02-28 13:18:11,809 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 34 transitions. [2019-02-28 13:18:11,911 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:18:11,913 INFO L225 Difference]: With dead ends: 23 [2019-02-28 13:18:11,913 INFO L226 Difference]: Without dead ends: 22 [2019-02-28 13:18:11,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-28 13:18:11,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-02-28 13:18:11,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-02-28 13:18:11,957 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:18:11,957 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 21 states. [2019-02-28 13:18:11,957 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 21 states. [2019-02-28 13:18:11,957 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 21 states. [2019-02-28 13:18:11,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:18:11,961 INFO L93 Difference]: Finished difference Result 22 states and 59 transitions. [2019-02-28 13:18:11,961 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 59 transitions. [2019-02-28 13:18:11,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:18:11,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:18:11,962 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 22 states. [2019-02-28 13:18:11,962 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 22 states. [2019-02-28 13:18:11,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:18:11,965 INFO L93 Difference]: Finished difference Result 22 states and 59 transitions. [2019-02-28 13:18:11,965 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 59 transitions. [2019-02-28 13:18:11,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:18:11,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:18:11,966 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:18:11,966 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:18:11,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-02-28 13:18:11,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 59 transitions. [2019-02-28 13:18:11,969 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 59 transitions. Word has length 3 [2019-02-28 13:18:11,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:18:11,969 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 59 transitions. [2019-02-28 13:18:11,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 13:18:11,969 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 59 transitions. [2019-02-28 13:18:11,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 13:18:11,970 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:18:11,970 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 13:18:11,970 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:18:11,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:18:11,971 INFO L82 PathProgramCache]: Analyzing trace with hash 30562, now seen corresponding path program 1 times [2019-02-28 13:18:11,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:18:11,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:18:11,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:18:11,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:18:11,972 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:18:11,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:18:12,092 INFO L273 TraceCheckUtils]: 0: Hoare triple {425#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6;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;assume main_p1 < main_p2;assume main_p2 < main_p3;assume main_p3 < main_p4;assume main_p4 < main_p5;assume main_p5 < main_p6;#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]; {427#(and (= 0 (select (store |#memory_int| ULTIMATE.start_main_p6 (+ (select |#memory_int| ULTIMATE.start_main_p6) (- 1))) ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)))} is VALID [2019-02-28 13:18:12,093 INFO L273 TraceCheckUtils]: 1: Hoare triple {427#(and (= 0 (select (store |#memory_int| ULTIMATE.start_main_p6 (+ (select |#memory_int| ULTIMATE.start_main_p6) (- 1))) ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)))} #memory_int := #memory_int[main_p6 := #memory_int[main_p6] - 1]; {428#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-02-28 13:18:12,094 INFO L273 TraceCheckUtils]: 2: Hoare triple {428#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {426#false} is VALID [2019-02-28 13:18:12,094 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-28 13:18:12,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:18:12,095 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 13:18:12,095 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-28 13:18:12,095 INFO L207 CegarAbsIntRunner]: [0], [24], [27] [2019-02-28 13:18:12,099 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 13:18:12,099 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 13:18:12,119 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 13:18:12,119 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-28 13:18:12,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:18:12,120 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 13:18:12,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:18:12,120 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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 13:18:12,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:18:12,130 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 13:18:12,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:18:12,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-28 13:18:12,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:18:12,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 13:18:12,187 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:12,194 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 3 [2019-02-28 13:18:12,195 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:18:12,198 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:18:12,218 INFO L442 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 21 treesize of output 24 [2019-02-28 13:18:12,229 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:12,230 INFO L442 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 24 treesize of output 26 [2019-02-28 13:18:12,245 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:12,246 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:12,247 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:12,249 INFO L442 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 26 treesize of output 28 [2019-02-28 13:18:12,331 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:12,334 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:12,336 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:12,338 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:12,339 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:12,340 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:12,341 INFO L442 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 28 treesize of output 30 [2019-02-28 13:18:12,353 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:12,354 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:12,357 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:12,359 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:12,360 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:12,361 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:12,363 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:12,364 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:12,365 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:12,366 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:12,368 INFO L442 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 30 treesize of output 32 [2019-02-28 13:18:12,379 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:12,381 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:12,384 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:12,385 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:12,386 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:12,387 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:12,388 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:12,390 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:12,425 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:12,428 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:12,430 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:12,431 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:12,432 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:12,433 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:12,434 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:12,436 INFO L442 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-02-28 13:18:12,437 INFO L315 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-28 13:18:12,450 INFO L315 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:18:12,468 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:18:12,481 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:18:12,493 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:18:12,510 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:18:12,540 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 13:18:12,540 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:45, output treesize:46 [2019-02-28 13:18:12,606 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:18:12,606 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_38|, ULTIMATE.start_main_p2, ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, ULTIMATE.start_main_p5, |v_#valid_10|]. (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= (store (store (store (store (store (store |v_#memory_int_38| 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) |#memory_int|) (= (select (store |v_#valid_10| ULTIMATE.start_main_p1 1) ULTIMATE.start_main_p2) 0) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) [2019-02-28 13:18:12,607 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, ULTIMATE.start_main_p5, ULTIMATE.start_main_p2]. (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= 0 (select |#memory_int| ULTIMATE.start_main_p6))) [2019-02-28 13:18:12,715 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:12,717 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:12,718 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:12,719 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:12,721 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:12,725 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:12,726 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:12,727 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:12,728 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:12,730 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:12,731 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:12,734 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:12,734 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:12,735 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:12,736 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:12,739 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-02-28 13:18:12,742 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:18:12,776 INFO L315 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-28 13:18:12,776 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:48 [2019-02-28 13:18:13,601 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:18:13,601 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_39|, ULTIMATE.start_main_p6, ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, ULTIMATE.start_main_p2, ULTIMATE.start_main_p5]. (let ((.cse0 (select |v_#memory_int_39| ULTIMATE.start_main_p6))) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= (select |v_#memory_int_39| ULTIMATE.start_main_p3) 0) (= .cse0 0) (= (select |v_#memory_int_39| ULTIMATE.start_main_p2) 0) (= (select |v_#memory_int_39| ULTIMATE.start_main_p5) 0) (= (store |v_#memory_int_39| ULTIMATE.start_main_p6 (+ .cse0 (- 1))) |#memory_int|) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |v_#memory_int_39| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= (select |v_#memory_int_39| ULTIMATE.start_main_p1) 0))) [2019-02-28 13:18:13,601 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, ULTIMATE.start_main_p5, ULTIMATE.start_main_p2, ULTIMATE.start_main_p6]. (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p6) 1))) [2019-02-28 13:18:14,035 INFO L273 TraceCheckUtils]: 0: Hoare triple {425#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6;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;assume main_p1 < main_p2;assume main_p2 < main_p3;assume main_p3 < main_p4;assume main_p4 < main_p5;assume main_p5 < main_p6;#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]; {432#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))} is VALID [2019-02-28 13:18:14,075 INFO L273 TraceCheckUtils]: 1: Hoare triple {432#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))} #memory_int := #memory_int[main_p6 := #memory_int[main_p6] - 1]; {436#(and (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p6) 1)))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0))} is VALID [2019-02-28 13:18:14,076 INFO L273 TraceCheckUtils]: 2: Hoare triple {436#(and (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p6) 1)))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0))} assume !(#memory_int[main_p1] >= 0); {426#false} is VALID [2019-02-28 13:18:14,076 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-28 13:18:14,077 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 13:18:14,099 INFO L273 TraceCheckUtils]: 2: Hoare triple {440#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {426#false} is VALID [2019-02-28 13:18:14,100 INFO L273 TraceCheckUtils]: 1: Hoare triple {444#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p6 (+ (select |#memory_int| ULTIMATE.start_main_p6) (- 1))) ULTIMATE.start_main_p1))} #memory_int := #memory_int[main_p6 := #memory_int[main_p6] - 1]; {440#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2019-02-28 13:18:14,103 INFO L273 TraceCheckUtils]: 0: Hoare triple {425#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6;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;assume main_p1 < main_p2;assume main_p2 < main_p3;assume main_p3 < main_p4;assume main_p4 < main_p5;assume main_p5 < main_p6;#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]; {444#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p6 (+ (select |#memory_int| ULTIMATE.start_main_p6) (- 1))) ULTIMATE.start_main_p1))} is VALID [2019-02-28 13:18:14,104 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-28 13:18:14,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 13:18:14,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-28 13:18:14,125 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 13:18:14,125 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-28 13:18:14,125 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:18:14,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2019-02-28 13:18:14,189 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-28 13:18:14,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-28 13:18:14,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-28 13:18:14,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-28 13:18:14,190 INFO L87 Difference]: Start difference. First operand 21 states and 59 transitions. Second operand 6 states. [2019-02-28 13:18:14,653 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2019-02-28 13:18:17,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:18:17,468 INFO L93 Difference]: Finished difference Result 50 states and 96 transitions. [2019-02-28 13:18:17,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-28 13:18:17,469 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-28 13:18:17,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:18:17,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-28 13:18:17,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2019-02-28 13:18:17,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-28 13:18:17,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 67 transitions. [2019-02-28 13:18:17,473 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 67 transitions. [2019-02-28 13:18:18,814 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:18:18,815 INFO L225 Difference]: With dead ends: 50 [2019-02-28 13:18:18,815 INFO L226 Difference]: Without dead ends: 47 [2019-02-28 13:18:18,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-28 13:18:18,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-02-28 13:18:18,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 24. [2019-02-28 13:18:18,911 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:18:18,911 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 24 states. [2019-02-28 13:18:18,911 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 24 states. [2019-02-28 13:18:18,911 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 24 states. [2019-02-28 13:18:18,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:18:18,916 INFO L93 Difference]: Finished difference Result 47 states and 92 transitions. [2019-02-28 13:18:18,916 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 92 transitions. [2019-02-28 13:18:18,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:18:18,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:18:18,917 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 47 states. [2019-02-28 13:18:18,917 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 47 states. [2019-02-28 13:18:18,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:18:18,920 INFO L93 Difference]: Finished difference Result 47 states and 92 transitions. [2019-02-28 13:18:18,920 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 92 transitions. [2019-02-28 13:18:18,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:18:18,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:18:18,921 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:18:18,921 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:18:18,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-02-28 13:18:18,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 74 transitions. [2019-02-28 13:18:18,923 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 74 transitions. Word has length 3 [2019-02-28 13:18:18,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:18:18,923 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 74 transitions. [2019-02-28 13:18:18,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-28 13:18:18,923 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 74 transitions. [2019-02-28 13:18:18,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 13:18:18,924 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:18:18,924 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 13:18:18,924 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:18:18,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:18:18,925 INFO L82 PathProgramCache]: Analyzing trace with hash 30128, now seen corresponding path program 1 times [2019-02-28 13:18:18,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:18:18,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:18:18,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:18:18,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:18:18,926 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:18:18,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:18:19,026 INFO L273 TraceCheckUtils]: 0: Hoare triple {633#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6;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;assume main_p1 < main_p2;assume main_p2 < main_p3;assume main_p3 < main_p4;assume main_p4 < main_p5;assume main_p5 < main_p6;#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]; {635#(and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1)))} is VALID [2019-02-28 13:18:19,028 INFO L273 TraceCheckUtils]: 1: Hoare triple {635#(and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1)))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {636#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-02-28 13:18:19,028 INFO L273 TraceCheckUtils]: 2: Hoare triple {636#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {634#false} is VALID [2019-02-28 13:18:19,029 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-28 13:18:19,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:18:19,029 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 13:18:19,029 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-28 13:18:19,030 INFO L207 CegarAbsIntRunner]: [0], [10], [27] [2019-02-28 13:18:19,031 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 13:18:19,031 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 13:18:19,050 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 13:18:19,050 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-28 13:18:19,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:18:19,051 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 13:18:19,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:18:19,051 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 13:18:19,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:18:19,060 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 13:18:19,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:18:19,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-28 13:18:19,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:18:19,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 13:18:19,225 INFO L442 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 21 treesize of output 24 [2019-02-28 13:18:19,233 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:19,235 INFO L442 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 24 treesize of output 26 [2019-02-28 13:18:19,245 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:19,246 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:19,247 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:19,248 INFO L442 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 26 treesize of output 28 [2019-02-28 13:18:19,260 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:19,261 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:19,262 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:19,264 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:19,265 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:19,266 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:19,267 INFO L442 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 28 treesize of output 30 [2019-02-28 13:18:19,417 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:19,443 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:19,472 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:19,495 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:19,520 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:19,545 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:19,546 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:19,547 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:19,548 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:19,548 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:19,549 INFO L289 Elim1Store]: Index analysis took 154 ms [2019-02-28 13:18:19,550 INFO L442 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 30 treesize of output 32 [2019-02-28 13:18:19,561 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:19,562 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:19,564 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:19,565 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:19,566 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:19,568 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:19,569 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:19,570 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:19,571 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:19,573 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:19,574 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:19,575 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:19,577 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:19,578 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:19,579 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:19,581 INFO L442 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-02-28 13:18:19,584 INFO L315 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-28 13:18:19,599 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:18:19,613 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:18:19,628 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:18:19,642 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:18:19,658 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:18:19,688 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:19,694 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 3 [2019-02-28 13:18:19,695 INFO L315 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-28 13:18:19,697 INFO L315 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:18:19,729 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 13:18:19,730 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:45, output treesize:46 [2019-02-28 13:18:19,769 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:18:19,769 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_41|, ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6, |v_#valid_11|]. (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select (store |v_#valid_11| ULTIMATE.start_main_p1 1) ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= (store (store (store (store (store (store |v_#memory_int_41| 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) |#memory_int|)) [2019-02-28 13:18:19,769 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6]. (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6))) [2019-02-28 13:18:19,872 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:19,873 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:19,874 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:19,876 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:19,877 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:19,878 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:19,880 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:19,881 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:19,882 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:19,883 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:19,885 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:19,890 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:19,891 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:19,891 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:19,892 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:19,893 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-02-28 13:18:19,896 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:18:19,956 INFO L315 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-28 13:18:19,957 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:48 [2019-02-28 13:18:32,186 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:18:32,186 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_42|, ULTIMATE.start_main_p2, ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, ULTIMATE.start_main_p6, ULTIMATE.start_main_p5]. (let ((.cse0 (select |v_#memory_int_42| ULTIMATE.start_main_p2))) (and (= (select |v_#memory_int_42| ULTIMATE.start_main_p1) 0) (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= (select |v_#memory_int_42| ULTIMATE.start_main_p6) 0) (= (select |v_#memory_int_42| ULTIMATE.start_main_p3) 0) (= |#memory_int| (store |v_#memory_int_42| ULTIMATE.start_main_p2 (+ .cse0 (- 1)))) (= .cse0 0) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (= (select |v_#memory_int_42| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= (select |v_#memory_int_42| ULTIMATE.start_main_p5) 0))) [2019-02-28 13:18:32,186 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, ULTIMATE.start_main_p5, ULTIMATE.start_main_p2, ULTIMATE.start_main_p6]. (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6))) [2019-02-28 13:18:32,739 INFO L273 TraceCheckUtils]: 0: Hoare triple {633#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6;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;assume main_p1 < main_p2;assume main_p2 < main_p3;assume main_p3 < main_p4;assume main_p4 < main_p5;assume main_p5 < main_p6;#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]; {640#(and (= (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_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))} is VALID [2019-02-28 13:18:32,757 INFO L273 TraceCheckUtils]: 1: Hoare triple {640#(and (= (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_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {644#(and (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0))} is VALID [2019-02-28 13:18:32,758 INFO L273 TraceCheckUtils]: 2: Hoare triple {644#(and (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0))} assume !(#memory_int[main_p1] >= 0); {634#false} is VALID [2019-02-28 13:18:32,759 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-28 13:18:32,759 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 13:18:32,788 INFO L273 TraceCheckUtils]: 2: Hoare triple {648#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {634#false} is VALID [2019-02-28 13:18:32,789 INFO L273 TraceCheckUtils]: 1: Hoare triple {652#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {648#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2019-02-28 13:18:32,792 INFO L273 TraceCheckUtils]: 0: Hoare triple {633#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6;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;assume main_p1 < main_p2;assume main_p2 < main_p3;assume main_p3 < main_p4;assume main_p4 < main_p5;assume main_p5 < main_p6;#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]; {652#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))} is VALID [2019-02-28 13:18:32,793 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-28 13:18:32,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 13:18:32,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-28 13:18:32,813 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 13:18:32,814 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-28 13:18:32,814 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:18:32,814 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2019-02-28 13:18:32,852 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-28 13:18:32,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-28 13:18:32,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-28 13:18:32,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-28 13:18:32,852 INFO L87 Difference]: Start difference. First operand 24 states and 74 transitions. Second operand 6 states. [2019-02-28 13:18:34,615 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2019-02-28 13:18:36,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:18:36,571 INFO L93 Difference]: Finished difference Result 50 states and 108 transitions. [2019-02-28 13:18:36,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-28 13:18:36,571 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-28 13:18:36,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:18:36,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-28 13:18:36,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2019-02-28 13:18:36,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-28 13:18:36,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2019-02-28 13:18:36,574 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2019-02-28 13:18:37,849 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:18:37,851 INFO L225 Difference]: With dead ends: 50 [2019-02-28 13:18:37,852 INFO L226 Difference]: Without dead ends: 48 [2019-02-28 13:18:37,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-28 13:18:37,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-02-28 13:18:37,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 26. [2019-02-28 13:18:37,927 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:18:37,927 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 26 states. [2019-02-28 13:18:37,927 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 26 states. [2019-02-28 13:18:37,928 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 26 states. [2019-02-28 13:18:37,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:18:37,931 INFO L93 Difference]: Finished difference Result 48 states and 105 transitions. [2019-02-28 13:18:37,931 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 105 transitions. [2019-02-28 13:18:37,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:18:37,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:18:37,932 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 48 states. [2019-02-28 13:18:37,932 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 48 states. [2019-02-28 13:18:37,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:18:37,935 INFO L93 Difference]: Finished difference Result 48 states and 105 transitions. [2019-02-28 13:18:37,936 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 105 transitions. [2019-02-28 13:18:37,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:18:37,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:18:37,936 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:18:37,937 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:18:37,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-02-28 13:18:37,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 87 transitions. [2019-02-28 13:18:37,939 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 87 transitions. Word has length 3 [2019-02-28 13:18:37,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:18:37,939 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 87 transitions. [2019-02-28 13:18:37,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-28 13:18:37,939 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 87 transitions. [2019-02-28 13:18:37,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 13:18:37,939 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:18:37,940 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 13:18:37,940 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:18:37,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:18:37,940 INFO L82 PathProgramCache]: Analyzing trace with hash 941528, now seen corresponding path program 1 times [2019-02-28 13:18:37,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:18:37,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:18:37,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:18:37,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:18:37,942 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:18:37,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:18:38,105 INFO L273 TraceCheckUtils]: 0: Hoare triple {849#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6;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;assume main_p1 < main_p2;assume main_p2 < main_p3;assume main_p3 < main_p4;assume main_p4 < main_p5;assume main_p5 < main_p6;#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]; {851#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (= 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-28 13:18:38,106 INFO L273 TraceCheckUtils]: 1: Hoare triple {851#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (= 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]; {852#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p5 (+ (select |#memory_int| ULTIMATE.start_main_p5) 1)) ULTIMATE.start_main_p1)))} is VALID [2019-02-28 13:18:38,108 INFO L273 TraceCheckUtils]: 2: Hoare triple {852#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p5 (+ (select |#memory_int| ULTIMATE.start_main_p5) 1)) ULTIMATE.start_main_p1)))} #memory_int := #memory_int[main_p5 := #memory_int[main_p5] + 1]; {853#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-02-28 13:18:38,109 INFO L273 TraceCheckUtils]: 3: Hoare triple {853#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {850#false} is VALID [2019-02-28 13:18:38,109 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:18:38,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:18:38,110 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 13:18:38,110 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 13:18:38,110 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [27] [2019-02-28 13:18:38,112 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 13:18:38,112 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 13:18:38,129 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 13:18:38,129 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 13:18:38,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:18:38,130 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 13:18:38,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:18:38,130 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 13:18:38,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:18:38,138 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 13:18:38,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:18:38,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-28 13:18:38,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:18:38,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 13:18:38,235 INFO L442 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 21 treesize of output 24 [2019-02-28 13:18:38,248 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:38,248 INFO L442 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 24 treesize of output 26 [2019-02-28 13:18:38,256 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:38,257 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:38,259 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:38,260 INFO L442 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 26 treesize of output 28 [2019-02-28 13:18:38,269 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:38,270 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:38,271 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:38,272 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:38,274 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:38,275 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:38,276 INFO L442 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 28 treesize of output 30 [2019-02-28 13:18:38,292 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:38,293 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:38,294 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:38,294 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:38,295 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:38,297 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:38,298 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:38,299 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:38,301 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:38,302 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:38,304 INFO L442 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 30 treesize of output 32 [2019-02-28 13:18:38,314 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:38,315 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:38,317 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:38,318 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:38,319 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:38,321 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:38,322 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:38,323 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:38,325 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:38,326 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:38,327 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:38,329 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:38,330 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:38,331 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:38,331 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:38,333 INFO L442 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-02-28 13:18:38,335 INFO L315 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-28 13:18:38,353 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:18:38,368 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:18:38,382 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:18:38,397 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:18:38,412 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:18:38,445 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:38,450 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 3 [2019-02-28 13:18:38,451 INFO L315 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-28 13:18:38,454 INFO L315 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:18:38,483 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 13:18:38,483 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:45, output treesize:46 [2019-02-28 13:18:38,501 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:18:38,502 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_44|, ULTIMATE.start_main_p2, ULTIMATE.start_main_p3, ULTIMATE.start_main_p6, |v_#valid_12|]. (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select (store |v_#valid_12| ULTIMATE.start_main_p1 1) ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= |#memory_int| (store (store (store (store (store (store |v_#memory_int_44| 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_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) [2019-02-28 13:18:38,502 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3, ULTIMATE.start_main_p2, ULTIMATE.start_main_p6]. (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p6))) [2019-02-28 13:18:38,566 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:38,567 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:38,568 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:38,570 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:38,571 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:38,572 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:38,573 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:38,575 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:38,576 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:38,577 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:38,578 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:38,579 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:38,581 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:38,582 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:38,583 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:38,585 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-02-28 13:18:38,588 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:18:38,617 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 13:18:38,617 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:48 [2019-02-28 13:18:46,910 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:18:46,910 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_45|, ULTIMATE.start_main_p4, ULTIMATE.start_main_p3, ULTIMATE.start_main_p2, ULTIMATE.start_main_p6]. (let ((.cse0 (select |v_#memory_int_45| ULTIMATE.start_main_p4))) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= |#memory_int| (store |v_#memory_int_45| ULTIMATE.start_main_p4 (+ .cse0 (- 1)))) (= (select |v_#memory_int_45| ULTIMATE.start_main_p5) 0) (= (select |v_#memory_int_45| ULTIMATE.start_main_p3) 0) (= (select |v_#memory_int_45| ULTIMATE.start_main_p2) 0) (= .cse0 0) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |v_#memory_int_45| ULTIMATE.start_main_p1) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= (select |v_#memory_int_45| ULTIMATE.start_main_p6) 0))) [2019-02-28 13:18:46,910 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, ULTIMATE.start_main_p2, ULTIMATE.start_main_p6]. (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= (+ (select |#memory_int| ULTIMATE.start_main_p4) 1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6))) [2019-02-28 13:18:47,076 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:47,077 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:47,078 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:47,079 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:47,079 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:47,080 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:47,082 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:47,083 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:47,084 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:47,085 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:47,087 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:47,088 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:47,089 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:47,090 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:47,092 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:18:47,095 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2019-02-28 13:18:47,099 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:18:47,130 INFO L315 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-28 13:18:47,130 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:48 [2019-02-28 13:22:07,689 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:22:07,690 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_46|, ULTIMATE.start_main_p5, ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, ULTIMATE.start_main_p6, ULTIMATE.start_main_p2]. (let ((.cse0 (select |v_#memory_int_46| ULTIMATE.start_main_p5))) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |v_#memory_int_46| ULTIMATE.start_main_p6)) (= (select |v_#memory_int_46| ULTIMATE.start_main_p3) 0) (= (+ (select |v_#memory_int_46| ULTIMATE.start_main_p4) 1) 0) (= 0 (select |v_#memory_int_46| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (= 0 .cse0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= (store |v_#memory_int_46| ULTIMATE.start_main_p5 (+ .cse0 1)) |#memory_int|) (= 0 (select |v_#memory_int_46| ULTIMATE.start_main_p1)))) [2019-02-28 13:22:07,690 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, ULTIMATE.start_main_p5, ULTIMATE.start_main_p2, ULTIMATE.start_main_p6]. (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= (+ (select |#memory_int| ULTIMATE.start_main_p4) 1) 0) (= 1 (select |#memory_int| ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6))) [2019-02-28 13:22:08,451 INFO L273 TraceCheckUtils]: 0: Hoare triple {849#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6;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;assume main_p1 < main_p2;assume main_p2 < main_p3;assume main_p3 < main_p4;assume main_p4 < main_p5;assume main_p5 < main_p6;#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]; {857#(and (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (exists ((ULTIMATE.start_main_p6 Int)) (and (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (= (select |#memory_int| ULTIMATE.start_main_p4) 0))} is VALID [2019-02-28 13:22:08,456 INFO L273 TraceCheckUtils]: 1: Hoare triple {857#(and (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (exists ((ULTIMATE.start_main_p6 Int)) (and (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (= (select |#memory_int| ULTIMATE.start_main_p4) 0))} #memory_int := #memory_int[main_p4 := #memory_int[main_p4] - 1]; {861#(and (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (exists ((ULTIMATE.start_main_p6 Int)) (and (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= (+ (select |#memory_int| ULTIMATE.start_main_p4) 1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))))} is VALID [2019-02-28 13:22:08,477 INFO L273 TraceCheckUtils]: 2: Hoare triple {861#(and (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (exists ((ULTIMATE.start_main_p6 Int)) (and (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= (+ (select |#memory_int| ULTIMATE.start_main_p4) 1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))))} #memory_int := #memory_int[main_p5 := #memory_int[main_p5] + 1]; {865#(and (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= (+ (select |#memory_int| ULTIMATE.start_main_p4) 1) 0) (= 1 (select |#memory_int| ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0))} is VALID [2019-02-28 13:22:08,478 INFO L273 TraceCheckUtils]: 3: Hoare triple {865#(and (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p6 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= (+ (select |#memory_int| ULTIMATE.start_main_p4) 1) 0) (= 1 (select |#memory_int| ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0))} assume !(#memory_int[main_p1] >= 0); {850#false} is VALID [2019-02-28 13:22:08,478 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:22:08,478 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 13:22:08,520 INFO L273 TraceCheckUtils]: 3: Hoare triple {869#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {850#false} is VALID [2019-02-28 13:22:08,521 INFO L273 TraceCheckUtils]: 2: Hoare triple {873#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p5 (+ (select |#memory_int| ULTIMATE.start_main_p5) 1)) ULTIMATE.start_main_p1))} #memory_int := #memory_int[main_p5 := #memory_int[main_p5] + 1]; {869#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2019-02-28 13:22:08,522 INFO L273 TraceCheckUtils]: 1: Hoare triple {877#(<= 0 (select (store (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p5 (+ (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p5) 1)) ULTIMATE.start_main_p1))} #memory_int := #memory_int[main_p4 := #memory_int[main_p4] - 1]; {873#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p5 (+ (select |#memory_int| ULTIMATE.start_main_p5) 1)) ULTIMATE.start_main_p1))} is VALID [2019-02-28 13:22:08,525 INFO L273 TraceCheckUtils]: 0: Hoare triple {849#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6;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;assume main_p1 < main_p2;assume main_p2 < main_p3;assume main_p3 < main_p4;assume main_p4 < main_p5;assume main_p5 < main_p6;#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]; {877#(<= 0 (select (store (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p5 (+ (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p5) 1)) ULTIMATE.start_main_p1))} is VALID [2019-02-28 13:22:08,525 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:22:08,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 13:22:08,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 13:22:08,545 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 13:22:08,545 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-28 13:22:08,545 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:22:08,545 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2019-02-28 13:22:08,582 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:22:08,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 13:22:08,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 13:22:08,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-28 13:22:08,583 INFO L87 Difference]: Start difference. First operand 26 states and 87 transitions. Second operand 8 states. [2019-02-28 13:22:14,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:22:14,445 INFO L93 Difference]: Finished difference Result 62 states and 145 transitions. [2019-02-28 13:22:14,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 13:22:14,446 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-28 13:22:14,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:22:14,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-28 13:22:14,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2019-02-28 13:22:14,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-28 13:22:14,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2019-02-28 13:22:14,448 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 80 transitions. [2019-02-28 13:22:15,708 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:22:15,710 INFO L225 Difference]: With dead ends: 62 [2019-02-28 13:22:15,710 INFO L226 Difference]: Without dead ends: 58 [2019-02-28 13:22:15,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-28 13:22:15,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-02-28 13:22:15,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 30. [2019-02-28 13:22:15,802 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:22:15,802 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 30 states. [2019-02-28 13:22:15,802 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 30 states. [2019-02-28 13:22:15,803 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 30 states. [2019-02-28 13:22:15,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:22:15,806 INFO L93 Difference]: Finished difference Result 58 states and 138 transitions. [2019-02-28 13:22:15,806 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 138 transitions. [2019-02-28 13:22:15,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:22:15,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:22:15,807 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 58 states. [2019-02-28 13:22:15,807 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 58 states. [2019-02-28 13:22:15,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:22:15,810 INFO L93 Difference]: Finished difference Result 58 states and 138 transitions. [2019-02-28 13:22:15,811 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 138 transitions. [2019-02-28 13:22:15,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:22:15,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:22:15,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:22:15,812 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:22:15,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-02-28 13:22:15,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 105 transitions. [2019-02-28 13:22:15,814 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 105 transitions. Word has length 4 [2019-02-28 13:22:15,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:22:15,814 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 105 transitions. [2019-02-28 13:22:15,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 13:22:15,814 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 105 transitions. [2019-02-28 13:22:15,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 13:22:15,815 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:22:15,815 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 13:22:15,815 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:22:15,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:22:15,816 INFO L82 PathProgramCache]: Analyzing trace with hash 941590, now seen corresponding path program 1 times [2019-02-28 13:22:15,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:22:15,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:22:15,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:22:15,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:22:15,817 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:22:15,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:22:16,002 INFO L273 TraceCheckUtils]: 0: Hoare triple {1118#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6;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;assume main_p1 < main_p2;assume main_p2 < main_p3;assume main_p3 < main_p4;assume main_p4 < main_p5;assume main_p5 < main_p6;#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]; {1120#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (= 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-28 13:22:16,005 INFO L273 TraceCheckUtils]: 1: Hoare triple {1120#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)) (= 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]; {1121#(and (= 0 (select (store |#memory_int| ULTIMATE.start_main_p6 (+ (select |#memory_int| ULTIMATE.start_main_p6) (- 1))) ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)))} is VALID [2019-02-28 13:22:16,009 INFO L273 TraceCheckUtils]: 2: Hoare triple {1121#(and (= 0 (select (store |#memory_int| ULTIMATE.start_main_p6 (+ (select |#memory_int| ULTIMATE.start_main_p6) (- 1))) ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p6)))} #memory_int := #memory_int[main_p6 := #memory_int[main_p6] - 1]; {1122#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-02-28 13:22:16,010 INFO L273 TraceCheckUtils]: 3: Hoare triple {1122#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {1119#false} is VALID [2019-02-28 13:22:16,010 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:22:16,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:22:16,010 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 13:22:16,011 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 13:22:16,011 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [27] [2019-02-28 13:22:16,012 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 13:22:16,012 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 13:22:16,026 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 13:22:16,026 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 13:22:16,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:22:16,027 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 13:22:16,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:22:16,027 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 13:22:16,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:22:16,036 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 13:22:16,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:22:16,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-28 13:22:16,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:22:16,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 13:22:16,098 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:22:16,104 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 3 [2019-02-28 13:22:16,106 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:22:16,108 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:22:16,130 INFO L442 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 21 treesize of output 24 [2019-02-28 13:22:16,140 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:22:16,142 INFO L442 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 24 treesize of output 26 [2019-02-28 13:22:16,172 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:22:16,173 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:22:16,175 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:22:16,176 INFO L442 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 26 treesize of output 28 [2019-02-28 13:22:16,252 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:22:16,253 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:22:16,254 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:22:16,256 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:22:16,257 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:22:16,258 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:22:16,259 INFO L442 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 28 treesize of output 30 [2019-02-28 13:22:16,271 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:22:16,272 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:22:16,272 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:22:16,273 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:22:16,275 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:22:16,276 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:22:16,277 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:22:16,278 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:22:16,280 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:22:16,281 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:22:16,283 INFO L442 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 30 treesize of output 32 [2019-02-28 13:22:16,295 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:22:16,297 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:22:16,298 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:22:16,300 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:22:16,301 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:22:16,302 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:22:16,304 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:22:16,305 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:22:16,307 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:22:16,308 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:22:16,310 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:22:16,311 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:22:16,313 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:22:16,314 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:22:16,316 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:22:16,317 INFO L442 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-02-28 13:22:16,320 INFO L315 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-28 13:22:16,334 INFO L315 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:22:16,351 INFO L315 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:22:16,368 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:22:16,384 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:22:16,400 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:22:16,433 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 13:22:16,434 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:45, output treesize:46 [2019-02-28 13:22:16,454 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:22:16,455 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_49|, ULTIMATE.start_main_p2, ULTIMATE.start_main_p3, ULTIMATE.start_main_p5, |v_#valid_13|]. (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= (store (store (store (store (store (store |v_#memory_int_49| 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) |#memory_int|) (= 0 (select (store |v_#valid_13| ULTIMATE.start_main_p1 1) ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) [2019-02-28 13:22:16,455 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3, ULTIMATE.start_main_p5, ULTIMATE.start_main_p2]. (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p6))) [2019-02-28 13:22:16,535 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:22:16,536 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:22:16,538 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:22:16,539 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:22:16,540 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:22:16,541 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:22:16,543 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:22:16,544 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:22:16,545 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:22:16,546 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:22:16,548 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:22:16,549 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:22:16,550 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:22:16,551 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:22:16,553 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:22:16,554 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-02-28 13:22:16,557 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:22:16,599 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 13:22:16,599 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:48 [2019-02-28 13:25:36,694 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:25:36,695 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_50|, ULTIMATE.start_main_p4, ULTIMATE.start_main_p3, ULTIMATE.start_main_p5, ULTIMATE.start_main_p2]. (let ((.cse0 (select |v_#memory_int_50| ULTIMATE.start_main_p4))) (and (= 0 (select |v_#memory_int_50| ULTIMATE.start_main_p3)) (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |v_#memory_int_50| ULTIMATE.start_main_p5)) (= (select |v_#memory_int_50| ULTIMATE.start_main_p6) 0) (= 0 (select |v_#memory_int_50| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= |#memory_int| (store |v_#memory_int_50| ULTIMATE.start_main_p4 (+ .cse0 (- 1)))) (= 0 (select |v_#memory_int_50| ULTIMATE.start_main_p1)) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 .cse0))) [2019-02-28 13:25:36,695 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, ULTIMATE.start_main_p5, ULTIMATE.start_main_p2]. (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= (+ (select |#memory_int| ULTIMATE.start_main_p4) 1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6))) [2019-02-28 13:25:36,941 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:25:36,943 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:25:36,944 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:25:36,946 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:25:36,947 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:25:36,949 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:25:36,950 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:25:36,952 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:25:36,953 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:25:36,954 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:25:36,956 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:25:36,957 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:25:36,959 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:25:36,960 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:25:36,961 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:25:36,964 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2019-02-28 13:25:36,976 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:25:37,011 INFO L315 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-28 13:25:37,012 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:50 [2019-02-28 13:28:57,304 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:28:57,305 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_51|, ULTIMATE.start_main_p6, ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, ULTIMATE.start_main_p2, ULTIMATE.start_main_p5]. (let ((.cse0 (select |v_#memory_int_51| ULTIMATE.start_main_p6))) (and (= (select |v_#memory_int_51| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= (select |v_#memory_int_51| ULTIMATE.start_main_p2) 0) (= (store |v_#memory_int_51| ULTIMATE.start_main_p6 (+ .cse0 (- 1))) |#memory_int|) (= (select |v_#memory_int_51| ULTIMATE.start_main_p5) 0) (= 0 (+ (select |v_#memory_int_51| ULTIMATE.start_main_p4) 1)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |v_#memory_int_51| ULTIMATE.start_main_p1) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= .cse0 0))) [2019-02-28 13:28:57,305 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, ULTIMATE.start_main_p5, ULTIMATE.start_main_p2, ULTIMATE.start_main_p6]. (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= (+ (select |#memory_int| ULTIMATE.start_main_p4) 1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p6) 1))) [2019-02-28 13:28:57,707 INFO L273 TraceCheckUtils]: 0: Hoare triple {1118#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6;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;assume main_p1 < main_p2;assume main_p2 < main_p3;assume main_p3 < main_p4;assume main_p4 < main_p5;assume main_p5 < main_p6;#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]; {1126#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (exists ((ULTIMATE.start_main_p5 Int)) (and (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5))) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))} is VALID [2019-02-28 13:28:57,715 INFO L273 TraceCheckUtils]: 1: Hoare triple {1126#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (exists ((ULTIMATE.start_main_p5 Int)) (and (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5))) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))} #memory_int := #memory_int[main_p4 := #memory_int[main_p4] - 1]; {1130#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (= (+ (select |#memory_int| ULTIMATE.start_main_p4) 1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))} is VALID [2019-02-28 13:28:57,733 INFO L273 TraceCheckUtils]: 2: Hoare triple {1130#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p4 Int) (ULTIMATE.start_main_p5 Int) (ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (= (+ (select |#memory_int| ULTIMATE.start_main_p4) 1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2))) (= 0 (select |#memory_int| ULTIMATE.start_main_p6)))} #memory_int := #memory_int[main_p6 := #memory_int[main_p6] - 1]; {1134#(and (= (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_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (= (+ (select |#memory_int| ULTIMATE.start_main_p4) 1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p6) 1)))))} is VALID [2019-02-28 13:28:57,734 INFO L273 TraceCheckUtils]: 3: Hoare triple {1134#(and (= (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_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (= (+ (select |#memory_int| ULTIMATE.start_main_p4) 1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p6) 1)))))} assume !(#memory_int[main_p1] >= 0); {1119#false} is VALID [2019-02-28 13:28:57,734 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:28:57,734 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 13:28:57,790 INFO L273 TraceCheckUtils]: 3: Hoare triple {1138#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {1119#false} is VALID [2019-02-28 13:28:57,791 INFO L273 TraceCheckUtils]: 2: Hoare triple {1142#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p6 (+ (select |#memory_int| ULTIMATE.start_main_p6) (- 1))) ULTIMATE.start_main_p1))} #memory_int := #memory_int[main_p6 := #memory_int[main_p6] - 1]; {1138#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2019-02-28 13:28:57,793 INFO L273 TraceCheckUtils]: 1: Hoare triple {1146#(<= 0 (select (store (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p6 (+ (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p6) (- 1))) ULTIMATE.start_main_p1))} #memory_int := #memory_int[main_p4 := #memory_int[main_p4] - 1]; {1142#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p6 (+ (select |#memory_int| ULTIMATE.start_main_p6) (- 1))) ULTIMATE.start_main_p1))} is VALID [2019-02-28 13:28:57,796 INFO L273 TraceCheckUtils]: 0: Hoare triple {1118#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6;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;assume main_p1 < main_p2;assume main_p2 < main_p3;assume main_p3 < main_p4;assume main_p4 < main_p5;assume main_p5 < main_p6;#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]; {1146#(<= 0 (select (store (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p6 (+ (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p6) (- 1))) ULTIMATE.start_main_p1))} is VALID [2019-02-28 13:28:57,796 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:28:57,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 13:28:57,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 13:28:57,817 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 13:28:57,817 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-28 13:28:57,817 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:28:57,817 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2019-02-28 13:28:57,861 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:28:57,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 13:28:57,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 13:28:57,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-28 13:28:57,862 INFO L87 Difference]: Start difference. First operand 30 states and 105 transitions. Second operand 8 states. [2019-02-28 13:28:59,225 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2019-02-28 13:29:03,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:29:03,207 INFO L93 Difference]: Finished difference Result 60 states and 147 transitions. [2019-02-28 13:29:03,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 13:29:03,208 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-28 13:29:03,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:29:03,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-28 13:29:03,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2019-02-28 13:29:03,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-28 13:29:03,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2019-02-28 13:29:03,210 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 76 transitions. [2019-02-28 13:29:04,496 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:29:04,497 INFO L225 Difference]: With dead ends: 60 [2019-02-28 13:29:04,497 INFO L226 Difference]: Without dead ends: 56 [2019-02-28 13:29:04,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-28 13:29:04,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-02-28 13:29:04,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 30. [2019-02-28 13:29:04,597 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:29:04,597 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 30 states. [2019-02-28 13:29:04,598 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 30 states. [2019-02-28 13:29:04,598 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 30 states. [2019-02-28 13:29:04,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:29:04,601 INFO L93 Difference]: Finished difference Result 56 states and 142 transitions. [2019-02-28 13:29:04,601 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 142 transitions. [2019-02-28 13:29:04,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:29:04,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:29:04,602 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 56 states. [2019-02-28 13:29:04,602 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 56 states. [2019-02-28 13:29:04,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:29:04,605 INFO L93 Difference]: Finished difference Result 56 states and 142 transitions. [2019-02-28 13:29:04,605 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 142 transitions. [2019-02-28 13:29:04,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:29:04,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:29:04,606 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:29:04,606 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:29:04,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-02-28 13:29:04,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 110 transitions. [2019-02-28 13:29:04,608 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 110 transitions. Word has length 4 [2019-02-28 13:29:04,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:29:04,608 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 110 transitions. [2019-02-28 13:29:04,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 13:29:04,608 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 110 transitions. [2019-02-28 13:29:04,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 13:29:04,609 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:29:04,609 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 13:29:04,609 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:29:04,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:29:04,610 INFO L82 PathProgramCache]: Analyzing trace with hash 941156, now seen corresponding path program 1 times [2019-02-28 13:29:04,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:29:04,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:29:04,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:29:04,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:29:04,611 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:29:04,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:29:04,778 INFO L273 TraceCheckUtils]: 0: Hoare triple {1383#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5, main_p6;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;assume main_p1 < main_p2;assume main_p2 < main_p3;assume main_p3 < main_p4;assume main_p4 < main_p5;assume main_p5 < main_p6;#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]; {1385#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (= 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-28 13:29:04,781 INFO L273 TraceCheckUtils]: 1: Hoare triple {1385#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (= 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]; {1386#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1)))} is VALID [2019-02-28 13:29:04,782 INFO L273 TraceCheckUtils]: 2: Hoare triple {1386#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1)))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {1387#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-02-28 13:29:04,782 INFO L273 TraceCheckUtils]: 3: Hoare triple {1387#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {1384#false} is VALID [2019-02-28 13:29:04,782 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:29:04,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:29:04,783 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 13:29:04,783 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 13:29:04,783 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [27] [2019-02-28 13:29:04,784 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 13:29:04,784 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 13:29:04,795 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 13:29:04,795 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 13:29:04,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:29:04,796 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 13:29:04,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:29:04,796 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 13:29:04,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:29:04,805 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 13:29:04,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:29:04,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-28 13:29:04,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:29:04,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 13:29:04,848 INFO L442 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 21 treesize of output 24 [2019-02-28 13:29:04,854 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:29:04,855 INFO L442 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 24 treesize of output 26 [2019-02-28 13:29:04,863 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:29:04,865 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:29:04,866 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:29:04,867 INFO L442 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 26 treesize of output 28 [2019-02-28 13:29:04,881 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:29:04,882 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:29:04,884 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:29:04,885 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:29:04,886 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:29:04,888 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:29:04,889 INFO L442 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 28 treesize of output 30 [2019-02-28 13:29:04,902 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:29:04,903 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:29:04,903 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:29:04,904 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:29:04,906 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:29:04,907 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:29:04,908 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:29:04,910 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:29:04,911 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:29:04,912 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:29:04,914 INFO L442 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 30 treesize of output 32 [2019-02-28 13:29:04,923 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:29:04,924 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:29:04,926 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:29:04,927 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:29:04,928 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:29:04,930 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:29:04,931 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:29:04,932 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:29:04,934 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:29:04,935 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:29:04,936 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:29:04,938 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:29:04,939 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:29:04,940 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:29:04,942 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:29:04,943 INFO L442 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-02-28 13:29:04,945 INFO L315 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-28 13:29:04,960 INFO L315 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:29:04,975 INFO L315 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:29:05,033 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:29:05,046 INFO L315 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:29:05,062 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:29:05,093 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:29:05,099 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 3 [2019-02-28 13:29:05,100 INFO L315 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-28 13:29:05,102 INFO L315 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 13:29:05,129 INFO L315 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-28 13:29:05,130 INFO L209 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:45, output treesize:46 [2019-02-28 13:29:05,142 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:29:05,142 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_54|, ULTIMATE.start_main_p3, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6, |v_#valid_14|]. (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= (store (store (store (store (store (store |v_#memory_int_54| 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) |#memory_int|) (= (select (store |v_#valid_14| ULTIMATE.start_main_p1 1) ULTIMATE.start_main_p2) 0) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) [2019-02-28 13:29:05,142 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6]. (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p6))) [2019-02-28 13:29:05,207 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:29:05,209 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:29:05,210 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:29:05,211 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:29:05,212 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:29:05,213 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:29:05,215 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:29:05,216 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:29:05,217 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:29:05,218 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:29:05,220 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:29:05,221 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:29:05,222 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:29:05,223 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:29:05,225 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:29:05,226 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-02-28 13:29:05,229 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:29:05,264 INFO L315 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-28 13:29:05,264 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:48 [2019-02-28 13:32:26,322 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-28 13:32:26,323 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_55|, ULTIMATE.start_main_p4, ULTIMATE.start_main_p3, ULTIMATE.start_main_p6, ULTIMATE.start_main_p5]. (let ((.cse0 (select |v_#memory_int_55| ULTIMATE.start_main_p4))) (and (= (select |v_#memory_int_55| ULTIMATE.start_main_p2) 0) (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= (select |v_#memory_int_55| ULTIMATE.start_main_p6) 0) (= (select |v_#memory_int_55| ULTIMATE.start_main_p5) 0) (= 0 (select |v_#memory_int_55| ULTIMATE.start_main_p1)) (= (select |v_#memory_int_55| ULTIMATE.start_main_p3) 0) (= 0 .cse0) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= (store |v_#memory_int_55| ULTIMATE.start_main_p4 (+ .cse0 (- 1))) |#memory_int|))) [2019-02-28 13:32:26,323 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, ULTIMATE.start_main_p5, ULTIMATE.start_main_p6]. (and (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= (+ (select |#memory_int| ULTIMATE.start_main_p4) 1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (< ULTIMATE.start_main_p5 ULTIMATE.start_main_p6) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2) (= 0 (select |#memory_int| ULTIMATE.start_main_p6))) [2019-02-28 13:32:27,034 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:32:27,036 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:32:27,037 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:32:27,038 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:32:27,040 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:32:27,041 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:32:27,042 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:32:27,044 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:32:27,045 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:32:27,046 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:32:27,048 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:32:27,049 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:32:27,050 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:32:27,051 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:32:27,053 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 13:32:27,055 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2019-02-28 13:32:27,057 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:32:27,088 INFO L315 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-02-28 13:32:27,089 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:58, output treesize:50