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-15a42f0 [2018-12-18 22:12:25,065 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-18 22:12:25,067 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-18 22:12:25,084 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-18 22:12:25,084 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-18 22:12:25,086 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-18 22:12:25,088 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-18 22:12:25,090 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-18 22:12:25,093 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-18 22:12:25,094 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-18 22:12:25,094 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-18 22:12:25,096 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-18 22:12:25,097 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-18 22:12:25,099 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-18 22:12:25,108 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-18 22:12:25,109 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-18 22:12:25,109 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-18 22:12:25,111 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-18 22:12:25,114 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-18 22:12:25,118 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-18 22:12:25,119 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-18 22:12:25,121 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-18 22:12:25,122 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-18 22:12:25,124 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-18 22:12:25,125 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-18 22:12:25,126 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-18 22:12:25,126 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-18 22:12:25,127 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-18 22:12:25,130 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-18 22:12:25,131 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-18 22:12:25,131 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-18 22:12:25,131 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-18 22:12:25,132 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-18 22:12:25,132 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-18 22:12:25,133 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-18 22:12:25,135 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-18 22:12:25,135 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 [2018-12-18 22:12:25,159 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-18 22:12:25,160 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-18 22:12:25,162 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-18 22:12:25,162 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-18 22:12:25,162 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-18 22:12:25,163 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-18 22:12:25,163 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2018-12-18 22:12:25,163 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-18 22:12:25,163 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-18 22:12:25,163 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-18 22:12:25,166 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-18 22:12:25,166 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-18 22:12:25,166 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-18 22:12:25,166 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-18 22:12:25,167 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-18 22:12:25,167 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-18 22:12:25,167 INFO L133 SettingsManager]: * Use SBE=true [2018-12-18 22:12:25,167 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-18 22:12:25,168 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-18 22:12:25,168 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-18 22:12:25,168 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-18 22:12:25,168 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-18 22:12:25,168 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-18 22:12:25,168 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-18 22:12:25,170 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-18 22:12:25,171 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-18 22:12:25,171 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-18 22:12:25,171 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-18 22:12:25,171 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-18 22:12:25,171 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-18 22:12:25,172 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-18 22:12:25,172 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-18 22:12:25,172 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-18 22:12:25,172 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-18 22:12:25,172 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-18 22:12:25,172 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-18 22:12:25,173 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-18 22:12:25,173 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-18 22:12:25,173 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-18 22:12:25,173 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-18 22:12:25,227 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-18 22:12:25,244 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-18 22:12:25,252 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-18 22:12:25,254 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-18 22:12:25,255 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-18 22:12:25,255 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 [2018-12-18 22:12:25,256 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-6-limited.bpl' [2018-12-18 22:12:25,325 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-18 22:12:25,327 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-18 22:12:25,328 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-18 22:12:25,328 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-18 22:12:25,328 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-18 22:12:25,347 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 18.12 10:12:25" (1/1) ... [2018-12-18 22:12:25,361 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 18.12 10:12:25" (1/1) ... [2018-12-18 22:12:25,406 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-18 22:12:25,406 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-18 22:12:25,407 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-18 22:12:25,407 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-18 22:12:25,422 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 18.12 10:12:25" (1/1) ... [2018-12-18 22:12:25,422 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 18.12 10:12:25" (1/1) ... [2018-12-18 22:12:25,424 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 18.12 10:12:25" (1/1) ... [2018-12-18 22:12:25,425 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 18.12 10:12:25" (1/1) ... [2018-12-18 22:12:25,431 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 18.12 10:12:25" (1/1) ... [2018-12-18 22:12:25,435 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 18.12 10:12:25" (1/1) ... [2018-12-18 22:12:25,439 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 18.12 10:12:25" (1/1) ... [2018-12-18 22:12:25,440 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-18 22:12:25,445 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-18 22:12:25,446 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-18 22:12:25,446 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-18 22:12:25,447 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 18.12 10:12:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-18 22:12:25,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-18 22:12:25,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-18 22:12:26,308 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-18 22:12:26,309 INFO L280 CfgBuilder]: Removed 15 assue(true) statements. [2018-12-18 22:12:26,309 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:12:26 BoogieIcfgContainer [2018-12-18 22:12:26,310 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-18 22:12:26,311 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-18 22:12:26,311 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-18 22:12:26,314 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-18 22:12:26,314 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 18.12 10:12:25" (1/2) ... [2018-12-18 22:12:26,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f724bdb and model type speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:12:26, skipping insertion in model container [2018-12-18 22:12:26,316 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 18.12 10:12:26" (2/2) ... [2018-12-18 22:12:26,317 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-6-limited.bpl [2018-12-18 22:12:26,328 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-18 22:12:26,336 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-12-18 22:12:26,354 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2018-12-18 22:12:26,389 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-18 22:12:26,389 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-18 22:12:26,389 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-18 22:12:26,389 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-18 22:12:26,389 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-18 22:12:26,390 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-18 22:12:26,390 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-18 22:12:26,390 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-18 22:12:26,408 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2018-12-18 22:12:26,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-12-18 22:12:26,426 INFO L394 BasicCegarLoop]: Found error trace [2018-12-18 22:12:26,427 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2018-12-18 22:12:26,430 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2018-12-18 22:12:26,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 22:12:26,436 INFO L82 PathProgramCache]: Analyzing trace with hash 988, now seen corresponding path program 1 times [2018-12-18 22:12:26,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-18 22:12:26,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:12:26,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 22:12:26,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:12:26,490 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-18 22:12:26,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:12:26,750 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 [2018-12-18 22:12:26,755 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 [2018-12-18 22:12:26,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 22:12:26,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-18 22:12:26,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-18 22:12:26,761 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-18 22:12:26,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-12-18 22:12:26,767 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-18 22:12:26,771 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-12-18 22:12:26,784 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 22:12:26,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-18 22:12:26,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-18 22:12:26,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-18 22:12:26,795 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. [2018-12-18 22:12:27,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:12:27,227 INFO L93 Difference]: Finished difference Result 29 states and 39 transitions. [2018-12-18 22:12:27,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-18 22:12:27,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-12-18 22:12:27,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-18 22:12:27,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-18 22:12:27,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2018-12-18 22:12:27,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-18 22:12:27,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2018-12-18 22:12:27,236 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 39 transitions. [2018-12-18 22:12:27,416 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 22:12:27,427 INFO L225 Difference]: With dead ends: 29 [2018-12-18 22:12:27,427 INFO L226 Difference]: Without dead ends: 24 [2018-12-18 22:12:27,431 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 [2018-12-18 22:12:27,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-18 22:12:27,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 14. [2018-12-18 22:12:27,491 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-18 22:12:27,492 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 14 states. [2018-12-18 22:12:27,492 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 14 states. [2018-12-18 22:12:27,493 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 14 states. [2018-12-18 22:12:27,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:12:27,497 INFO L93 Difference]: Finished difference Result 24 states and 34 transitions. [2018-12-18 22:12:27,497 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-12-18 22:12:27,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:12:27,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:12:27,498 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 24 states. [2018-12-18 22:12:27,499 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 24 states. [2018-12-18 22:12:27,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:12:27,502 INFO L93 Difference]: Finished difference Result 24 states and 34 transitions. [2018-12-18 22:12:27,502 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-12-18 22:12:27,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:12:27,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:12:27,504 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-18 22:12:27,504 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-18 22:12:27,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-18 22:12:27,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-12-18 22:12:27,508 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 2 [2018-12-18 22:12:27,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-18 22:12:27,508 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2018-12-18 22:12:27,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-18 22:12:27,511 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2018-12-18 22:12:27,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-18 22:12:27,511 INFO L394 BasicCegarLoop]: Found error trace [2018-12-18 22:12:27,512 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-18 22:12:27,512 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2018-12-18 22:12:27,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 22:12:27,513 INFO L82 PathProgramCache]: Analyzing trace with hash 30376, now seen corresponding path program 1 times [2018-12-18 22:12:27,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-18 22:12:27,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:12:27,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 22:12:27,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:12:27,515 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-18 22:12:27,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:12:27,753 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2018-12-18 22:12:27,801 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 [2018-12-18 22:12:27,803 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 [2018-12-18 22:12:27,805 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 [2018-12-18 22:12:27,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 22:12:27,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-18 22:12:27,806 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-18 22:12:27,808 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2018-12-18 22:12:27,810 INFO L207 CegarAbsIntRunner]: [0], [18], [27] [2018-12-18 22:12:27,849 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-18 22:12:27,849 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-18 22:12:28,010 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-18 22:12:28,011 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. [2018-12-18 22:12:28,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 22:12:28,018 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-18 22:12:28,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-18 22:12:28,019 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 [2018-12-18 22:12:28,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 22:12:28,033 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-18 22:12:28,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:12:28,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:12:28,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-18 22:12:28,908 WARN L181 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2018-12-18 22:12:28,945 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-18 22:12:28,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-18 22:12:29,008 INFO L478 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 [2018-12-18 22:12:29,025 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:29,028 INFO L478 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 30 [2018-12-18 22:12:29,076 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:29,086 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:29,088 INFO L478 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 40 [2018-12-18 22:12:29,213 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:29,214 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:29,215 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:29,218 INFO L478 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 54 [2018-12-18 22:12:29,285 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:29,287 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:29,289 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:29,291 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:29,295 INFO L478 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 72 [2018-12-18 22:12:29,344 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:29,348 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:29,349 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:29,352 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:29,353 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:29,357 INFO L478 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 91 [2018-12-18 22:12:29,363 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-18 22:12:29,432 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:12:29,461 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:12:29,481 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:12:29,499 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:12:29,520 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:12:29,570 INFO L267 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. [2018-12-18 22:12:29,570 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:45, output treesize:46 [2018-12-18 22:12:29,607 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 22:12:29,608 WARN L384 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)) [2018-12-18 22:12:29,608 WARN L385 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_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))) [2018-12-18 22:12:29,979 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:29,981 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:29,984 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:29,990 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:29,991 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:30,018 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:30,032 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:30,033 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:30,034 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:30,034 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:30,037 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:30,039 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:30,040 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:30,041 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:30,042 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:30,044 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:12:30,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2018-12-18 22:12:30,053 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-18 22:12:30,165 INFO L267 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. [2018-12-18 22:12:30,165 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:46 [2018-12-18 22:12:32,207 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 22:12:32,208 WARN L384 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|))) [2018-12-18 22:12:32,208 WARN L385 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 (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))) [2018-12-18 22:12:32,434 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 [2018-12-18 22:12:32,454 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 [2018-12-18 22:12:32,455 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 [2018-12-18 22:12:32,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 22:12:32,456 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-18 22:12:32,482 INFO L273 TraceCheckUtils]: 2: Hoare triple {133#(<= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] <= 0); {119#false} is VALID [2018-12-18 22:12:32,484 INFO L273 TraceCheckUtils]: 1: Hoare triple {137#(<= (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p4 := #memory_int[main_p4] - 1]; {133#(<= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2018-12-18 22:12:32,486 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#(<= (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1) 0)} is VALID [2018-12-18 22:12:32,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-18 22:12:32,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-18 22:12:32,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2018-12-18 22:12:32,508 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-18 22:12:32,508 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-12-18 22:12:32,509 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-18 22:12:32,510 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-12-18 22:12:32,515 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 22:12:32,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-18 22:12:32,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-18 22:12:32,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2018-12-18 22:12:32,516 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 4 states. [2018-12-18 22:12:32,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:12:32,621 INFO L93 Difference]: Finished difference Result 16 states and 33 transitions. [2018-12-18 22:12:32,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-18 22:12:32,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-12-18 22:12:32,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-18 22:12:32,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-18 22:12:32,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2018-12-18 22:12:32,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-18 22:12:32,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2018-12-18 22:12:32,625 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 26 transitions. [2018-12-18 22:12:32,687 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 22:12:32,689 INFO L225 Difference]: With dead ends: 16 [2018-12-18 22:12:32,689 INFO L226 Difference]: Without dead ends: 15 [2018-12-18 22:12:32,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2018-12-18 22:12:32,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-18 22:12:32,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-12-18 22:12:32,697 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-18 22:12:32,697 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 14 states. [2018-12-18 22:12:32,697 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 14 states. [2018-12-18 22:12:32,698 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 14 states. [2018-12-18 22:12:32,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:12:32,700 INFO L93 Difference]: Finished difference Result 15 states and 32 transitions. [2018-12-18 22:12:32,700 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 32 transitions. [2018-12-18 22:12:32,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:12:32,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:12:32,701 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 15 states. [2018-12-18 22:12:32,701 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 15 states. [2018-12-18 22:12:32,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:12:32,703 INFO L93 Difference]: Finished difference Result 15 states and 32 transitions. [2018-12-18 22:12:32,703 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 32 transitions. [2018-12-18 22:12:32,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:12:32,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:12:32,704 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-18 22:12:32,704 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-18 22:12:32,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-18 22:12:32,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2018-12-18 22:12:32,706 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 3 [2018-12-18 22:12:32,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-18 22:12:32,706 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2018-12-18 22:12:32,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-18 22:12:32,706 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2018-12-18 22:12:32,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-18 22:12:32,707 INFO L394 BasicCegarLoop]: Found error trace [2018-12-18 22:12:32,707 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-18 22:12:32,708 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2018-12-18 22:12:32,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 22:12:32,708 INFO L82 PathProgramCache]: Analyzing trace with hash 30004, now seen corresponding path program 1 times [2018-12-18 22:12:32,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-18 22:12:32,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:12:32,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 22:12:32,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:12:32,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-18 22:12:32,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-18 22:12:32,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-18 22:12:32,786 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-18 22:12:32,802 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-12-18 22:12:32,802 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2018-12-18 22:12:32,803 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2018-12-18 22:12:32,803 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2018-12-18 22:12:32,803 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2018-12-18 22:12:32,803 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2018-12-18 22:12:32,803 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2018-12-18 22:12:32,803 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2018-12-18 22:12:32,803 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2018-12-18 22:12:32,803 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2018-12-18 22:12:32,803 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2018-12-18 22:12:32,804 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2018-12-18 22:12:32,804 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2018-12-18 22:12:32,804 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2018-12-18 22:12:32,804 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2018-12-18 22:12:32,804 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2018-12-18 22:12:32,804 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2018-12-18 22:12:32,805 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2018-12-18 22:12:32,805 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2018-12-18 22:12:32,805 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-12-18 22:12:32,805 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-12-18 22:12:32,808 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-6-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 10:12:32 BoogieIcfgContainer [2018-12-18 22:12:32,808 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-18 22:12:32,817 INFO L168 Benchmark]: Toolchain (without parser) took 7483.59 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 705.7 MB). Free memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: -576.2 MB). Peak memory consumption was 129.5 MB. Max. memory is 7.1 GB. [2018-12-18 22:12:32,818 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-18 22:12:32,819 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.13 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-18 22:12:32,819 INFO L168 Benchmark]: Boogie Preprocessor took 34.01 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-18 22:12:32,821 INFO L168 Benchmark]: RCFGBuilder took 864.32 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-12-18 22:12:32,822 INFO L168 Benchmark]: TraceAbstraction took 6497.53 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 705.7 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -608.0 MB). Peak memory consumption was 97.7 MB. Max. memory is 7.1 GB. [2018-12-18 22:12:32,827 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 78.13 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.01 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 864.32 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6497.53 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 705.7 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -608.0 MB). Peak memory consumption was 97.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 53]: assertion can be violated assertion can be violated We found a FailurePath: [L62-L63] modifies #valid; [L62-L64] ensures old(#valid)[ptr] == 0; [L62-L65] ensures #valid == old(#valid)[ptr := 1]; [L62-L63] modifies #valid; [L62-L64] ensures old(#valid)[ptr] == 0; [L62-L65] ensures #valid == old(#valid)[ptr := 1]; [L62-L63] modifies #valid; [L62-L64] ensures old(#valid)[ptr] == 0; [L62-L65] ensures #valid == old(#valid)[ptr := 1]; [L62-L63] modifies #valid; [L62-L64] ensures old(#valid)[ptr] == 0; [L62-L65] ensures #valid == old(#valid)[ptr := 1]; [L62-L63] modifies #valid; [L62-L64] ensures old(#valid)[ptr] == 0; [L62-L65] ensures #valid == old(#valid)[ptr := 1]; [L62-L63] modifies #valid; [L62-L64] ensures old(#valid)[ptr] == 0; [L62-L65] ensures #valid == old(#valid)[ptr := 1]; [L24] assume p1 < p2; [L25] assume p2 < p3; [L26] assume p3 < p4; [L27] assume p4 < p5; [L28] assume p5 < p6; [L30] #memory_int[p1] := 0; [L31] #memory_int[p2] := 0; [L32] #memory_int[p3] := 0; [L33] #memory_int[p4] := 0; [L34] #memory_int[p5] := 0; [L35] #memory_int[p6] := 0; [L39] #memory_int[p1] := #memory_int[p1] + 1; [L53] assert #memory_int[p1] <= 0; - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 15 locations, 6 error locations. UNSAFE Result, 6.4s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5 SDtfs, 22 SDslu, 1 SDs, 0 SdLazy, 65 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 11 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 7 ConstructedInterpolants, 2 QuantifiedInterpolants, 283 SizeOfPredicates, 5 NumberOfNonLiveVariables, 26 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 1/3 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...