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_array_oct.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-15a42f0 [2018-12-18 22:32:16,338 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-18 22:32:16,340 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-18 22:32:16,353 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-18 22:32:16,353 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-18 22:32:16,354 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-18 22:32:16,356 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-18 22:32:16,358 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-18 22:32:16,360 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-18 22:32:16,361 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-18 22:32:16,362 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-18 22:32:16,362 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-18 22:32:16,364 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-18 22:32:16,365 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-18 22:32:16,366 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-18 22:32:16,367 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-18 22:32:16,368 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-18 22:32:16,370 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-18 22:32:16,372 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-18 22:32:16,374 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-18 22:32:16,376 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-18 22:32:16,377 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-18 22:32:16,380 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-18 22:32:16,380 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-18 22:32:16,380 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-18 22:32:16,381 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-18 22:32:16,382 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-18 22:32:16,383 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-18 22:32:16,384 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-18 22:32:16,386 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-18 22:32:16,386 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-18 22:32:16,387 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-18 22:32:16,387 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-18 22:32:16,387 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-18 22:32:16,389 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-18 22:32:16,389 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-18 22:32:16,390 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2018-12-18 22:32:16,404 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-18 22:32:16,404 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-18 22:32:16,405 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-18 22:32:16,406 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-18 22:32:16,406 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-18 22:32:16,406 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-18 22:32:16,406 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2018-12-18 22:32:16,407 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-18 22:32:16,407 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-18 22:32:16,407 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-18 22:32:16,407 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-18 22:32:16,407 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-18 22:32:16,408 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-18 22:32:16,408 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-18 22:32:16,409 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-18 22:32:16,409 INFO L133 SettingsManager]: * Use SBE=true [2018-12-18 22:32:16,409 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-18 22:32:16,409 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-18 22:32:16,409 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-18 22:32:16,410 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-18 22:32:16,410 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-18 22:32:16,410 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-18 22:32:16,410 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-18 22:32:16,410 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-18 22:32:16,411 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-18 22:32:16,411 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-18 22:32:16,411 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-18 22:32:16,411 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-18 22:32:16,411 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-18 22:32:16,411 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-18 22:32:16,412 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-18 22:32:16,412 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-18 22:32:16,412 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-18 22:32:16,412 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-18 22:32:16,412 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-18 22:32:16,413 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-18 22:32:16,413 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-18 22:32:16,413 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-18 22:32:16,413 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-18 22:32:16,444 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-18 22:32:16,458 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-18 22:32:16,462 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-18 22:32:16,464 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-18 22:32:16,465 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-18 22:32:16,466 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-unlimited.bpl [2018-12-18 22:32:16,466 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-unlimited.bpl' [2018-12-18 22:32:16,517 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-18 22:32:16,519 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-18 22:32:16,520 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-18 22:32:16,520 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-18 22:32:16,520 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-18 22:32:16,544 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:32:16" (1/1) ... [2018-12-18 22:32:16,559 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:32:16" (1/1) ... [2018-12-18 22:32:16,591 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-18 22:32:16,593 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-18 22:32:16,593 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-18 22:32:16,593 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-18 22:32:16,605 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:32:16" (1/1) ... [2018-12-18 22:32:16,606 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:32:16" (1/1) ... [2018-12-18 22:32:16,608 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:32:16" (1/1) ... [2018-12-18 22:32:16,608 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:32:16" (1/1) ... [2018-12-18 22:32:16,612 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:32:16" (1/1) ... [2018-12-18 22:32:16,616 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:32:16" (1/1) ... [2018-12-18 22:32:16,618 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:32:16" (1/1) ... [2018-12-18 22:32:16,620 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-18 22:32:16,620 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-18 22:32:16,620 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-18 22:32:16,621 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-18 22:32:16,622 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:32:16" (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:32:16,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-18 22:32:16,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-18 22:32:17,353 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-18 22:32:17,354 INFO L280 CfgBuilder]: Removed 13 assue(true) statements. [2018-12-18 22:32:17,354 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:32:17 BoogieIcfgContainer [2018-12-18 22:32:17,354 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-18 22:32:17,356 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-18 22:32:17,356 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-18 22:32:17,359 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-18 22:32:17,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.12 10:32:16" (1/2) ... [2018-12-18 22:32:17,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@597dfd04 and model type speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:32:17, skipping insertion in model container [2018-12-18 22:32:17,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:32:17" (2/2) ... [2018-12-18 22:32:17,363 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-5-unlimited.bpl [2018-12-18 22:32:17,373 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-18 22:32:17,382 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-12-18 22:32:17,400 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2018-12-18 22:32:17,435 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-18 22:32:17,435 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-18 22:32:17,435 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-18 22:32:17,436 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-18 22:32:17,436 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-18 22:32:17,436 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-18 22:32:17,436 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-18 22:32:17,436 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-18 22:32:17,452 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2018-12-18 22:32:17,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-12-18 22:32:17,459 INFO L394 BasicCegarLoop]: Found error trace [2018-12-18 22:32:17,460 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2018-12-18 22:32:17,462 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2018-12-18 22:32:17,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 22:32:17,469 INFO L82 PathProgramCache]: Analyzing trace with hash 984, now seen corresponding path program 1 times [2018-12-18 22:32:17,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-18 22:32:17,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:32:17,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 22:32:17,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:32:17,522 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-18 22:32:17,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:32:17,723 INFO L273 TraceCheckUtils]: 0: Hoare triple {16#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5;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;#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]; {18#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2018-12-18 22:32:17,740 INFO L273 TraceCheckUtils]: 1: Hoare triple {18#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] <= 0); {17#false} is VALID [2018-12-18 22:32:17,742 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:32:17,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-18 22:32:17,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-18 22:32:17,744 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-18 22:32:17,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-12-18 22:32:17,751 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-18 22:32:17,755 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-12-18 22:32:17,782 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:32:17,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-18 22:32:17,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-18 22:32:17,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-18 22:32:17,793 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 3 states. [2018-12-18 22:32:18,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:32:18,237 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2018-12-18 22:32:18,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-18 22:32:18,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-12-18 22:32:18,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-18 22:32:18,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-18 22:32:18,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2018-12-18 22:32:18,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-18 22:32:18,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2018-12-18 22:32:18,247 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 33 transitions. [2018-12-18 22:32:18,344 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 22:32:18,357 INFO L225 Difference]: With dead ends: 25 [2018-12-18 22:32:18,357 INFO L226 Difference]: Without dead ends: 20 [2018-12-18 22:32:18,361 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:32:18,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-18 22:32:18,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 12. [2018-12-18 22:32:18,435 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-18 22:32:18,436 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 12 states. [2018-12-18 22:32:18,437 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 12 states. [2018-12-18 22:32:18,437 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 12 states. [2018-12-18 22:32:18,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:32:18,442 INFO L93 Difference]: Finished difference Result 20 states and 28 transitions. [2018-12-18 22:32:18,442 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-12-18 22:32:18,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:32:18,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:32:18,443 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 20 states. [2018-12-18 22:32:18,443 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 20 states. [2018-12-18 22:32:18,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:32:18,447 INFO L93 Difference]: Finished difference Result 20 states and 28 transitions. [2018-12-18 22:32:18,447 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-12-18 22:32:18,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:32:18,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:32:18,450 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-18 22:32:18,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-18 22:32:18,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-18 22:32:18,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2018-12-18 22:32:18,457 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 2 [2018-12-18 22:32:18,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-18 22:32:18,458 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2018-12-18 22:32:18,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-18 22:32:18,459 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2018-12-18 22:32:18,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-18 22:32:18,459 INFO L394 BasicCegarLoop]: Found error trace [2018-12-18 22:32:18,460 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-18 22:32:18,461 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2018-12-18 22:32:18,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 22:32:18,462 INFO L82 PathProgramCache]: Analyzing trace with hash 30372, now seen corresponding path program 1 times [2018-12-18 22:32:18,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-18 22:32:18,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:32:18,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 22:32:18,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:32:18,465 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-18 22:32:18,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:32:18,997 INFO L273 TraceCheckUtils]: 0: Hoare triple {102#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5;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;#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]; {104#(and (or (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1))) (or (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4))))} is VALID [2018-12-18 22:32:19,008 INFO L273 TraceCheckUtils]: 1: Hoare triple {104#(and (or (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1))) (or (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4))))} #memory_int := #memory_int[main_p4 := #memory_int[main_p4] - 1]; {105#(or (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (<= (+ (select |#memory_int| ULTIMATE.start_main_p1) 1) 0))} is VALID [2018-12-18 22:32:19,009 INFO L273 TraceCheckUtils]: 2: Hoare triple {105#(or (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (<= (+ (select |#memory_int| ULTIMATE.start_main_p1) 1) 0))} assume !(#memory_int[main_p1] <= 0); {103#false} is VALID [2018-12-18 22:32:19,010 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:32:19,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-18 22:32:19,010 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-18 22:32:19,014 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2018-12-18 22:32:19,016 INFO L207 CegarAbsIntRunner]: [0], [18], [23] [2018-12-18 22:32:19,070 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-18 22:32:19,071 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-18 22:32:21,980 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-18 22:32:21,981 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-18 22:32:21,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 22:32:21,986 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-18 22:32:21,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-18 22:32:21,987 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:32:21,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 22:32:21,997 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-18 22:32:22,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:32:22,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:32:22,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-18 22:32:22,213 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:32:22,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-12-18 22:32:22,441 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:32:22,467 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:32:22,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2018-12-18 22:32:22,567 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:32:22,570 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:32:22,571 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:32:22,573 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:32:22,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-18 22:32:22,580 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-18 22:32:22,595 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:32:22,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:32:22,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-12-18 22:32:22,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2018-12-18 22:32:22,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-12-18 22:32:22,686 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 25 treesize of output 51 [2018-12-18 22:32:22,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2018-12-18 22:32:22,714 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-18 22:32:22,738 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:32:22,756 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:32:22,782 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:32:22,794 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:32:22,835 INFO L267 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. [2018-12-18 22:32:22,836 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2018-12-18 22:32:22,846 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 22:32:22,847 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_27|, ULTIMATE.start_main_p2, ULTIMATE.start_main_p3, ULTIMATE.start_main_p5, |v_#valid_7|]. (let ((.cse0 (store |v_#valid_7| ULTIMATE.start_main_p1 1))) (let ((.cse1 (store .cse0 ULTIMATE.start_main_p2 1))) (and (= 0 (select .cse0 ULTIMATE.start_main_p2)) (= 0 (select (store .cse1 ULTIMATE.start_main_p3 1) ULTIMATE.start_main_p4)) (= (select .cse1 ULTIMATE.start_main_p3) 0) (= |#memory_int| (store (store (store (store (store |v_#memory_int_27| 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))))) [2018-12-18 22:32:22,847 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3, ULTIMATE.start_main_p5, ULTIMATE.start_main_p2]. (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4)) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)) (= (select |#memory_int| ULTIMATE.start_main_p4) 0)) [2018-12-18 22:32:23,061 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2018-12-18 22:32:23,288 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:32:23,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2018-12-18 22:32:23,300 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-18 22:32:23,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-18 22:32:23,345 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2018-12-18 22:32:23,353 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 22:32:23,354 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_28|, ULTIMATE.start_main_p4, ULTIMATE.start_main_p3, ULTIMATE.start_main_p2]. (let ((.cse0 (select |v_#memory_int_28| ULTIMATE.start_main_p4))) (and (= (store |v_#memory_int_28| ULTIMATE.start_main_p4 (+ .cse0 (- 1))) |#memory_int|) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4)) (= 0 (select |v_#memory_int_28| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (select |v_#memory_int_28| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (= 0 (select |v_#memory_int_28| ULTIMATE.start_main_p3)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)) (= .cse0 0))) [2018-12-18 22:32:23,354 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3, ULTIMATE.start_main_p2, ULTIMATE.start_main_p4]. (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p4) (- 1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)) [2018-12-18 22:32:23,390 INFO L273 TraceCheckUtils]: 0: Hoare triple {102#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5;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;#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]; {109#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)))} is VALID [2018-12-18 22:32:23,391 INFO L273 TraceCheckUtils]: 1: Hoare triple {109#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)))} #memory_int := #memory_int[main_p4 := #memory_int[main_p4] - 1]; {113#(and (exists ((ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p4 Int)) (= (+ (select |#memory_int| ULTIMATE.start_main_p4) 1) 0)))} is VALID [2018-12-18 22:32:23,409 INFO L273 TraceCheckUtils]: 2: Hoare triple {113#(and (exists ((ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p4 Int)) (= (+ (select |#memory_int| ULTIMATE.start_main_p4) 1) 0)))} assume !(#memory_int[main_p1] <= 0); {103#false} is VALID [2018-12-18 22:32:23,410 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:32:23,410 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-18 22:32:23,622 INFO L273 TraceCheckUtils]: 2: Hoare triple {105#(or (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (<= (+ (select |#memory_int| ULTIMATE.start_main_p1) 1) 0))} assume !(#memory_int[main_p1] <= 0); {103#false} is VALID [2018-12-18 22:32:23,624 INFO L273 TraceCheckUtils]: 1: Hoare triple {120#(or (= (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1) 0) (<= (+ (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1) 1) 0))} #memory_int := #memory_int[main_p4 := #memory_int[main_p4] - 1]; {105#(or (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (<= (+ (select |#memory_int| ULTIMATE.start_main_p1) 1) 0))} is VALID [2018-12-18 22:32:23,626 INFO L273 TraceCheckUtils]: 0: Hoare triple {102#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5;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;#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]; {120#(or (= (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1) 0) (<= (+ (select (store |#memory_int| ULTIMATE.start_main_p4 (+ (select |#memory_int| ULTIMATE.start_main_p4) (- 1))) ULTIMATE.start_main_p1) 1) 0))} is VALID [2018-12-18 22:32:23,627 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:32:23,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-18 22:32:23,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2018-12-18 22:32:23,650 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-18 22:32:23,651 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-12-18 22:32:23,651 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-18 22:32:23,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-12-18 22:32:23,685 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:32:23,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-18 22:32:23,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-18 22:32:23,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-18 22:32:23,687 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 4 states. [2018-12-18 22:32:23,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:32:23,890 INFO L93 Difference]: Finished difference Result 14 states and 28 transitions. [2018-12-18 22:32:23,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-18 22:32:23,890 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-12-18 22:32:23,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-18 22:32:23,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-18 22:32:23,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2018-12-18 22:32:23,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-18 22:32:23,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2018-12-18 22:32:23,894 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 22 transitions. [2018-12-18 22:32:23,956 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 22:32:23,957 INFO L225 Difference]: With dead ends: 14 [2018-12-18 22:32:23,957 INFO L226 Difference]: Without dead ends: 13 [2018-12-18 22:32:23,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-18 22:32:23,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-18 22:32:23,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-12-18 22:32:23,966 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-18 22:32:23,966 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 12 states. [2018-12-18 22:32:23,966 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 12 states. [2018-12-18 22:32:23,966 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 12 states. [2018-12-18 22:32:23,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:32:23,969 INFO L93 Difference]: Finished difference Result 13 states and 27 transitions. [2018-12-18 22:32:23,970 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 27 transitions. [2018-12-18 22:32:23,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:32:23,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:32:23,971 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 13 states. [2018-12-18 22:32:23,971 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 13 states. [2018-12-18 22:32:23,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:32:23,973 INFO L93 Difference]: Finished difference Result 13 states and 27 transitions. [2018-12-18 22:32:23,973 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 27 transitions. [2018-12-18 22:32:23,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:32:23,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:32:23,974 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-18 22:32:23,974 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-18 22:32:23,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-18 22:32:23,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2018-12-18 22:32:23,976 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 3 [2018-12-18 22:32:23,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-18 22:32:23,976 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2018-12-18 22:32:23,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-18 22:32:23,977 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2018-12-18 22:32:23,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-18 22:32:23,977 INFO L394 BasicCegarLoop]: Found error trace [2018-12-18 22:32:23,977 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-18 22:32:23,978 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2018-12-18 22:32:23,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 22:32:23,978 INFO L82 PathProgramCache]: Analyzing trace with hash 30434, now seen corresponding path program 1 times [2018-12-18 22:32:23,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-18 22:32:23,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:32:23,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 22:32:23,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:32:23,980 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-18 22:32:23,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:32:24,080 INFO L273 TraceCheckUtils]: 0: Hoare triple {180#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5;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;#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]; {182#(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 [2018-12-18 22:32:24,083 INFO L273 TraceCheckUtils]: 1: Hoare triple {182#(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]; {183#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2018-12-18 22:32:24,085 INFO L273 TraceCheckUtils]: 2: Hoare triple {183#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] <= 0); {181#false} is VALID [2018-12-18 22:32:24,085 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:32:24,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-18 22:32:24,085 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-18 22:32:24,086 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2018-12-18 22:32:24,086 INFO L207 CegarAbsIntRunner]: [0], [20], [23] [2018-12-18 22:32:24,088 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-18 22:32:24,089 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-18 22:32:25,523 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-18 22:32:25,523 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-18 22:32:25,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 22:32:25,524 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-18 22:32:25,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-18 22:32:25,524 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 [2018-12-18 22:32:25,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 22:32:25,533 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-18 22:32:25,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:32:25,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-18 22:32:25,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-18 22:32:25,631 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:32:25,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2018-12-18 22:32:25,692 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:32:25,694 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:32:25,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2018-12-18 22:32:25,761 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:32:25,763 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:32:25,764 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:32:25,766 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:32:25,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2018-12-18 22:32:25,851 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:32:25,853 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:32:25,855 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:32:25,862 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:32:25,863 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:32:25,863 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:32:25,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2018-12-18 22:32:25,868 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-18 22:32:25,890 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:32:25,909 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:32:25,932 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:32:25,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-12-18 22:32:25,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2018-12-18 22:32:26,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2018-12-18 22:32:26,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2018-12-18 22:32:26,107 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2018-12-18 22:32:26,115 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-18 22:32:26,150 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:32:26,167 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:32:26,182 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:32:26,196 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-18 22:32:26,251 INFO L267 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. [2018-12-18 22:32:26,251 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:69, output treesize:66 [2018-12-18 22:32:26,259 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 22:32:26,259 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_30|, ULTIMATE.start_main_p2, ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, |v_#valid_8|]. (let ((.cse0 (store |v_#valid_8| ULTIMATE.start_main_p1 1))) (let ((.cse2 (store .cse0 ULTIMATE.start_main_p2 1))) (let ((.cse1 (store .cse2 ULTIMATE.start_main_p3 1))) (and (= 0 (select .cse0 ULTIMATE.start_main_p2)) (= (store (store (store (store (store |v_#memory_int_30| 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) |#memory_int|) (= 0 (select (store .cse1 ULTIMATE.start_main_p4 1) ULTIMATE.start_main_p5)) (= 0 (select .cse1 ULTIMATE.start_main_p4)) (= (select .cse2 ULTIMATE.start_main_p3) 0))))) [2018-12-18 22:32:26,259 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p4, ULTIMATE.start_main_p2, ULTIMATE.start_main_p3]. (and (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p4)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p4) 0)) [2018-12-18 22:32:26,643 INFO L701 Elim1Store]: detected not equals via solver [2018-12-18 22:32:26,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2018-12-18 22:32:26,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-18 22:32:26,700 INFO L267 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. [2018-12-18 22:32:26,700 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:50 [2018-12-18 22:32:28,726 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-12-18 22:32:28,726 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_31|, ULTIMATE.start_main_p5, ULTIMATE.start_main_p2, ULTIMATE.start_main_p3, ULTIMATE.start_main_p4]. (let ((.cse0 (select |v_#memory_int_31| ULTIMATE.start_main_p5))) (and (= (select |v_#memory_int_31| ULTIMATE.start_main_p2) 0) (= 0 (select |v_#memory_int_31| ULTIMATE.start_main_p3)) (= (select |v_#memory_int_31| ULTIMATE.start_main_p4) 0) (= (store |v_#memory_int_31| ULTIMATE.start_main_p5 (+ .cse0 1)) |#memory_int|) (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)) (= (select |v_#memory_int_31| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= .cse0 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)))) [2018-12-18 22:32:28,726 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3, ULTIMATE.start_main_p4, ULTIMATE.start_main_p2, ULTIMATE.start_main_p5]. (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (= 1 (select |#memory_int| ULTIMATE.start_main_p5)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)) (= (select |#memory_int| ULTIMATE.start_main_p4) 0)) [2018-12-18 22:32:28,787 INFO L273 TraceCheckUtils]: 0: Hoare triple {180#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5;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;#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]; {187#(and (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (= (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 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p4)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)))))} is VALID [2018-12-18 22:32:28,789 INFO L273 TraceCheckUtils]: 1: Hoare triple {187#(and (= 0 (select |#memory_int| ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5)) (= (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 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p4)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)))))} #memory_int := #memory_int[main_p5 := #memory_int[main_p5] + 1]; {191#(and (exists ((ULTIMATE.start_main_p5 Int)) (= 1 (select |#memory_int| ULTIMATE.start_main_p5))) (= (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 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)))))} is VALID [2018-12-18 22:32:28,790 INFO L273 TraceCheckUtils]: 2: Hoare triple {191#(and (exists ((ULTIMATE.start_main_p5 Int)) (= 1 (select |#memory_int| ULTIMATE.start_main_p5))) (= (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 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p4)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p4)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (= (select |#memory_int| ULTIMATE.start_main_p4) 0) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4)))))} assume !(#memory_int[main_p1] <= 0); {181#false} is VALID [2018-12-18 22:32:28,791 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:32:28,791 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-18 22:32:28,819 INFO L273 TraceCheckUtils]: 2: Hoare triple {195#(<= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] <= 0); {181#false} is VALID [2018-12-18 22:32:28,822 INFO L273 TraceCheckUtils]: 1: Hoare triple {199#(<= (select (store |#memory_int| ULTIMATE.start_main_p5 (+ (select |#memory_int| ULTIMATE.start_main_p5) 1)) ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p5 := #memory_int[main_p5] + 1]; {195#(<= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2018-12-18 22:32:28,824 INFO L273 TraceCheckUtils]: 0: Hoare triple {180#true} havoc main_p1, main_p2, main_p3, main_p4, main_p5;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;#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]; {199#(<= (select (store |#memory_int| ULTIMATE.start_main_p5 (+ (select |#memory_int| ULTIMATE.start_main_p5) 1)) ULTIMATE.start_main_p1) 0)} is VALID [2018-12-18 22:32:28,825 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:32:28,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-18 22:32:28,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2018-12-18 22:32:28,844 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-18 22:32:28,845 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2018-12-18 22:32:28,845 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-12-18 22:32:28,845 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-12-18 22:32:28,860 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 22:32:28,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-18 22:32:28,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-18 22:32:28,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-18 22:32:28,861 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 6 states. [2018-12-18 22:32:29,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:32:29,620 INFO L93 Difference]: Finished difference Result 40 states and 62 transitions. [2018-12-18 22:32:29,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-18 22:32:29,621 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2018-12-18 22:32:29,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-18 22:32:29,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-18 22:32:29,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2018-12-18 22:32:29,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-18 22:32:29,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2018-12-18 22:32:29,625 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 56 transitions. [2018-12-18 22:32:29,777 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-12-18 22:32:29,779 INFO L225 Difference]: With dead ends: 40 [2018-12-18 22:32:29,779 INFO L226 Difference]: Without dead ends: 37 [2018-12-18 22:32:29,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-12-18 22:32:29,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-18 22:32:29,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 17. [2018-12-18 22:32:29,818 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-12-18 22:32:29,818 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 17 states. [2018-12-18 22:32:29,818 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 17 states. [2018-12-18 22:32:29,818 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 17 states. [2018-12-18 22:32:29,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:32:29,821 INFO L93 Difference]: Finished difference Result 37 states and 58 transitions. [2018-12-18 22:32:29,821 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 58 transitions. [2018-12-18 22:32:29,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:32:29,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:32:29,822 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 37 states. [2018-12-18 22:32:29,822 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 37 states. [2018-12-18 22:32:29,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-18 22:32:29,825 INFO L93 Difference]: Finished difference Result 37 states and 58 transitions. [2018-12-18 22:32:29,825 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 58 transitions. [2018-12-18 22:32:29,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-18 22:32:29,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-12-18 22:32:29,826 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-12-18 22:32:29,826 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-12-18 22:32:29,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-18 22:32:29,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 38 transitions. [2018-12-18 22:32:29,828 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 38 transitions. Word has length 3 [2018-12-18 22:32:29,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-18 22:32:29,828 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 38 transitions. [2018-12-18 22:32:29,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-18 22:32:29,829 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 38 transitions. [2018-12-18 22:32:29,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-18 22:32:29,829 INFO L394 BasicCegarLoop]: Found error trace [2018-12-18 22:32:29,829 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-18 22:32:29,830 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT]=== [2018-12-18 22:32:29,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-18 22:32:29,830 INFO L82 PathProgramCache]: Analyzing trace with hash 30000, now seen corresponding path program 1 times [2018-12-18 22:32:29,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-18 22:32:29,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:32:29,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-18 22:32:29,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-18 22:32:29,831 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-18 22:32:29,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-18 22:32:29,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-18 22:32:29,870 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-18 22:32:29,886 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-12-18 22:32:29,886 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2018-12-18 22:32:29,886 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2018-12-18 22:32:29,887 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2018-12-18 22:32:29,887 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2018-12-18 22:32:29,887 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2018-12-18 22:32:29,887 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2018-12-18 22:32:29,887 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2018-12-18 22:32:29,887 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2018-12-18 22:32:29,887 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2018-12-18 22:32:29,888 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2018-12-18 22:32:29,888 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2018-12-18 22:32:29,888 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2018-12-18 22:32:29,888 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2018-12-18 22:32:29,888 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2018-12-18 22:32:29,888 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2018-12-18 22:32:29,888 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-12-18 22:32:29,888 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:32:29,890 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 10:32:29 BoogieIcfgContainer [2018-12-18 22:32:29,892 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-18 22:32:29,893 INFO L168 Benchmark]: Toolchain (without parser) took 13375.13 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 821.0 MB). Free memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: -828.0 MB). There was no memory consumed. Max. memory is 7.1 GB. [2018-12-18 22:32:29,894 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 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:32:29,895 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.05 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:32:29,895 INFO L168 Benchmark]: Boogie Preprocessor took 27.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:32:29,896 INFO L168 Benchmark]: RCFGBuilder took 734.36 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:32:29,898 INFO L168 Benchmark]: TraceAbstraction took 12536.14 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 821.0 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -859.7 MB). There was no memory consumed. Max. memory is 7.1 GB. [2018-12-18 22:32:29,905 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.23 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 72.05 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 27.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. * RCFGBuilder took 734.36 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 12536.14 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 821.0 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -859.7 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 43]: assertion can be violated assertion can be violated We found a FailurePath: [L51-L52] modifies #valid; [L51-L53] ensures old(#valid)[ptr] == 0; [L51-L54] ensures #valid == old(#valid)[ptr := 1]; [L51-L52] modifies #valid; [L51-L53] ensures old(#valid)[ptr] == 0; [L51-L54] ensures #valid == old(#valid)[ptr := 1]; [L51-L52] modifies #valid; [L51-L53] ensures old(#valid)[ptr] == 0; [L51-L54] ensures #valid == old(#valid)[ptr := 1]; [L51-L52] modifies #valid; [L51-L53] ensures old(#valid)[ptr] == 0; [L51-L54] ensures #valid == old(#valid)[ptr := 1]; [L51-L52] modifies #valid; [L51-L53] ensures old(#valid)[ptr] == 0; [L51-L54] ensures #valid == old(#valid)[ptr := 1]; [L23] #memory_int[p1] := 0; [L24] #memory_int[p2] := 0; [L25] #memory_int[p3] := 0; [L26] #memory_int[p4] := 0; [L27] #memory_int[p5] := 0; [L31] #memory_int[p1] := #memory_int[p1] + 1; [L43] assert #memory_int[p1] <= 0; - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 5 error locations. UNSAFE Result, 12.4s OverallTime, 4 OverallIterations, 1 TraceHistogramMax, 1.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8 SDtfs, 64 SDslu, 1 SDs, 0 SdLazy, 129 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 4.4s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 29 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 17 NumberOfCodeBlocks, 17 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 13 ConstructedInterpolants, 4 QuantifiedInterpolants, 655 SizeOfPredicates, 10 NumberOfNonLiveVariables, 38 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 7 InterpolantComputations, 2 PerfectInterpolantSequences, 1/6 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...