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-3-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1de736e-m [2019-02-14 16:51:26,307 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-14 16:51:26,309 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-14 16:51:26,322 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-14 16:51:26,322 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-14 16:51:26,323 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-14 16:51:26,324 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-14 16:51:26,326 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-14 16:51:26,328 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-14 16:51:26,329 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-14 16:51:26,329 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-14 16:51:26,330 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-14 16:51:26,331 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-14 16:51:26,332 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-14 16:51:26,333 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-14 16:51:26,334 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-14 16:51:26,334 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-14 16:51:26,336 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-14 16:51:26,339 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-14 16:51:26,344 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-14 16:51:26,345 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-14 16:51:26,349 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-14 16:51:26,352 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-14 16:51:26,352 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-14 16:51:26,352 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-14 16:51:26,353 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-14 16:51:26,358 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-14 16:51:26,360 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-14 16:51:26,360 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-14 16:51:26,361 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-14 16:51:26,365 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-14 16:51:26,365 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-14 16:51:26,366 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-14 16:51:26,366 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-14 16:51:26,369 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-14 16:51:26,371 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-14 16:51:26,371 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 [2019-02-14 16:51:26,398 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-14 16:51:26,398 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-14 16:51:26,399 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-14 16:51:26,400 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-14 16:51:26,400 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-14 16:51:26,400 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-14 16:51:26,400 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-14 16:51:26,400 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-14 16:51:26,401 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-14 16:51:26,401 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-14 16:51:26,401 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-14 16:51:26,401 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-14 16:51:26,401 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-14 16:51:26,403 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-14 16:51:26,403 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-14 16:51:26,403 INFO L133 SettingsManager]: * Use SBE=true [2019-02-14 16:51:26,403 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-14 16:51:26,404 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-14 16:51:26,404 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-14 16:51:26,404 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-14 16:51:26,404 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-14 16:51:26,404 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-14 16:51:26,405 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-14 16:51:26,407 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-14 16:51:26,407 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-14 16:51:26,407 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-14 16:51:26,407 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-14 16:51:26,408 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-14 16:51:26,408 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-14 16:51:26,409 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-14 16:51:26,409 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-14 16:51:26,409 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-14 16:51:26,409 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-14 16:51:26,410 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-14 16:51:26,410 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-14 16:51:26,410 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-14 16:51:26,410 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-14 16:51:26,410 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-14 16:51:26,411 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-14 16:51:26,449 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-14 16:51:26,467 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-14 16:51:26,472 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-14 16:51:26,473 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-14 16:51:26,474 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-14 16:51:26,474 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-unlimited.bpl [2019-02-14 16:51:26,475 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-unlimited.bpl' [2019-02-14 16:51:26,514 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-14 16:51:26,516 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-14 16:51:26,517 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-14 16:51:26,517 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-14 16:51:26,517 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-14 16:51:26,534 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:51:26" (1/1) ... [2019-02-14 16:51:26,545 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:51:26" (1/1) ... [2019-02-14 16:51:26,570 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-14 16:51:26,571 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-14 16:51:26,571 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-14 16:51:26,572 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-14 16:51:26,583 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:51:26" (1/1) ... [2019-02-14 16:51:26,583 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:51:26" (1/1) ... [2019-02-14 16:51:26,584 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:51:26" (1/1) ... [2019-02-14 16:51:26,585 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:51:26" (1/1) ... [2019-02-14 16:51:26,587 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:51:26" (1/1) ... [2019-02-14 16:51:26,591 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:51:26" (1/1) ... [2019-02-14 16:51:26,592 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:51:26" (1/1) ... [2019-02-14 16:51:26,593 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-14 16:51:26,594 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-14 16:51:26,594 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-14 16:51:26,594 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-14 16:51:26,595 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:51:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-14 16:51:26,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-14 16:51:26,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-14 16:51:27,110 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-14 16:51:27,110 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-02-14 16:51:27,111 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 04:51:27 BoogieIcfgContainer [2019-02-14 16:51:27,112 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-14 16:51:27,113 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-14 16:51:27,113 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-14 16:51:27,116 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-14 16:51:27,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:51:26" (1/2) ... [2019-02-14 16:51:27,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dd51746 and model type speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 04:51:27, skipping insertion in model container [2019-02-14 16:51:27,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 04:51:27" (2/2) ... [2019-02-14 16:51:27,119 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-3-unlimited.bpl [2019-02-14 16:51:27,128 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-14 16:51:27,136 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-02-14 16:51:27,153 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-02-14 16:51:27,185 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-14 16:51:27,186 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-14 16:51:27,186 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-14 16:51:27,186 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-14 16:51:27,186 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-14 16:51:27,186 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-14 16:51:27,186 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-14 16:51:27,187 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-14 16:51:27,202 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2019-02-14 16:51:27,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-14 16:51:27,208 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:51:27,209 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-14 16:51:27,212 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-14 16:51:27,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:51:27,219 INFO L82 PathProgramCache]: Analyzing trace with hash 976, now seen corresponding path program 1 times [2019-02-14 16:51:27,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:51:27,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:51:27,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:51:27,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:51:27,276 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:51:27,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:51:27,440 INFO L273 TraceCheckUtils]: 0: Hoare triple {12#true} havoc main_p1, main_p2, main_p3;malloc_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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {14#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-02-14 16:51:27,445 INFO L273 TraceCheckUtils]: 1: Hoare triple {14#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {13#false} is VALID [2019-02-14 16:51:27,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:51:27,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-14 16:51:27,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-14 16:51:27,449 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-14 16:51:27,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-14 16:51:27,457 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:51:27,460 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-02-14 16:51:27,492 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:51:27,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-14 16:51:27,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-14 16:51:27,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-14 16:51:27,502 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2019-02-14 16:51:27,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:51:27,759 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-02-14 16:51:27,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-14 16:51:27,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-14 16:51:27,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:51:27,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-14 16:51:27,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2019-02-14 16:51:27,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-14 16:51:27,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2019-02-14 16:51:27,766 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 21 transitions. [2019-02-14 16:51:27,872 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:51:27,883 INFO L225 Difference]: With dead ends: 17 [2019-02-14 16:51:27,884 INFO L226 Difference]: Without dead ends: 12 [2019-02-14 16:51:27,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-14 16:51:27,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-02-14 16:51:27,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 8. [2019-02-14 16:51:27,974 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:51:27,976 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 8 states. [2019-02-14 16:51:27,977 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 8 states. [2019-02-14 16:51:27,977 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 8 states. [2019-02-14 16:51:27,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:51:27,980 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-02-14 16:51:27,981 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2019-02-14 16:51:27,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:51:27,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:51:27,982 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 12 states. [2019-02-14 16:51:27,982 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 12 states. [2019-02-14 16:51:27,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:51:27,984 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-02-14 16:51:27,984 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2019-02-14 16:51:27,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:51:27,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:51:27,985 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:51:27,986 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:51:27,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-14 16:51:27,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2019-02-14 16:51:27,990 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 13 transitions. Word has length 2 [2019-02-14 16:51:27,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:51:27,990 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 13 transitions. [2019-02-14 16:51:27,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-14 16:51:27,990 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 13 transitions. [2019-02-14 16:51:27,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-14 16:51:27,991 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:51:27,991 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-14 16:51:27,992 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-14 16:51:27,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:51:27,992 INFO L82 PathProgramCache]: Analyzing trace with hash 30304, now seen corresponding path program 1 times [2019-02-14 16:51:27,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:51:27,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:51:27,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:51:27,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:51:27,994 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:51:28,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:51:28,183 INFO L273 TraceCheckUtils]: 0: Hoare triple {70#true} havoc main_p1, main_p2, main_p3;malloc_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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {72#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2019-02-14 16:51:28,188 INFO L273 TraceCheckUtils]: 1: Hoare triple {72#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume #memory_int[main_p1] >= 0; {72#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2019-02-14 16:51:28,189 INFO L273 TraceCheckUtils]: 2: Hoare triple {72#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume !(#memory_int[main_p2] <= 0); {71#false} is VALID [2019-02-14 16:51:28,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:51:28,189 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-14 16:51:28,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-14 16:51:28,189 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-14 16:51:28,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-14 16:51:28,193 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:51:28,193 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-02-14 16:51:28,234 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:51:28,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-14 16:51:28,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-14 16:51:28,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-14 16:51:28,236 INFO L87 Difference]: Start difference. First operand 8 states and 13 transitions. Second operand 3 states. [2019-02-14 16:51:28,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:51:28,440 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-02-14 16:51:28,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-14 16:51:28,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-14 16:51:28,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:51:28,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-14 16:51:28,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-02-14 16:51:28,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-14 16:51:28,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-02-14 16:51:28,444 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 16 transitions. [2019-02-14 16:51:28,577 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:51:28,578 INFO L225 Difference]: With dead ends: 12 [2019-02-14 16:51:28,578 INFO L226 Difference]: Without dead ends: 11 [2019-02-14 16:51:28,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-14 16:51:28,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-14 16:51:28,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2019-02-14 16:51:28,589 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:51:28,589 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand 9 states. [2019-02-14 16:51:28,590 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 9 states. [2019-02-14 16:51:28,590 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 9 states. [2019-02-14 16:51:28,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:51:28,592 INFO L93 Difference]: Finished difference Result 11 states and 15 transitions. [2019-02-14 16:51:28,592 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2019-02-14 16:51:28,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:51:28,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:51:28,593 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 11 states. [2019-02-14 16:51:28,593 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 11 states. [2019-02-14 16:51:28,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:51:28,595 INFO L93 Difference]: Finished difference Result 11 states and 15 transitions. [2019-02-14 16:51:28,595 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2019-02-14 16:51:28,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:51:28,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:51:28,596 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:51:28,596 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:51:28,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-02-14 16:51:28,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2019-02-14 16:51:28,598 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 14 transitions. Word has length 3 [2019-02-14 16:51:28,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:51:28,598 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 14 transitions. [2019-02-14 16:51:28,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-14 16:51:28,599 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 14 transitions. [2019-02-14 16:51:28,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-14 16:51:28,599 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:51:28,599 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-14 16:51:28,600 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-14 16:51:28,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:51:28,600 INFO L82 PathProgramCache]: Analyzing trace with hash 29992, now seen corresponding path program 1 times [2019-02-14 16:51:28,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:51:28,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:51:28,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:51:28,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:51:28,602 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:51:28,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:51:28,781 INFO L273 TraceCheckUtils]: 0: Hoare triple {122#true} havoc main_p1, main_p2, main_p3;malloc_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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {124#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-02-14 16:51:28,782 INFO L273 TraceCheckUtils]: 1: Hoare triple {124#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {125#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2019-02-14 16:51:28,785 INFO L273 TraceCheckUtils]: 2: Hoare triple {125#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {123#false} is VALID [2019-02-14 16:51:28,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:51:28,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:51:28,786 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-14 16:51:28,787 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-14 16:51:28,789 INFO L207 CegarAbsIntRunner]: [0], [6], [15] [2019-02-14 16:51:28,838 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-14 16:51:28,838 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-14 16:51:35,139 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-14 16:51:35,140 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-14 16:51:35,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:51:35,146 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-14 16:51:35,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:51:35,147 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-14 16:51:35,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:51:35,162 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-14 16:51:35,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:51:35,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:51:35,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-14 16:51:35,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:51:35,299 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 17 treesize of output 29 [2019-02-14 16:51:35,352 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:51:35,354 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:51:35,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-14 16:51:35,365 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:51:35,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:51:35,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 12 treesize of output 15 [2019-02-14 16:51:35,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 15 treesize of output 21 [2019-02-14 16:51:35,598 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-02-14 16:51:35,617 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:51:35,631 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:51:35,640 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:51:35,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-14 16:51:35,661 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:32, output treesize:28 [2019-02-14 16:51:35,666 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:51:35,666 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_17|, ULTIMATE.start_main_p2, ULTIMATE.start_main_p3, |v_#valid_5|]. (let ((.cse0 (store |v_#valid_5| ULTIMATE.start_main_p1 1))) (and (= 0 (select (store .cse0 ULTIMATE.start_main_p2 1) ULTIMATE.start_main_p3)) (= (select .cse0 ULTIMATE.start_main_p2) 0) (= (store (store (store |v_#memory_int_17| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0) ULTIMATE.start_main_p3 0) |#memory_int|))) [2019-02-14 16:51:35,666 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3, ULTIMATE.start_main_p2]. (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)) (= 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)) [2019-02-14 16:51:35,853 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:51:35,854 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-14 16:51:35,858 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:51:35,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-14 16:51:35,877 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-02-14 16:51:35,881 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:51:35,881 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_18|, ULTIMATE.start_main_p3, ULTIMATE.start_main_p2]. (let ((.cse0 (select |v_#memory_int_18| ULTIMATE.start_main_p1))) (and (= |#memory_int| (store |v_#memory_int_18| ULTIMATE.start_main_p1 (+ .cse0 1))) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= (select |v_#memory_int_18| ULTIMATE.start_main_p3) 0) (= .cse0 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |v_#memory_int_18| ULTIMATE.start_main_p2) 0))) [2019-02-14 16:51:35,881 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3, ULTIMATE.start_main_p2]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)) [2019-02-14 16:51:35,916 INFO L273 TraceCheckUtils]: 0: Hoare triple {122#true} havoc main_p1, main_p2, main_p3;malloc_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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {129#(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))} is VALID [2019-02-14 16:51:35,918 INFO L273 TraceCheckUtils]: 1: Hoare triple {129#(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))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {133#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (exists ((ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))))} is VALID [2019-02-14 16:51:35,919 INFO L273 TraceCheckUtils]: 2: Hoare triple {133#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (exists ((ULTIMATE.start_main_p2 Int) (ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))))} assume !(#memory_int[main_p1] >= 0); {123#false} is VALID [2019-02-14 16:51:35,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:51:35,920 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-14 16:51:35,936 INFO L273 TraceCheckUtils]: 2: Hoare triple {125#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {123#false} is VALID [2019-02-14 16:51:35,938 INFO L273 TraceCheckUtils]: 1: Hoare triple {140#(<= 0 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {125#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2019-02-14 16:51:35,939 INFO L273 TraceCheckUtils]: 0: Hoare triple {122#true} havoc main_p1, main_p2, main_p3;malloc_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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {140#(<= 0 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1))} is VALID [2019-02-14 16:51:35,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:51:35,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-14 16:51:35,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-14 16:51:35,962 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-14 16:51:35,962 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-14 16:51:35,963 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:51:35,963 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-02-14 16:51:35,968 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:51:35,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-14 16:51:35,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-14 16:51:35,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-14 16:51:35,969 INFO L87 Difference]: Start difference. First operand 9 states and 14 transitions. Second operand 4 states. [2019-02-14 16:51:36,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:51:36,063 INFO L93 Difference]: Finished difference Result 13 states and 24 transitions. [2019-02-14 16:51:36,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-14 16:51:36,063 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-14 16:51:36,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:51:36,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-14 16:51:36,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2019-02-14 16:51:36,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-14 16:51:36,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2019-02-14 16:51:36,065 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 19 transitions. [2019-02-14 16:51:36,101 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:51:36,102 INFO L225 Difference]: With dead ends: 13 [2019-02-14 16:51:36,102 INFO L226 Difference]: Without dead ends: 12 [2019-02-14 16:51:36,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-14 16:51:36,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-02-14 16:51:36,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-02-14 16:51:36,112 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:51:36,112 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 11 states. [2019-02-14 16:51:36,112 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 11 states. [2019-02-14 16:51:36,112 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 11 states. [2019-02-14 16:51:36,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:51:36,114 INFO L93 Difference]: Finished difference Result 12 states and 23 transitions. [2019-02-14 16:51:36,114 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 23 transitions. [2019-02-14 16:51:36,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:51:36,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:51:36,115 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 12 states. [2019-02-14 16:51:36,115 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 12 states. [2019-02-14 16:51:36,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:51:36,117 INFO L93 Difference]: Finished difference Result 12 states and 23 transitions. [2019-02-14 16:51:36,117 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 23 transitions. [2019-02-14 16:51:36,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:51:36,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:51:36,117 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:51:36,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:51:36,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-02-14 16:51:36,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 23 transitions. [2019-02-14 16:51:36,119 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 23 transitions. Word has length 3 [2019-02-14 16:51:36,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:51:36,120 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 23 transitions. [2019-02-14 16:51:36,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-14 16:51:36,120 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 23 transitions. [2019-02-14 16:51:36,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-14 16:51:36,120 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:51:36,121 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-14 16:51:36,121 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-14 16:51:36,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:51:36,121 INFO L82 PathProgramCache]: Analyzing trace with hash 30116, now seen corresponding path program 1 times [2019-02-14 16:51:36,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:51:36,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:51:36,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:51:36,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:51:36,123 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:51:36,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:51:36,268 INFO L273 TraceCheckUtils]: 0: Hoare triple {199#true} havoc main_p1, main_p2, main_p3;malloc_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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {201#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1)))} is VALID [2019-02-14 16:51:36,270 INFO L273 TraceCheckUtils]: 1: Hoare triple {201#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1)))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {202#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} is VALID [2019-02-14 16:51:36,271 INFO L273 TraceCheckUtils]: 2: Hoare triple {202#(= (select |#memory_int| ULTIMATE.start_main_p1) 0)} assume !(#memory_int[main_p1] >= 0); {200#false} is VALID [2019-02-14 16:51:36,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:51:36,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:51:36,272 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-14 16:51:36,272 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-14 16:51:36,272 INFO L207 CegarAbsIntRunner]: [0], [10], [15] [2019-02-14 16:51:36,277 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-14 16:51:36,277 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-14 16:51:41,547 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-14 16:51:41,547 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-14 16:51:41,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:51:41,548 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-14 16:51:41,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:51:41,548 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-14 16:51:41,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:51:41,558 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-14 16:51:41,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:51:41,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:51:41,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-14 16:51:41,609 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:51:41,610 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 17 treesize of output 29 [2019-02-14 16:51:41,654 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:51:41,656 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:51:41,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-14 16:51:41,658 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:51:41,666 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:51:41,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 12 treesize of output 15 [2019-02-14 16:51:41,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 15 treesize of output 21 [2019-02-14 16:51:41,705 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-02-14 16:51:41,708 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:51:41,722 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:51:41,733 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:51:41,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-14 16:51:41,751 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-02-14 16:51:41,755 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:51:41,755 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_20|, ULTIMATE.start_main_p3, |v_#valid_6|]. (let ((.cse0 (store |v_#valid_6| ULTIMATE.start_main_p1 1))) (and (= (store (store (store |v_#memory_int_20| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0) ULTIMATE.start_main_p3 0) |#memory_int|) (= (select (store .cse0 ULTIMATE.start_main_p2 1) ULTIMATE.start_main_p3) 0) (= 0 (select .cse0 ULTIMATE.start_main_p2)))) [2019-02-14 16:51:41,755 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3]. (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)) (= 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)) [2019-02-14 16:51:41,816 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:51:41,817 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-02-14 16:51:41,820 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:51:41,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-14 16:51:41,837 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-02-14 16:51:42,317 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:51:42,317 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_21|, ULTIMATE.start_main_p2, ULTIMATE.start_main_p3]. (let ((.cse0 (select |v_#memory_int_21| ULTIMATE.start_main_p2))) (and (= (select |v_#memory_int_21| ULTIMATE.start_main_p1) 0) (= (store |v_#memory_int_21| ULTIMATE.start_main_p2 (+ .cse0 (- 1))) |#memory_int|) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= .cse0 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |v_#memory_int_21| ULTIMATE.start_main_p3) 0))) [2019-02-14 16:51:42,317 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p2, ULTIMATE.start_main_p3]. (and (= (- 1) (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1))) [2019-02-14 16:51:42,441 INFO L273 TraceCheckUtils]: 0: Hoare triple {199#true} havoc main_p1, main_p2, main_p3;malloc_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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {206#(and (exists ((ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p3 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) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))} is VALID [2019-02-14 16:51:42,444 INFO L273 TraceCheckUtils]: 1: Hoare triple {206#(and (exists ((ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p3 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) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {210#(and (exists ((ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))) (exists ((ULTIMATE.start_main_p2 Int)) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0))} is VALID [2019-02-14 16:51:42,447 INFO L273 TraceCheckUtils]: 2: Hoare triple {210#(and (exists ((ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))) (exists ((ULTIMATE.start_main_p2 Int)) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0))} assume !(#memory_int[main_p1] >= 0); {200#false} is VALID [2019-02-14 16:51:42,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:51:42,447 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-14 16:51:42,475 INFO L273 TraceCheckUtils]: 2: Hoare triple {214#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {200#false} is VALID [2019-02-14 16:51:42,482 INFO L273 TraceCheckUtils]: 1: Hoare triple {218#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {214#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2019-02-14 16:51:42,486 INFO L273 TraceCheckUtils]: 0: Hoare triple {199#true} havoc main_p1, main_p2, main_p3;malloc_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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {218#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))} is VALID [2019-02-14 16:51:42,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:51:42,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-14 16:51:42,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-14 16:51:42,504 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-14 16:51:42,505 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-14 16:51:42,505 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:51:42,505 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2019-02-14 16:51:42,519 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:51:42,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-14 16:51:42,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-14 16:51:42,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-14 16:51:42,520 INFO L87 Difference]: Start difference. First operand 11 states and 23 transitions. Second operand 6 states. [2019-02-14 16:51:43,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:51:43,050 INFO L93 Difference]: Finished difference Result 24 states and 40 transitions. [2019-02-14 16:51:43,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-14 16:51:43,050 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-14 16:51:43,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:51:43,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-14 16:51:43,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2019-02-14 16:51:43,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-14 16:51:43,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2019-02-14 16:51:43,053 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2019-02-14 16:51:43,108 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:51:43,110 INFO L225 Difference]: With dead ends: 24 [2019-02-14 16:51:43,111 INFO L226 Difference]: Without dead ends: 23 [2019-02-14 16:51:43,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-14 16:51:43,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-02-14 16:51:43,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 13. [2019-02-14 16:51:43,131 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:51:43,132 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 13 states. [2019-02-14 16:51:43,132 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 13 states. [2019-02-14 16:51:43,132 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 13 states. [2019-02-14 16:51:43,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:51:43,135 INFO L93 Difference]: Finished difference Result 23 states and 38 transitions. [2019-02-14 16:51:43,135 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. [2019-02-14 16:51:43,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:51:43,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:51:43,137 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 23 states. [2019-02-14 16:51:43,137 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 23 states. [2019-02-14 16:51:43,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:51:43,140 INFO L93 Difference]: Finished difference Result 23 states and 38 transitions. [2019-02-14 16:51:43,140 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. [2019-02-14 16:51:43,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:51:43,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:51:43,141 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:51:43,141 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:51:43,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-14 16:51:43,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 31 transitions. [2019-02-14 16:51:43,143 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 31 transitions. Word has length 3 [2019-02-14 16:51:43,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:51:43,143 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 31 transitions. [2019-02-14 16:51:43,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-14 16:51:43,143 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 31 transitions. [2019-02-14 16:51:43,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-14 16:51:43,144 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:51:43,144 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-14 16:51:43,144 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-14 16:51:43,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:51:43,145 INFO L82 PathProgramCache]: Analyzing trace with hash 939474, now seen corresponding path program 1 times [2019-02-14 16:51:43,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:51:43,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:51:43,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:51:43,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:51:43,149 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:51:43,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:51:43,180 INFO L273 TraceCheckUtils]: 0: Hoare triple {318#true} havoc main_p1, main_p2, main_p3;malloc_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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {320#(= (select |#memory_int| ULTIMATE.start_main_p3) 0)} is VALID [2019-02-14 16:51:43,182 INFO L273 TraceCheckUtils]: 1: Hoare triple {320#(= (select |#memory_int| ULTIMATE.start_main_p3) 0)} assume #memory_int[main_p1] >= 0; {320#(= (select |#memory_int| ULTIMATE.start_main_p3) 0)} is VALID [2019-02-14 16:51:43,183 INFO L273 TraceCheckUtils]: 2: Hoare triple {320#(= (select |#memory_int| ULTIMATE.start_main_p3) 0)} assume #memory_int[main_p2] <= 0; {320#(= (select |#memory_int| ULTIMATE.start_main_p3) 0)} is VALID [2019-02-14 16:51:43,185 INFO L273 TraceCheckUtils]: 3: Hoare triple {320#(= (select |#memory_int| ULTIMATE.start_main_p3) 0)} assume !(#memory_int[main_p3] >= 0); {319#false} is VALID [2019-02-14 16:51:43,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:51:43,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-14 16:51:43,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-14 16:51:43,186 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-14 16:51:43,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-14 16:51:43,187 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:51:43,187 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-02-14 16:51:43,193 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:51:43,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-14 16:51:43,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-14 16:51:43,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-14 16:51:43,195 INFO L87 Difference]: Start difference. First operand 13 states and 31 transitions. Second operand 3 states. [2019-02-14 16:51:43,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:51:43,272 INFO L93 Difference]: Finished difference Result 15 states and 32 transitions. [2019-02-14 16:51:43,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-14 16:51:43,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-02-14 16:51:43,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:51:43,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-14 16:51:43,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2019-02-14 16:51:43,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-14 16:51:43,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2019-02-14 16:51:43,275 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 15 transitions. [2019-02-14 16:51:43,323 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:51:43,324 INFO L225 Difference]: With dead ends: 15 [2019-02-14 16:51:43,324 INFO L226 Difference]: Without dead ends: 12 [2019-02-14 16:51:43,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-14 16:51:43,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-02-14 16:51:43,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-02-14 16:51:43,358 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:51:43,359 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2019-02-14 16:51:43,359 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2019-02-14 16:51:43,359 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2019-02-14 16:51:43,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:51:43,360 INFO L93 Difference]: Finished difference Result 12 states and 29 transitions. [2019-02-14 16:51:43,361 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 29 transitions. [2019-02-14 16:51:43,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:51:43,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:51:43,361 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2019-02-14 16:51:43,361 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2019-02-14 16:51:43,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:51:43,363 INFO L93 Difference]: Finished difference Result 12 states and 29 transitions. [2019-02-14 16:51:43,363 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 29 transitions. [2019-02-14 16:51:43,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:51:43,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:51:43,364 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:51:43,364 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:51:43,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-14 16:51:43,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 29 transitions. [2019-02-14 16:51:43,365 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 29 transitions. Word has length 4 [2019-02-14 16:51:43,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:51:43,365 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 29 transitions. [2019-02-14 16:51:43,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-14 16:51:43,366 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 29 transitions. [2019-02-14 16:51:43,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-14 16:51:43,367 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:51:43,367 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-14 16:51:43,367 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-14 16:51:43,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:51:43,368 INFO L82 PathProgramCache]: Analyzing trace with hash 929800, now seen corresponding path program 1 times [2019-02-14 16:51:43,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:51:43,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:51:43,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:51:43,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:51:43,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:51:43,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:51:43,442 INFO L273 TraceCheckUtils]: 0: Hoare triple {386#true} havoc main_p1, main_p2, main_p3;malloc_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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {388#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2)))} is VALID [2019-02-14 16:51:43,444 INFO L273 TraceCheckUtils]: 1: Hoare triple {388#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2)))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {389#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2019-02-14 16:51:43,446 INFO L273 TraceCheckUtils]: 2: Hoare triple {389#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume #memory_int[main_p1] >= 0; {389#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2019-02-14 16:51:43,447 INFO L273 TraceCheckUtils]: 3: Hoare triple {389#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume !(#memory_int[main_p2] <= 0); {387#false} is VALID [2019-02-14 16:51:43,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:51:43,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:51:43,448 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-14 16:51:43,448 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-14 16:51:43,448 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [17] [2019-02-14 16:51:43,449 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-14 16:51:43,449 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-14 16:51:47,463 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-14 16:51:47,463 INFO L272 AbstractInterpreter]: Visited 4 different actions 6 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-14 16:51:47,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:51:47,464 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-14 16:51:47,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:51:47,464 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-14 16:51:47,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:51:47,473 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-14 16:51:47,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:51:47,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:51:47,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-14 16:51:47,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 12 treesize of output 15 [2019-02-14 16:51:47,545 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 15 treesize of output 21 [2019-02-14 16:51:47,556 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:51:47,557 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:51:47,558 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-02-14 16:51:47,563 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:51:47,577 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:51:47,587 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:51:47,610 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:51:47,611 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 17 treesize of output 29 [2019-02-14 16:51:47,662 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:51:47,663 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:51:47,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-14 16:51:47,669 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:51:47,676 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:51:47,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-14 16:51:47,719 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-02-14 16:51:47,722 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:51:47,723 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_23|, ULTIMATE.start_main_p3, |v_#valid_7|]. (let ((.cse0 (store |v_#valid_7| ULTIMATE.start_main_p1 1))) (and (= 0 (select .cse0 ULTIMATE.start_main_p2)) (= (store (store (store |v_#memory_int_23| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0) ULTIMATE.start_main_p3 0) |#memory_int|) (= (select (store .cse0 ULTIMATE.start_main_p2 1) ULTIMATE.start_main_p3) 0))) [2019-02-14 16:51:47,723 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3]. (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)) (= 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)) [2019-02-14 16:51:47,780 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:51:47,781 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-14 16:51:47,785 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:51:47,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-14 16:51:47,805 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-02-14 16:51:49,950 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:51:49,951 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_24|, ULTIMATE.start_main_p1, ULTIMATE.start_main_p3]. (let ((.cse0 (select |v_#memory_int_24| ULTIMATE.start_main_p1))) (and (= 0 (select |v_#memory_int_24| ULTIMATE.start_main_p2)) (= 0 (select |v_#memory_int_24| ULTIMATE.start_main_p3)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 .cse0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= (store |v_#memory_int_24| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)))) [2019-02-14 16:51:49,951 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p1, ULTIMATE.start_main_p3]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)) [2019-02-14 16:51:50,003 INFO L273 TraceCheckUtils]: 0: Hoare triple {386#true} havoc main_p1, main_p2, main_p3;malloc_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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {393#(and (exists ((ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p3 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) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))} is VALID [2019-02-14 16:51:50,006 INFO L273 TraceCheckUtils]: 1: Hoare triple {393#(and (exists ((ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p3 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) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {397#(and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (exists ((ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))))} is VALID [2019-02-14 16:51:50,007 INFO L273 TraceCheckUtils]: 2: Hoare triple {397#(and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (exists ((ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))))} assume #memory_int[main_p1] >= 0; {397#(and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (exists ((ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))))} is VALID [2019-02-14 16:51:50,009 INFO L273 TraceCheckUtils]: 3: Hoare triple {397#(and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (exists ((ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))))} assume !(#memory_int[main_p2] <= 0); {387#false} is VALID [2019-02-14 16:51:50,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:51:50,010 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-14 16:51:50,041 INFO L273 TraceCheckUtils]: 3: Hoare triple {404#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume !(#memory_int[main_p2] <= 0); {387#false} is VALID [2019-02-14 16:51:50,042 INFO L273 TraceCheckUtils]: 2: Hoare triple {404#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume #memory_int[main_p1] >= 0; {404#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2019-02-14 16:51:50,044 INFO L273 TraceCheckUtils]: 1: Hoare triple {411#(<= (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {404#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2019-02-14 16:51:50,046 INFO L273 TraceCheckUtils]: 0: Hoare triple {386#true} havoc main_p1, main_p2, main_p3;malloc_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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {411#(<= (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) 0)} is VALID [2019-02-14 16:51:50,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:51:50,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-14 16:51:50,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-14 16:51:50,066 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-14 16:51:50,067 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-14 16:51:50,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:51:50,067 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2019-02-14 16:51:50,083 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:51:50,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-14 16:51:50,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-14 16:51:50,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-14 16:51:50,084 INFO L87 Difference]: Start difference. First operand 12 states and 29 transitions. Second operand 6 states. [2019-02-14 16:51:50,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:51:50,370 INFO L93 Difference]: Finished difference Result 21 states and 43 transitions. [2019-02-14 16:51:50,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-14 16:51:50,370 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-14 16:51:50,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:51:50,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-14 16:51:50,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2019-02-14 16:51:50,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-14 16:51:50,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2019-02-14 16:51:50,373 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 26 transitions. [2019-02-14 16:51:50,435 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:51:50,437 INFO L225 Difference]: With dead ends: 21 [2019-02-14 16:51:50,437 INFO L226 Difference]: Without dead ends: 20 [2019-02-14 16:51:50,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-14 16:51:50,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-02-14 16:51:50,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2019-02-14 16:51:50,463 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:51:50,463 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 14 states. [2019-02-14 16:51:50,463 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 14 states. [2019-02-14 16:51:50,463 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 14 states. [2019-02-14 16:51:50,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:51:50,466 INFO L93 Difference]: Finished difference Result 20 states and 41 transitions. [2019-02-14 16:51:50,466 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 41 transitions. [2019-02-14 16:51:50,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:51:50,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:51:50,467 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 20 states. [2019-02-14 16:51:50,467 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 20 states. [2019-02-14 16:51:50,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:51:50,469 INFO L93 Difference]: Finished difference Result 20 states and 41 transitions. [2019-02-14 16:51:50,469 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 41 transitions. [2019-02-14 16:51:50,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:51:50,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:51:50,469 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:51:50,470 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:51:50,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-02-14 16:51:50,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 34 transitions. [2019-02-14 16:51:50,471 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 34 transitions. Word has length 4 [2019-02-14 16:51:50,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:51:50,471 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 34 transitions. [2019-02-14 16:51:50,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-14 16:51:50,471 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 34 transitions. [2019-02-14 16:51:50,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-14 16:51:50,472 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:51:50,472 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-14 16:51:50,472 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-14 16:51:50,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:51:50,473 INFO L82 PathProgramCache]: Analyzing trace with hash 929612, now seen corresponding path program 1 times [2019-02-14 16:51:50,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:51:50,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:51:50,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:51:50,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:51:50,474 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:51:50,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:51:50,584 INFO L273 TraceCheckUtils]: 0: Hoare triple {506#true} havoc main_p1, main_p2, main_p3;malloc_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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {508#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0))} is VALID [2019-02-14 16:51:50,586 INFO L273 TraceCheckUtils]: 1: Hoare triple {508#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {509#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (<= 1 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1)))} is VALID [2019-02-14 16:51:50,587 INFO L273 TraceCheckUtils]: 2: Hoare triple {509#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (<= 1 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1)))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {510#(<= 1 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2019-02-14 16:51:50,588 INFO L273 TraceCheckUtils]: 3: Hoare triple {510#(<= 1 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {507#false} is VALID [2019-02-14 16:51:50,589 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:51:50,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:51:50,589 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-14 16:51:50,589 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-14 16:51:50,589 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [15] [2019-02-14 16:51:50,591 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-14 16:51:50,592 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-14 16:51:56,179 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-14 16:51:56,179 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-14 16:51:56,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:51:56,180 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-14 16:51:56,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:51:56,180 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-14 16:51:56,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:51:56,189 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-14 16:51:56,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:51:56,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:51:56,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-14 16:51:56,355 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:51:56,356 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 17 treesize of output 29 [2019-02-14 16:51:56,390 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:51:56,391 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:51:56,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-14 16:51:56,394 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:51:56,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:51:56,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 12 treesize of output 15 [2019-02-14 16:51:56,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 15 treesize of output 21 [2019-02-14 16:51:56,425 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-02-14 16:51:56,429 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:51:56,441 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:51:56,450 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:51:56,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-14 16:51:56,465 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-02-14 16:51:56,468 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:51:56,469 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_26|, ULTIMATE.start_main_p3, |v_#valid_8|]. (let ((.cse0 (store |v_#valid_8| ULTIMATE.start_main_p1 1))) (and (= (store (store (store |v_#memory_int_26| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0) ULTIMATE.start_main_p3 0) |#memory_int|) (= 0 (select .cse0 ULTIMATE.start_main_p2)) (= (select (store .cse0 ULTIMATE.start_main_p2 1) ULTIMATE.start_main_p3) 0))) [2019-02-14 16:51:56,469 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3]. (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)) (= 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)) [2019-02-14 16:51:56,510 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:51:56,512 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-14 16:51:56,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:51:56,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-14 16:51:56,532 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-14 16:51:56,535 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:51:56,535 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_27|, ULTIMATE.start_main_p3]. (let ((.cse0 (select |v_#memory_int_27| ULTIMATE.start_main_p1))) (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select |v_#memory_int_27| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select |v_#memory_int_27| ULTIMATE.start_main_p3)) (= |#memory_int| (store |v_#memory_int_27| ULTIMATE.start_main_p1 (+ .cse0 1))) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= .cse0 0))) [2019-02-14 16:51:56,535 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)) [2019-02-14 16:51:56,568 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:51:56,569 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:51:56,570 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:51:56,571 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:51:56,573 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:51:56,574 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-14 16:51:56,580 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:51:56,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-14 16:51:56,594 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2019-02-14 16:51:56,651 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:51:56,651 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_28|, ULTIMATE.start_main_p2, ULTIMATE.start_main_p3]. (let ((.cse0 (select |v_#memory_int_28| ULTIMATE.start_main_p2))) (and (= |#memory_int| (store |v_#memory_int_28| ULTIMATE.start_main_p2 (+ .cse0 (- 1)))) (= 0 .cse0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select |v_#memory_int_28| ULTIMATE.start_main_p3)) (= (select |v_#memory_int_28| ULTIMATE.start_main_p1) 1))) [2019-02-14 16:51:56,651 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p2, ULTIMATE.start_main_p3]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= (- 1) (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)) [2019-02-14 16:51:56,671 INFO L273 TraceCheckUtils]: 0: Hoare triple {506#true} havoc main_p1, main_p2, main_p3;malloc_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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {514#(and (exists ((ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p3 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) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))} is VALID [2019-02-14 16:51:56,673 INFO L273 TraceCheckUtils]: 1: Hoare triple {514#(and (exists ((ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p3 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) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {518#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (exists ((ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))))} is VALID [2019-02-14 16:51:56,674 INFO L273 TraceCheckUtils]: 2: Hoare triple {518#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (exists ((ULTIMATE.start_main_p3 Int)) (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {522#(and (exists ((ULTIMATE.start_main_p3 Int)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (exists ((ULTIMATE.start_main_p2 Int)) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1))))} is VALID [2019-02-14 16:51:56,675 INFO L273 TraceCheckUtils]: 3: Hoare triple {522#(and (exists ((ULTIMATE.start_main_p3 Int)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (exists ((ULTIMATE.start_main_p2 Int)) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1))))} assume !(#memory_int[main_p1] >= 0); {507#false} is VALID [2019-02-14 16:51:56,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:51:56,676 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-14 16:51:56,712 INFO L273 TraceCheckUtils]: 3: Hoare triple {526#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {507#false} is VALID [2019-02-14 16:51:56,713 INFO L273 TraceCheckUtils]: 2: Hoare triple {530#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {526#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2019-02-14 16:51:56,714 INFO L273 TraceCheckUtils]: 1: Hoare triple {534#(<= 0 (select (store (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2 (+ (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {530#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))} is VALID [2019-02-14 16:51:56,715 INFO L273 TraceCheckUtils]: 0: Hoare triple {506#true} havoc main_p1, main_p2, main_p3;malloc_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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {534#(<= 0 (select (store (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2 (+ (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))} is VALID [2019-02-14 16:51:56,716 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:51:56,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-14 16:51:56,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-14 16:51:56,736 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-14 16:51:56,736 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-14 16:51:56,736 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:51:56,736 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2019-02-14 16:51:56,750 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:51:56,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-14 16:51:56,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-14 16:51:56,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-14 16:51:56,751 INFO L87 Difference]: Start difference. First operand 14 states and 34 transitions. Second operand 8 states. [2019-02-14 16:51:57,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:51:57,272 INFO L93 Difference]: Finished difference Result 35 states and 68 transitions. [2019-02-14 16:51:57,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-14 16:51:57,272 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-14 16:51:57,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:51:57,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-14 16:51:57,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2019-02-14 16:51:57,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-14 16:51:57,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2019-02-14 16:51:57,275 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 41 transitions. [2019-02-14 16:51:57,362 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:51:57,363 INFO L225 Difference]: With dead ends: 35 [2019-02-14 16:51:57,363 INFO L226 Difference]: Without dead ends: 34 [2019-02-14 16:51:57,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-14 16:51:57,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-02-14 16:51:57,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 15. [2019-02-14 16:51:57,394 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:51:57,394 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 15 states. [2019-02-14 16:51:57,394 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 15 states. [2019-02-14 16:51:57,394 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 15 states. [2019-02-14 16:51:57,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:51:57,397 INFO L93 Difference]: Finished difference Result 34 states and 65 transitions. [2019-02-14 16:51:57,397 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 65 transitions. [2019-02-14 16:51:57,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:51:57,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:51:57,398 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 34 states. [2019-02-14 16:51:57,398 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 34 states. [2019-02-14 16:51:57,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:51:57,400 INFO L93 Difference]: Finished difference Result 34 states and 65 transitions. [2019-02-14 16:51:57,400 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 65 transitions. [2019-02-14 16:51:57,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:51:57,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:51:57,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:51:57,401 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:51:57,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-02-14 16:51:57,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 38 transitions. [2019-02-14 16:51:57,403 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 38 transitions. Word has length 4 [2019-02-14 16:51:57,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:51:57,403 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 38 transitions. [2019-02-14 16:51:57,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-14 16:51:57,403 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 38 transitions. [2019-02-14 16:51:57,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-14 16:51:57,404 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:51:57,404 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-14 16:51:57,404 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-14 16:51:57,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:51:57,404 INFO L82 PathProgramCache]: Analyzing trace with hash 933644, now seen corresponding path program 1 times [2019-02-14 16:51:57,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:51:57,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:51:57,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:51:57,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:51:57,406 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:51:57,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:51:57,452 INFO L273 TraceCheckUtils]: 0: Hoare triple {677#true} havoc main_p1, main_p2, main_p3;malloc_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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {679#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2019-02-14 16:51:57,458 INFO L273 TraceCheckUtils]: 1: Hoare triple {679#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {680#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2019-02-14 16:51:57,459 INFO L273 TraceCheckUtils]: 2: Hoare triple {680#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume #memory_int[main_p1] >= 0; {680#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2019-02-14 16:51:57,463 INFO L273 TraceCheckUtils]: 3: Hoare triple {680#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume !(#memory_int[main_p2] <= 0); {678#false} is VALID [2019-02-14 16:51:57,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:51:57,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:51:57,463 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-14 16:51:57,464 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-14 16:51:57,464 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [17] [2019-02-14 16:51:57,465 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-14 16:51:57,465 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-14 16:52:00,983 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-14 16:52:00,984 INFO L272 AbstractInterpreter]: Visited 4 different actions 6 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-14 16:52:00,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:52:00,984 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-14 16:52:00,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:52:00,984 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-14 16:52:01,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:52:01,007 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-14 16:52:01,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:52:01,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:52:01,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-14 16:52:01,024 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 12 treesize of output 15 [2019-02-14 16:52:01,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2019-02-14 16:52:01,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2019-02-14 16:52:01,040 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:52:01,047 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:52:01,054 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:52:01,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-14 16:52:01,060 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:12, output treesize:16 [2019-02-14 16:52:01,063 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:52:01,064 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_31|, ULTIMATE.start_main_p1, ULTIMATE.start_main_p3]. (= |#memory_int| (store (store (store |v_#memory_int_31| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0) ULTIMATE.start_main_p3 0)) [2019-02-14 16:52:01,064 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p1, ULTIMATE.start_main_p3]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)) [2019-02-14 16:52:01,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:52:01,080 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2019-02-14 16:52:01,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:52:01,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:52:01,082 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-02-14 16:52:01,091 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:52:01,091 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_32|]. (let ((.cse0 (select |v_#memory_int_32| ULTIMATE.start_main_p2))) (and (= .cse0 0) (= (store |v_#memory_int_32| ULTIMATE.start_main_p2 (+ .cse0 (- 1))) |#memory_int|))) [2019-02-14 16:52:01,092 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ []. (= (- 1) (select |#memory_int| ULTIMATE.start_main_p2)) [2019-02-14 16:52:01,099 INFO L273 TraceCheckUtils]: 0: Hoare triple {677#true} havoc main_p1, main_p2, main_p3;malloc_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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {679#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2019-02-14 16:52:01,100 INFO L273 TraceCheckUtils]: 1: Hoare triple {679#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {687#(= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1))} is VALID [2019-02-14 16:52:01,100 INFO L273 TraceCheckUtils]: 2: Hoare triple {687#(= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1))} assume #memory_int[main_p1] >= 0; {687#(= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1))} is VALID [2019-02-14 16:52:01,101 INFO L273 TraceCheckUtils]: 3: Hoare triple {687#(= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1))} assume !(#memory_int[main_p2] <= 0); {678#false} is VALID [2019-02-14 16:52:01,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:52:01,101 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-14 16:52:01,111 INFO L273 TraceCheckUtils]: 3: Hoare triple {680#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume !(#memory_int[main_p2] <= 0); {678#false} is VALID [2019-02-14 16:52:01,112 INFO L273 TraceCheckUtils]: 2: Hoare triple {680#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume #memory_int[main_p1] >= 0; {680#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2019-02-14 16:52:01,113 INFO L273 TraceCheckUtils]: 1: Hoare triple {700#(<= (select |#memory_int| ULTIMATE.start_main_p2) 1)} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {680#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2019-02-14 16:52:01,115 INFO L273 TraceCheckUtils]: 0: Hoare triple {677#true} havoc main_p1, main_p2, main_p3;malloc_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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {700#(<= (select |#memory_int| ULTIMATE.start_main_p2) 1)} is VALID [2019-02-14 16:52:01,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:52:01,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-14 16:52:01,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 4 [2019-02-14 16:52:01,135 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-14 16:52:01,136 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-14 16:52:01,136 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:52:01,136 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-02-14 16:52:01,144 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:52:01,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-14 16:52:01,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-14 16:52:01,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-02-14 16:52:01,145 INFO L87 Difference]: Start difference. First operand 15 states and 38 transitions. Second operand 4 states. [2019-02-14 16:52:01,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:52:01,283 INFO L93 Difference]: Finished difference Result 30 states and 79 transitions. [2019-02-14 16:52:01,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-14 16:52:01,283 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-14 16:52:01,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:52:01,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-14 16:52:01,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2019-02-14 16:52:01,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-14 16:52:01,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2019-02-14 16:52:01,285 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 23 transitions. [2019-02-14 16:52:01,306 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:52:01,307 INFO L225 Difference]: With dead ends: 30 [2019-02-14 16:52:01,307 INFO L226 Difference]: Without dead ends: 29 [2019-02-14 16:52:01,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-02-14 16:52:01,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-02-14 16:52:01,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2019-02-14 16:52:01,358 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:52:01,358 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 23 states. [2019-02-14 16:52:01,358 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 23 states. [2019-02-14 16:52:01,359 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 23 states. [2019-02-14 16:52:01,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:52:01,361 INFO L93 Difference]: Finished difference Result 29 states and 78 transitions. [2019-02-14 16:52:01,361 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 78 transitions. [2019-02-14 16:52:01,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:52:01,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:52:01,362 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 29 states. [2019-02-14 16:52:01,362 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 29 states. [2019-02-14 16:52:01,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:52:01,364 INFO L93 Difference]: Finished difference Result 29 states and 78 transitions. [2019-02-14 16:52:01,364 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 78 transitions. [2019-02-14 16:52:01,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:52:01,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:52:01,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:52:01,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:52:01,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-02-14 16:52:01,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 74 transitions. [2019-02-14 16:52:01,367 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 74 transitions. Word has length 4 [2019-02-14 16:52:01,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:52:01,367 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 74 transitions. [2019-02-14 16:52:01,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-14 16:52:01,367 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 74 transitions. [2019-02-14 16:52:01,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-14 16:52:01,368 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:52:01,368 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-14 16:52:01,368 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-14 16:52:01,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:52:01,369 INFO L82 PathProgramCache]: Analyzing trace with hash 933518, now seen corresponding path program 1 times [2019-02-14 16:52:01,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:52:01,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:52:01,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:52:01,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:52:01,370 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:52:01,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:52:01,488 INFO L273 TraceCheckUtils]: 0: Hoare triple {846#true} havoc main_p1, main_p2, main_p3;malloc_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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {848#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1)))} is VALID [2019-02-14 16:52:01,490 INFO L273 TraceCheckUtils]: 1: Hoare triple {848#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1)))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {849#(and (or (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3))) (or (= 0 (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p1)) (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3)))} is VALID [2019-02-14 16:52:01,491 INFO L273 TraceCheckUtils]: 2: Hoare triple {849#(and (or (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3))) (or (= 0 (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p1)) (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3)))} #memory_int := #memory_int[main_p3 := #memory_int[main_p3] + 1]; {850#(or (<= 1 (select |#memory_int| ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0))} is VALID [2019-02-14 16:52:01,492 INFO L273 TraceCheckUtils]: 3: Hoare triple {850#(or (<= 1 (select |#memory_int| ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0))} assume !(#memory_int[main_p1] >= 0); {847#false} is VALID [2019-02-14 16:52:01,492 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:52:01,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:52:01,492 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-14 16:52:01,492 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-14 16:52:01,492 INFO L207 CegarAbsIntRunner]: [0], [10], [12], [15] [2019-02-14 16:52:01,493 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-14 16:52:01,493 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-14 16:52:06,237 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-14 16:52:06,237 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-14 16:52:06,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:52:06,238 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-14 16:52:06,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:52:06,238 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-14 16:52:06,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:52:06,248 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-14 16:52:06,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:52:06,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:52:06,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-14 16:52:06,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 12 treesize of output 15 [2019-02-14 16:52:06,335 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 15 treesize of output 21 [2019-02-14 16:52:06,340 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:52:06,341 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:52:06,342 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-02-14 16:52:06,344 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:52:06,355 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:52:06,362 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:52:06,378 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:52:06,379 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 17 treesize of output 29 [2019-02-14 16:52:06,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:52:06,413 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:52:06,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-14 16:52:06,416 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:52:06,421 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:52:06,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:52:06,434 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-02-14 16:52:06,439 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:52:06,439 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_34|, |v_#valid_9|]. (let ((.cse0 (store |v_#valid_9| ULTIMATE.start_main_p1 1))) (and (= (select .cse0 ULTIMATE.start_main_p2) 0) (= (select (store .cse0 ULTIMATE.start_main_p2 1) ULTIMATE.start_main_p3) 0) (= |#memory_int| (store (store (store |v_#memory_int_34| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0) ULTIMATE.start_main_p3 0)))) [2019-02-14 16:52:06,440 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ []. (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)) (= 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)) [2019-02-14 16:52:06,479 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:52:06,480 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-02-14 16:52:06,490 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:52:06,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-14 16:52:06,502 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-14 16:52:08,836 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:52:08,836 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_35|, ULTIMATE.start_main_p2]. (let ((.cse0 (select |v_#memory_int_35| ULTIMATE.start_main_p2))) (and (= 0 (select |v_#memory_int_35| ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= (store |v_#memory_int_35| ULTIMATE.start_main_p2 (+ .cse0 (- 1))) |#memory_int|) (= 0 .cse0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= 0 (select |v_#memory_int_35| ULTIMATE.start_main_p3)))) [2019-02-14 16:52:08,836 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p2]. (and (= (- 1) (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)) [2019-02-14 16:52:08,980 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:52:08,982 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:52:08,984 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:52:08,986 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:52:08,988 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:52:08,989 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-14 16:52:08,993 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:52:09,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-14 16:52:09,018 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2019-02-14 16:52:11,051 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:52:11,052 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_36|, ULTIMATE.start_main_p3, ULTIMATE.start_main_p2]. (let ((.cse0 (select |v_#memory_int_36| ULTIMATE.start_main_p3))) (and (= (store |v_#memory_int_36| ULTIMATE.start_main_p3 (+ .cse0 1)) |#memory_int|) (= 0 (+ (select |v_#memory_int_36| ULTIMATE.start_main_p2) 1)) (= .cse0 0) (= (select |v_#memory_int_36| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)))) [2019-02-14 16:52:11,052 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3, ULTIMATE.start_main_p2]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)) [2019-02-14 16:52:11,078 INFO L273 TraceCheckUtils]: 0: Hoare triple {846#true} havoc main_p1, main_p2, main_p3;malloc_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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {854#(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)) (= 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))} is VALID [2019-02-14 16:52:11,079 INFO L273 TraceCheckUtils]: 1: Hoare triple {854#(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)) (= 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))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {858#(and (exists ((ULTIMATE.start_main_p2 Int)) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} is VALID [2019-02-14 16:52:11,081 INFO L273 TraceCheckUtils]: 2: Hoare triple {858#(and (exists ((ULTIMATE.start_main_p2 Int)) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1))) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} #memory_int := #memory_int[main_p3 := #memory_int[main_p3] + 1]; {862#(and (exists ((ULTIMATE.start_main_p2 Int)) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p3 Int)) (= (select |#memory_int| ULTIMATE.start_main_p3) 1)))} is VALID [2019-02-14 16:52:11,082 INFO L273 TraceCheckUtils]: 3: Hoare triple {862#(and (exists ((ULTIMATE.start_main_p2 Int)) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (exists ((ULTIMATE.start_main_p3 Int)) (= (select |#memory_int| ULTIMATE.start_main_p3) 1)))} assume !(#memory_int[main_p1] >= 0); {847#false} is VALID [2019-02-14 16:52:11,082 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:52:11,082 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-14 16:52:11,133 INFO L273 TraceCheckUtils]: 3: Hoare triple {850#(or (<= 1 (select |#memory_int| ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0))} assume !(#memory_int[main_p1] >= 0); {847#false} is VALID [2019-02-14 16:52:11,134 INFO L273 TraceCheckUtils]: 2: Hoare triple {869#(or (= (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p1) 0) (<= 1 (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p1)))} #memory_int := #memory_int[main_p3 := #memory_int[main_p3] + 1]; {850#(or (<= 1 (select |#memory_int| ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0))} is VALID [2019-02-14 16:52:11,135 INFO L273 TraceCheckUtils]: 1: Hoare triple {873#(or (<= 1 (select (store (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p3 (+ (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p1)) (= 0 (select (store (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p3 (+ (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p1)))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {869#(or (= (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p1) 0) (<= 1 (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p1)))} is VALID [2019-02-14 16:52:11,136 INFO L273 TraceCheckUtils]: 0: Hoare triple {846#true} havoc main_p1, main_p2, main_p3;malloc_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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {873#(or (<= 1 (select (store (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p3 (+ (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p1)) (= 0 (select (store (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p3 (+ (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p1)))} is VALID [2019-02-14 16:52:11,137 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:52:11,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-14 16:52:11,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-14 16:52:11,156 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-14 16:52:11,156 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-14 16:52:11,156 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:52:11,156 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2019-02-14 16:52:11,169 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:52:11,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-14 16:52:11,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-14 16:52:11,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-02-14 16:52:11,170 INFO L87 Difference]: Start difference. First operand 23 states and 74 transitions. Second operand 8 states. [2019-02-14 16:52:11,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:52:11,610 INFO L93 Difference]: Finished difference Result 48 states and 138 transitions. [2019-02-14 16:52:11,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-14 16:52:11,610 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-14 16:52:11,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:52:11,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-14 16:52:11,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2019-02-14 16:52:11,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-14 16:52:11,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2019-02-14 16:52:11,612 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 39 transitions. [2019-02-14 16:52:11,660 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:52:11,662 INFO L225 Difference]: With dead ends: 48 [2019-02-14 16:52:11,662 INFO L226 Difference]: Without dead ends: 44 [2019-02-14 16:52:11,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-02-14 16:52:11,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-02-14 16:52:11,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2019-02-14 16:52:11,802 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:52:11,802 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 31 states. [2019-02-14 16:52:11,802 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 31 states. [2019-02-14 16:52:11,802 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 31 states. [2019-02-14 16:52:11,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:52:11,806 INFO L93 Difference]: Finished difference Result 44 states and 128 transitions. [2019-02-14 16:52:11,806 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 128 transitions. [2019-02-14 16:52:11,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:52:11,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:52:11,807 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 44 states. [2019-02-14 16:52:11,807 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 44 states. [2019-02-14 16:52:11,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:52:11,810 INFO L93 Difference]: Finished difference Result 44 states and 128 transitions. [2019-02-14 16:52:11,810 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 128 transitions. [2019-02-14 16:52:11,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:52:11,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:52:11,810 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:52:11,811 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:52:11,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-14 16:52:11,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 105 transitions. [2019-02-14 16:52:11,813 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 105 transitions. Word has length 4 [2019-02-14 16:52:11,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:52:11,813 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 105 transitions. [2019-02-14 16:52:11,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-14 16:52:11,813 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 105 transitions. [2019-02-14 16:52:11,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-14 16:52:11,814 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:52:11,814 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-14 16:52:11,814 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-14 16:52:11,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:52:11,815 INFO L82 PathProgramCache]: Analyzing trace with hash 935566, now seen corresponding path program 1 times [2019-02-14 16:52:11,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:52:11,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:52:11,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:52:11,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:52:11,816 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:52:11,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:52:11,915 INFO L273 TraceCheckUtils]: 0: Hoare triple {1099#true} havoc main_p1, main_p2, main_p3;malloc_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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {1101#(and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p2)))} is VALID [2019-02-14 16:52:11,916 INFO L273 TraceCheckUtils]: 1: Hoare triple {1101#(and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p2)))} #memory_int := #memory_int[main_p3 := #memory_int[main_p3] + 1]; {1102#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2019-02-14 16:52:11,916 INFO L273 TraceCheckUtils]: 2: Hoare triple {1102#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume #memory_int[main_p1] >= 0; {1102#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2019-02-14 16:52:11,917 INFO L273 TraceCheckUtils]: 3: Hoare triple {1102#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume !(#memory_int[main_p2] <= 0); {1100#false} is VALID [2019-02-14 16:52:11,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:52:11,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:52:11,918 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-14 16:52:11,918 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-14 16:52:11,918 INFO L207 CegarAbsIntRunner]: [0], [12], [16], [17] [2019-02-14 16:52:11,920 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-14 16:52:11,920 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-14 16:52:43,871 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-14 16:52:43,872 INFO L272 AbstractInterpreter]: Visited 4 different actions 12 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-14 16:52:43,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:52:43,873 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-14 16:52:43,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:52:43,874 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-14 16:52:43,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:52:43,883 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-14 16:52:43,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:52:43,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:52:43,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-14 16:52:43,920 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 11 treesize of output 14 [2019-02-14 16:52:43,940 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:52:43,941 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:52:43,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-02-14 16:52:43,949 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:52:43,954 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:52:43,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 12 treesize of output 15 [2019-02-14 16:52:43,972 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 15 treesize of output 17 [2019-02-14 16:52:43,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2019-02-14 16:52:43,985 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:52:43,994 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:52:44,001 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:52:44,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-14 16:52:44,012 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:24, output treesize:24 [2019-02-14 16:52:44,016 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:52:44,016 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_39|, ULTIMATE.start_main_p1, |v_#valid_10|]. (and (= 0 (select (store (store |v_#valid_10| ULTIMATE.start_main_p1 1) ULTIMATE.start_main_p2 1) ULTIMATE.start_main_p3)) (= |#memory_int| (store (store (store |v_#memory_int_39| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0) ULTIMATE.start_main_p3 0))) [2019-02-14 16:52:44,016 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p1]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 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)) [2019-02-14 16:52:44,086 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:52:44,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-14 16:52:44,110 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:52:44,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-14 16:52:44,132 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:11 [2019-02-14 16:52:46,209 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:52:46,209 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_40|, ULTIMATE.start_main_p3]. (let ((.cse0 (select |v_#memory_int_40| ULTIMATE.start_main_p3))) (and (= .cse0 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= |#memory_int| (store |v_#memory_int_40| ULTIMATE.start_main_p3 (+ .cse0 1))) (= (select |v_#memory_int_40| ULTIMATE.start_main_p2) 0))) [2019-02-14 16:52:46,209 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3]. (and (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (= 0 (select |#memory_int| ULTIMATE.start_main_p2))) [2019-02-14 16:52:46,251 INFO L273 TraceCheckUtils]: 0: Hoare triple {1099#true} havoc main_p1, main_p2, main_p3;malloc_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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {1106#(and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} is VALID [2019-02-14 16:52:46,265 INFO L273 TraceCheckUtils]: 1: Hoare triple {1106#(and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} #memory_int := #memory_int[main_p3 := #memory_int[main_p3] + 1]; {1110#(and (exists ((ULTIMATE.start_main_p3 Int)) (= (select |#memory_int| ULTIMATE.start_main_p3) 1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))} is VALID [2019-02-14 16:52:46,269 INFO L273 TraceCheckUtils]: 2: Hoare triple {1110#(and (exists ((ULTIMATE.start_main_p3 Int)) (= (select |#memory_int| ULTIMATE.start_main_p3) 1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))} assume #memory_int[main_p1] >= 0; {1110#(and (exists ((ULTIMATE.start_main_p3 Int)) (= (select |#memory_int| ULTIMATE.start_main_p3) 1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))} is VALID [2019-02-14 16:52:46,270 INFO L273 TraceCheckUtils]: 3: Hoare triple {1110#(and (exists ((ULTIMATE.start_main_p3 Int)) (= (select |#memory_int| ULTIMATE.start_main_p3) 1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))} assume !(#memory_int[main_p2] <= 0); {1100#false} is VALID [2019-02-14 16:52:46,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:52:46,270 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-14 16:52:46,291 INFO L273 TraceCheckUtils]: 3: Hoare triple {1117#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume !(#memory_int[main_p2] <= 0); {1100#false} is VALID [2019-02-14 16:52:46,292 INFO L273 TraceCheckUtils]: 2: Hoare triple {1117#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume #memory_int[main_p1] >= 0; {1117#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2019-02-14 16:52:46,293 INFO L273 TraceCheckUtils]: 1: Hoare triple {1124#(<= (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p2) 0)} #memory_int := #memory_int[main_p3 := #memory_int[main_p3] + 1]; {1117#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2019-02-14 16:52:46,294 INFO L273 TraceCheckUtils]: 0: Hoare triple {1099#true} havoc main_p1, main_p2, main_p3;malloc_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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {1124#(<= (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p2) 0)} is VALID [2019-02-14 16:52:46,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:52:46,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-14 16:52:46,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-14 16:52:46,313 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-14 16:52:46,313 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-14 16:52:46,313 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:52:46,313 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2019-02-14 16:52:46,324 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:52:46,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-14 16:52:46,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-14 16:52:46,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-14 16:52:46,325 INFO L87 Difference]: Start difference. First operand 31 states and 105 transitions. Second operand 6 states. [2019-02-14 16:52:46,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:52:46,633 INFO L93 Difference]: Finished difference Result 39 states and 115 transitions. [2019-02-14 16:52:46,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-14 16:52:46,633 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-14 16:52:46,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:52:46,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-14 16:52:46,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2019-02-14 16:52:46,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-14 16:52:46,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2019-02-14 16:52:46,635 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 26 transitions. [2019-02-14 16:52:46,685 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:52:46,686 INFO L225 Difference]: With dead ends: 39 [2019-02-14 16:52:46,686 INFO L226 Difference]: Without dead ends: 38 [2019-02-14 16:52:46,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-14 16:52:46,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-02-14 16:52:46,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2019-02-14 16:52:46,786 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:52:46,787 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 32 states. [2019-02-14 16:52:46,787 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 32 states. [2019-02-14 16:52:46,787 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 32 states. [2019-02-14 16:52:46,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:52:46,788 INFO L93 Difference]: Finished difference Result 38 states and 113 transitions. [2019-02-14 16:52:46,788 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 113 transitions. [2019-02-14 16:52:46,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:52:46,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:52:46,789 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 38 states. [2019-02-14 16:52:46,789 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 38 states. [2019-02-14 16:52:46,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:52:46,791 INFO L93 Difference]: Finished difference Result 38 states and 113 transitions. [2019-02-14 16:52:46,791 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 113 transitions. [2019-02-14 16:52:46,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:52:46,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:52:46,792 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:52:46,792 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:52:46,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-02-14 16:52:46,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 109 transitions. [2019-02-14 16:52:46,794 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 109 transitions. Word has length 4 [2019-02-14 16:52:46,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:52:46,794 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 109 transitions. [2019-02-14 16:52:46,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-14 16:52:46,794 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 109 transitions. [2019-02-14 16:52:46,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-14 16:52:46,795 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:52:46,795 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-14 16:52:46,795 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-14 16:52:46,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:52:46,795 INFO L82 PathProgramCache]: Analyzing trace with hash 28823850, now seen corresponding path program 1 times [2019-02-14 16:52:46,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:52:46,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:52:46,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:52:46,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:52:46,797 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:52:46,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:52:46,888 INFO L273 TraceCheckUtils]: 0: Hoare triple {1326#true} havoc main_p1, main_p2, main_p3;malloc_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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {1328#(or (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p3)) (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3))} is VALID [2019-02-14 16:52:46,889 INFO L273 TraceCheckUtils]: 1: Hoare triple {1328#(or (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p3)) (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1329#(or (<= (select |#memory_int| ULTIMATE.start_main_p1) (select |#memory_int| ULTIMATE.start_main_p3)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} is VALID [2019-02-14 16:52:46,890 INFO L273 TraceCheckUtils]: 2: Hoare triple {1329#(or (<= (select |#memory_int| ULTIMATE.start_main_p1) (select |#memory_int| ULTIMATE.start_main_p3)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} assume #memory_int[main_p1] >= 0; {1330#(<= 0 (select |#memory_int| ULTIMATE.start_main_p3))} is VALID [2019-02-14 16:52:46,891 INFO L273 TraceCheckUtils]: 3: Hoare triple {1330#(<= 0 (select |#memory_int| ULTIMATE.start_main_p3))} assume #memory_int[main_p2] <= 0; {1330#(<= 0 (select |#memory_int| ULTIMATE.start_main_p3))} is VALID [2019-02-14 16:52:46,891 INFO L273 TraceCheckUtils]: 4: Hoare triple {1330#(<= 0 (select |#memory_int| ULTIMATE.start_main_p3))} assume !(#memory_int[main_p3] >= 0); {1327#false} is VALID [2019-02-14 16:52:46,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:52:46,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:52:46,892 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-14 16:52:46,893 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-14 16:52:46,893 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [18], [19] [2019-02-14 16:52:46,894 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-14 16:52:46,894 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-14 16:52:49,538 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-14 16:52:49,538 INFO L272 AbstractInterpreter]: Visited 5 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-14 16:52:49,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:52:49,539 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-14 16:52:49,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:52:49,539 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-14 16:52:49,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:52:49,547 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-14 16:52:49,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:52:49,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:52:49,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-14 16:52:49,594 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 12 treesize of output 15 [2019-02-14 16:52:49,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2019-02-14 16:52:49,620 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:52:49,621 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:52:49,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2019-02-14 16:52:49,626 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:52:49,642 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:52:49,649 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:52:49,661 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 11 treesize of output 14 [2019-02-14 16:52:49,676 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:52:49,677 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:52:49,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-02-14 16:52:49,679 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:52:49,685 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:52:49,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-14 16:52:49,696 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:24, output treesize:24 [2019-02-14 16:52:49,700 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:52:49,700 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_42|, ULTIMATE.start_main_p2, |v_#valid_11|]. (and (= (select (store (store |v_#valid_11| ULTIMATE.start_main_p1 1) ULTIMATE.start_main_p2 1) ULTIMATE.start_main_p3) 0) (= |#memory_int| (store (store (store |v_#memory_int_42| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0) ULTIMATE.start_main_p3 0))) [2019-02-14 16:52:49,700 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p2]. (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 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)) [2019-02-14 16:52:49,745 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:52:49,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-02-14 16:52:49,755 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:52:49,760 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-14 16:52:49,761 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:11 [2019-02-14 16:52:51,912 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:52:51,912 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_43|, ULTIMATE.start_main_p1]. (let ((.cse0 (select |v_#memory_int_43| ULTIMATE.start_main_p1))) (and (= .cse0 0) (= (store |v_#memory_int_43| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |v_#memory_int_43| ULTIMATE.start_main_p3) 0))) [2019-02-14 16:52:51,913 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p1]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)) [2019-02-14 16:52:51,944 INFO L273 TraceCheckUtils]: 0: Hoare triple {1326#true} havoc main_p1, main_p2, main_p3;malloc_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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {1334#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} is VALID [2019-02-14 16:52:51,946 INFO L273 TraceCheckUtils]: 1: Hoare triple {1334#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1338#(and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} is VALID [2019-02-14 16:52:51,947 INFO L273 TraceCheckUtils]: 2: Hoare triple {1338#(and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} assume #memory_int[main_p1] >= 0; {1338#(and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} is VALID [2019-02-14 16:52:51,947 INFO L273 TraceCheckUtils]: 3: Hoare triple {1338#(and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} assume #memory_int[main_p2] <= 0; {1338#(and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} is VALID [2019-02-14 16:52:51,948 INFO L273 TraceCheckUtils]: 4: Hoare triple {1338#(and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} assume !(#memory_int[main_p3] >= 0); {1327#false} is VALID [2019-02-14 16:52:51,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:52:51,949 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-14 16:52:51,965 INFO L273 TraceCheckUtils]: 4: Hoare triple {1330#(<= 0 (select |#memory_int| ULTIMATE.start_main_p3))} assume !(#memory_int[main_p3] >= 0); {1327#false} is VALID [2019-02-14 16:52:51,965 INFO L273 TraceCheckUtils]: 3: Hoare triple {1330#(<= 0 (select |#memory_int| ULTIMATE.start_main_p3))} assume #memory_int[main_p2] <= 0; {1330#(<= 0 (select |#memory_int| ULTIMATE.start_main_p3))} is VALID [2019-02-14 16:52:51,966 INFO L273 TraceCheckUtils]: 2: Hoare triple {1330#(<= 0 (select |#memory_int| ULTIMATE.start_main_p3))} assume #memory_int[main_p1] >= 0; {1330#(<= 0 (select |#memory_int| ULTIMATE.start_main_p3))} is VALID [2019-02-14 16:52:51,967 INFO L273 TraceCheckUtils]: 1: Hoare triple {1357#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p3))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1330#(<= 0 (select |#memory_int| ULTIMATE.start_main_p3))} is VALID [2019-02-14 16:52:51,968 INFO L273 TraceCheckUtils]: 0: Hoare triple {1326#true} havoc main_p1, main_p2, main_p3;malloc_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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {1357#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p3))} is VALID [2019-02-14 16:52:51,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:52:51,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-14 16:52:51,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3, 2] total 6 [2019-02-14 16:52:51,990 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-14 16:52:51,990 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-14 16:52:51,990 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:52:51,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-02-14 16:52:51,996 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:52:51,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-14 16:52:51,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-14 16:52:51,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-02-14 16:52:51,997 INFO L87 Difference]: Start difference. First operand 32 states and 109 transitions. Second operand 4 states. [2019-02-14 16:52:52,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:52:52,206 INFO L93 Difference]: Finished difference Result 39 states and 121 transitions. [2019-02-14 16:52:52,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-14 16:52:52,206 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-14 16:52:52,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:52:52,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-14 16:52:52,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-02-14 16:52:52,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-14 16:52:52,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-02-14 16:52:52,208 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 16 transitions. [2019-02-14 16:52:52,227 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:52:52,229 INFO L225 Difference]: With dead ends: 39 [2019-02-14 16:52:52,229 INFO L226 Difference]: Without dead ends: 36 [2019-02-14 16:52:52,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-02-14 16:52:52,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-02-14 16:52:52,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-02-14 16:52:52,387 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:52:52,387 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 35 states. [2019-02-14 16:52:52,387 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 35 states. [2019-02-14 16:52:52,387 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 35 states. [2019-02-14 16:52:52,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:52:52,390 INFO L93 Difference]: Finished difference Result 36 states and 114 transitions. [2019-02-14 16:52:52,390 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 114 transitions. [2019-02-14 16:52:52,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:52:52,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:52:52,391 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 36 states. [2019-02-14 16:52:52,391 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 36 states. [2019-02-14 16:52:52,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:52:52,393 INFO L93 Difference]: Finished difference Result 36 states and 114 transitions. [2019-02-14 16:52:52,393 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 114 transitions. [2019-02-14 16:52:52,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:52:52,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:52:52,393 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:52:52,393 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:52:52,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-02-14 16:52:52,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 114 transitions. [2019-02-14 16:52:52,395 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 114 transitions. Word has length 5 [2019-02-14 16:52:52,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:52:52,395 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 114 transitions. [2019-02-14 16:52:52,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-14 16:52:52,396 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 114 transitions. [2019-02-14 16:52:52,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-14 16:52:52,396 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:52:52,396 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-14 16:52:52,396 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-14 16:52:52,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:52:52,397 INFO L82 PathProgramCache]: Analyzing trace with hash 28819942, now seen corresponding path program 1 times [2019-02-14 16:52:52,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:52:52,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:52:52,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:52:52,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:52:52,398 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:52:52,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:52:52,499 INFO L273 TraceCheckUtils]: 0: Hoare triple {1560#true} havoc main_p1, main_p2, main_p3;malloc_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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {1562#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2)))} is VALID [2019-02-14 16:52:52,500 INFO L273 TraceCheckUtils]: 1: Hoare triple {1562#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2)))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1562#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2)))} is VALID [2019-02-14 16:52:52,501 INFO L273 TraceCheckUtils]: 2: Hoare triple {1562#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2)))} #memory_int := #memory_int[main_p3 := #memory_int[main_p3] + 1]; {1563#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2019-02-14 16:52:52,503 INFO L273 TraceCheckUtils]: 3: Hoare triple {1563#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume #memory_int[main_p1] >= 0; {1563#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2019-02-14 16:52:52,503 INFO L273 TraceCheckUtils]: 4: Hoare triple {1563#(= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume !(#memory_int[main_p2] <= 0); {1561#false} is VALID [2019-02-14 16:52:52,504 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-14 16:52:52,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:52:52,505 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-14 16:52:52,505 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-14 16:52:52,505 INFO L207 CegarAbsIntRunner]: [0], [6], [12], [16], [17] [2019-02-14 16:52:52,507 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-14 16:52:52,507 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-14 16:52:57,457 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-14 16:52:57,457 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-14 16:52:57,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:52:57,458 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-14 16:52:57,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:52:57,458 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-14 16:52:57,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:52:57,469 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-14 16:52:57,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:52:57,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:52:57,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-14 16:52:57,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 12 treesize of output 15 [2019-02-14 16:52:57,533 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 15 treesize of output 21 [2019-02-14 16:52:57,544 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:52:57,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:52:57,547 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-02-14 16:52:57,569 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:52:57,584 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:52:57,591 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:52:57,610 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:52:57,611 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 17 treesize of output 29 [2019-02-14 16:52:57,650 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:52:57,680 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:52:57,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-14 16:52:57,685 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:52:57,693 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:52:57,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:52:57,704 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-02-14 16:52:57,713 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:52:57,714 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_45|, |v_#valid_12|]. (let ((.cse0 (store |v_#valid_12| ULTIMATE.start_main_p1 1))) (and (= |#memory_int| (store (store (store |v_#memory_int_45| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0) ULTIMATE.start_main_p3 0)) (= 0 (select (store .cse0 ULTIMATE.start_main_p2 1) ULTIMATE.start_main_p3)) (= 0 (select .cse0 ULTIMATE.start_main_p2)))) [2019-02-14 16:52:57,714 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ []. (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)) (= 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)) [2019-02-14 16:52:57,783 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:52:57,784 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-14 16:52:57,787 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:52:57,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-14 16:52:57,947 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-14 16:52:57,966 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:52:57,967 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_46|, ULTIMATE.start_main_p1]. (let ((.cse0 (select |v_#memory_int_46| ULTIMATE.start_main_p1))) (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (select |v_#memory_int_46| ULTIMATE.start_main_p3) 0) (= (store |v_#memory_int_46| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select |v_#memory_int_46| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= 0 .cse0))) [2019-02-14 16:52:57,967 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p1]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)) [2019-02-14 16:52:58,222 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-02-14 16:52:58,271 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:52:58,272 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:52:58,273 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:52:58,273 INFO L683 Elim1Store]: detected equality via solver [2019-02-14 16:52:58,274 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-02-14 16:52:58,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:52:58,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-14 16:52:58,291 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2019-02-14 16:53:00,437 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:53:00,438 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_47|, ULTIMATE.start_main_p3, ULTIMATE.start_main_p1]. (let ((.cse0 (select |v_#memory_int_47| ULTIMATE.start_main_p3))) (and (= (select |v_#memory_int_47| ULTIMATE.start_main_p1) 1) (= .cse0 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (store |v_#memory_int_47| ULTIMATE.start_main_p3 (+ .cse0 1)) |#memory_int|) (= (select |v_#memory_int_47| ULTIMATE.start_main_p2) 0))) [2019-02-14 16:53:00,438 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p1, ULTIMATE.start_main_p3]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1))) [2019-02-14 16:53:00,542 INFO L273 TraceCheckUtils]: 0: Hoare triple {1560#true} havoc main_p1, main_p2, main_p3;malloc_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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {1567#(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)) (= 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))} is VALID [2019-02-14 16:53:00,544 INFO L273 TraceCheckUtils]: 1: Hoare triple {1567#(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)) (= 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))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1571#(and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} is VALID [2019-02-14 16:53:00,545 INFO L273 TraceCheckUtils]: 2: Hoare triple {1571#(and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} #memory_int := #memory_int[main_p3 := #memory_int[main_p3] + 1]; {1575#(and (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (exists ((ULTIMATE.start_main_p1 Int) (ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)))))} is VALID [2019-02-14 16:53:00,546 INFO L273 TraceCheckUtils]: 3: Hoare triple {1575#(and (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (exists ((ULTIMATE.start_main_p1 Int) (ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)))))} assume #memory_int[main_p1] >= 0; {1575#(and (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (exists ((ULTIMATE.start_main_p1 Int) (ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)))))} is VALID [2019-02-14 16:53:00,547 INFO L273 TraceCheckUtils]: 4: Hoare triple {1575#(and (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (exists ((ULTIMATE.start_main_p1 Int) (ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)))))} assume !(#memory_int[main_p2] <= 0); {1561#false} is VALID [2019-02-14 16:53:00,548 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:53:00,548 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-14 16:53:00,583 INFO L273 TraceCheckUtils]: 4: Hoare triple {1582#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume !(#memory_int[main_p2] <= 0); {1561#false} is VALID [2019-02-14 16:53:00,584 INFO L273 TraceCheckUtils]: 3: Hoare triple {1582#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume #memory_int[main_p1] >= 0; {1582#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2019-02-14 16:53:00,585 INFO L273 TraceCheckUtils]: 2: Hoare triple {1589#(<= (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p2) 0)} #memory_int := #memory_int[main_p3 := #memory_int[main_p3] + 1]; {1582#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2019-02-14 16:53:00,586 INFO L273 TraceCheckUtils]: 1: Hoare triple {1593#(<= (select (store (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p3 (+ (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p2) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1589#(<= (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p2) 0)} is VALID [2019-02-14 16:53:00,588 INFO L273 TraceCheckUtils]: 0: Hoare triple {1560#true} havoc main_p1, main_p2, main_p3;malloc_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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {1593#(<= (select (store (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p3 (+ (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p2) 0)} is VALID [2019-02-14 16:53:00,588 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:53:00,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-14 16:53:00,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-02-14 16:53:00,608 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-14 16:53:00,609 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 5 [2019-02-14 16:53:00,609 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:53:00,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2019-02-14 16:53:00,621 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:53:00,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-14 16:53:00,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-14 16:53:00,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-02-14 16:53:00,622 INFO L87 Difference]: Start difference. First operand 35 states and 114 transitions. Second operand 7 states. [2019-02-14 16:53:01,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:53:01,011 INFO L93 Difference]: Finished difference Result 38 states and 119 transitions. [2019-02-14 16:53:01,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-14 16:53:01,011 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 5 [2019-02-14 16:53:01,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:53:01,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-14 16:53:01,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 25 transitions. [2019-02-14 16:53:01,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-14 16:53:01,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 25 transitions. [2019-02-14 16:53:01,013 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 25 transitions. [2019-02-14 16:53:01,048 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:53:01,049 INFO L225 Difference]: With dead ends: 38 [2019-02-14 16:53:01,049 INFO L226 Difference]: Without dead ends: 35 [2019-02-14 16:53:01,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-02-14 16:53:01,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-02-14 16:53:01,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2019-02-14 16:53:01,165 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:53:01,166 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 32 states. [2019-02-14 16:53:01,166 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 32 states. [2019-02-14 16:53:01,166 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 32 states. [2019-02-14 16:53:01,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:53:01,168 INFO L93 Difference]: Finished difference Result 35 states and 114 transitions. [2019-02-14 16:53:01,168 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 114 transitions. [2019-02-14 16:53:01,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:53:01,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:53:01,169 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 35 states. [2019-02-14 16:53:01,169 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 35 states. [2019-02-14 16:53:01,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:53:01,170 INFO L93 Difference]: Finished difference Result 35 states and 114 transitions. [2019-02-14 16:53:01,170 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 114 transitions. [2019-02-14 16:53:01,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:53:01,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:53:01,171 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:53:01,171 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:53:01,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-02-14 16:53:01,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 105 transitions. [2019-02-14 16:53:01,173 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 105 transitions. Word has length 5 [2019-02-14 16:53:01,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:53:01,173 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 105 transitions. [2019-02-14 16:53:01,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-14 16:53:01,173 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 105 transitions. [2019-02-14 16:53:01,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-14 16:53:01,173 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:53:01,173 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-14 16:53:01,174 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-14 16:53:01,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:53:01,174 INFO L82 PathProgramCache]: Analyzing trace with hash 28933340, now seen corresponding path program 1 times [2019-02-14 16:53:01,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:53:01,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:53:01,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:53:01,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:53:01,175 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:53:01,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:53:01,275 INFO L273 TraceCheckUtils]: 0: Hoare triple {1793#true} havoc main_p1, main_p2, main_p3;malloc_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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {1795#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p2) 0))} is VALID [2019-02-14 16:53:01,276 INFO L273 TraceCheckUtils]: 1: Hoare triple {1795#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p2) 0))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {1796#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (<= (+ (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) 1) 0))} is VALID [2019-02-14 16:53:01,277 INFO L273 TraceCheckUtils]: 2: Hoare triple {1796#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (<= (+ (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) 1) 0))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1797#(<= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)} is VALID [2019-02-14 16:53:01,278 INFO L273 TraceCheckUtils]: 3: Hoare triple {1797#(<= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)} assume #memory_int[main_p1] >= 0; {1797#(<= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)} is VALID [2019-02-14 16:53:01,279 INFO L273 TraceCheckUtils]: 4: Hoare triple {1797#(<= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)} assume !(#memory_int[main_p2] <= 0); {1794#false} is VALID [2019-02-14 16:53:01,279 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:53:01,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:53:01,280 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-14 16:53:01,280 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-14 16:53:01,280 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [17] [2019-02-14 16:53:01,284 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-14 16:53:01,284 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-14 16:53:05,453 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-14 16:53:05,454 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-14 16:53:05,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:53:05,454 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-14 16:53:05,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:53:05,454 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-14 16:53:05,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:53:05,464 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-14 16:53:05,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:53:05,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:53:05,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-14 16:53:05,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 [2019-02-14 16:53:05,504 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:53:05,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 12 treesize of output 15 [2019-02-14 16:53:05,520 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 15 treesize of output 21 [2019-02-14 16:53:05,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2019-02-14 16:53:05,556 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:53:05,579 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:53:05,585 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:53:05,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-14 16:53:05,595 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:21, output treesize:20 [2019-02-14 16:53:05,599 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:53:05,599 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_50|, ULTIMATE.start_main_p3, |v_#valid_13|]. (and (= 0 (select (store |v_#valid_13| ULTIMATE.start_main_p1 1) ULTIMATE.start_main_p2)) (= (store (store (store |v_#memory_int_50| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0) ULTIMATE.start_main_p3 0) |#memory_int|)) [2019-02-14 16:53:05,599 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)) [2019-02-14 16:53:05,633 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:53:05,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-14 16:53:05,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:53:05,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:53:05,645 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-02-14 16:53:05,655 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:53:05,655 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_51|]. (let ((.cse0 (select |v_#memory_int_51| ULTIMATE.start_main_p2))) (and (= .cse0 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= (store |v_#memory_int_51| ULTIMATE.start_main_p2 (+ .cse0 (- 1))) |#memory_int|) (= (select |v_#memory_int_51| ULTIMATE.start_main_p1) 0))) [2019-02-14 16:53:05,655 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= (- 1) (select |#memory_int| ULTIMATE.start_main_p2))) [2019-02-14 16:53:05,677 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:53:05,678 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:53:05,679 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:53:05,681 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:53:05,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-14 16:53:05,684 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:53:05,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-14 16:53:05,694 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2019-02-14 16:53:07,885 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:53:07,886 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_52|, ULTIMATE.start_main_p1]. (let ((.cse0 (select |v_#memory_int_52| ULTIMATE.start_main_p1))) (and (= (store |v_#memory_int_52| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (= (+ (select |v_#memory_int_52| ULTIMATE.start_main_p2) 1) 0) (= 0 .cse0))) [2019-02-14 16:53:07,886 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p1]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)) [2019-02-14 16:53:07,996 INFO L273 TraceCheckUtils]: 0: Hoare triple {1793#true} havoc main_p1, main_p2, main_p3;malloc_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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {1801#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))} is VALID [2019-02-14 16:53:07,997 INFO L273 TraceCheckUtils]: 1: Hoare triple {1801#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {1805#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1)))} is VALID [2019-02-14 16:53:07,998 INFO L273 TraceCheckUtils]: 2: Hoare triple {1805#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1)))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1809#(and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0))} is VALID [2019-02-14 16:53:07,999 INFO L273 TraceCheckUtils]: 3: Hoare triple {1809#(and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0))} assume #memory_int[main_p1] >= 0; {1809#(and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0))} is VALID [2019-02-14 16:53:08,000 INFO L273 TraceCheckUtils]: 4: Hoare triple {1809#(and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0))} assume !(#memory_int[main_p2] <= 0); {1794#false} is VALID [2019-02-14 16:53:08,001 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:53:08,001 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-14 16:53:08,045 INFO L273 TraceCheckUtils]: 4: Hoare triple {1816#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume !(#memory_int[main_p2] <= 0); {1794#false} is VALID [2019-02-14 16:53:08,047 INFO L273 TraceCheckUtils]: 3: Hoare triple {1816#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume #memory_int[main_p1] >= 0; {1816#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2019-02-14 16:53:08,048 INFO L273 TraceCheckUtils]: 2: Hoare triple {1823#(<= (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {1816#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2019-02-14 16:53:08,049 INFO L273 TraceCheckUtils]: 1: Hoare triple {1827#(<= (select (store (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1 (+ (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) 0)} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {1823#(<= (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) 0)} is VALID [2019-02-14 16:53:08,050 INFO L273 TraceCheckUtils]: 0: Hoare triple {1793#true} havoc main_p1, main_p2, main_p3;malloc_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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {1827#(<= (select (store (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1 (+ (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) 0)} is VALID [2019-02-14 16:53:08,050 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:53:08,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-14 16:53:08,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-14 16:53:08,069 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-14 16:53:08,070 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-14 16:53:08,070 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:53:08,070 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2019-02-14 16:53:08,080 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:53:08,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-14 16:53:08,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-14 16:53:08,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-14 16:53:08,081 INFO L87 Difference]: Start difference. First operand 32 states and 105 transitions. Second operand 8 states. [2019-02-14 16:53:08,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:53:08,589 INFO L93 Difference]: Finished difference Result 45 states and 131 transitions. [2019-02-14 16:53:08,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-14 16:53:08,589 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-14 16:53:08,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:53:08,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-14 16:53:08,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2019-02-14 16:53:08,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-14 16:53:08,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2019-02-14 16:53:08,591 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 32 transitions. [2019-02-14 16:53:08,719 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:53:08,721 INFO L225 Difference]: With dead ends: 45 [2019-02-14 16:53:08,721 INFO L226 Difference]: Without dead ends: 44 [2019-02-14 16:53:08,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-14 16:53:08,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-02-14 16:53:08,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2019-02-14 16:53:08,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:53:08,865 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 36 states. [2019-02-14 16:53:08,866 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 36 states. [2019-02-14 16:53:08,866 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 36 states. [2019-02-14 16:53:08,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:53:08,868 INFO L93 Difference]: Finished difference Result 44 states and 129 transitions. [2019-02-14 16:53:08,868 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 129 transitions. [2019-02-14 16:53:08,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:53:08,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:53:08,869 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 44 states. [2019-02-14 16:53:08,869 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 44 states. [2019-02-14 16:53:08,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:53:08,871 INFO L93 Difference]: Finished difference Result 44 states and 129 transitions. [2019-02-14 16:53:08,871 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 129 transitions. [2019-02-14 16:53:08,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:53:08,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:53:08,872 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:53:08,872 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:53:08,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-02-14 16:53:08,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 120 transitions. [2019-02-14 16:53:08,873 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 120 transitions. Word has length 5 [2019-02-14 16:53:08,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:53:08,874 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 120 transitions. [2019-02-14 16:53:08,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-14 16:53:08,874 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 120 transitions. [2019-02-14 16:53:08,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-14 16:53:08,874 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:53:08,874 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-14 16:53:08,875 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-14 16:53:08,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:53:08,875 INFO L82 PathProgramCache]: Analyzing trace with hash 28939106, now seen corresponding path program 1 times [2019-02-14 16:53:08,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:53:08,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:53:08,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:53:08,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:53:08,876 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:53:08,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:53:08,947 INFO L273 TraceCheckUtils]: 0: Hoare triple {2060#true} havoc main_p1, main_p2, main_p3;malloc_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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {2062#(and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) (= (select |#memory_int| ULTIMATE.start_main_p2) 0))} is VALID [2019-02-14 16:53:08,948 INFO L273 TraceCheckUtils]: 1: Hoare triple {2062#(and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) (= (select |#memory_int| ULTIMATE.start_main_p2) 0))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {2063#(and (<= (+ (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p2) 1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)))} is VALID [2019-02-14 16:53:08,949 INFO L273 TraceCheckUtils]: 2: Hoare triple {2063#(and (<= (+ (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p2) 1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)))} #memory_int := #memory_int[main_p3 := #memory_int[main_p3] + 1]; {2064#(<= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)} is VALID [2019-02-14 16:53:08,949 INFO L273 TraceCheckUtils]: 3: Hoare triple {2064#(<= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)} assume #memory_int[main_p1] >= 0; {2064#(<= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)} is VALID [2019-02-14 16:53:08,950 INFO L273 TraceCheckUtils]: 4: Hoare triple {2064#(<= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)} assume !(#memory_int[main_p2] <= 0); {2061#false} is VALID [2019-02-14 16:53:08,950 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:53:08,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:53:08,950 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-14 16:53:08,951 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-14 16:53:08,951 INFO L207 CegarAbsIntRunner]: [0], [10], [12], [16], [17] [2019-02-14 16:53:08,952 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-14 16:53:08,952 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-14 16:53:13,544 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-14 16:53:13,545 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-14 16:53:13,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:53:13,545 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-14 16:53:13,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:53:13,546 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-14 16:53:13,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:53:13,556 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-14 16:53:13,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:53:13,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:53:13,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-14 16:53:13,593 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 12 treesize of output 15 [2019-02-14 16:53:13,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2019-02-14 16:53:13,616 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:53:13,617 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:53:13,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2019-02-14 16:53:13,624 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:53:13,634 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:53:13,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:53:13,651 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 11 treesize of output 14 [2019-02-14 16:53:13,671 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:53:13,672 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:53:13,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-02-14 16:53:13,675 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:53:13,682 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:53:13,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-14 16:53:13,693 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:24, output treesize:24 [2019-02-14 16:53:13,697 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:53:13,697 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_55|, ULTIMATE.start_main_p1, |v_#valid_14|]. (and (= 0 (select (store (store |v_#valid_14| ULTIMATE.start_main_p1 1) ULTIMATE.start_main_p2 1) ULTIMATE.start_main_p3)) (= (store (store (store |v_#memory_int_55| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0) ULTIMATE.start_main_p3 0) |#memory_int|)) [2019-02-14 16:53:13,697 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p1]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 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)) [2019-02-14 16:53:13,731 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:53:13,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-02-14 16:53:13,734 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:53:13,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:53:13,740 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-02-14 16:53:13,751 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:53:13,752 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_56|]. (let ((.cse0 (select |v_#memory_int_56| ULTIMATE.start_main_p2))) (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (select |v_#memory_int_56| ULTIMATE.start_main_p3) 0) (= .cse0 0) (= (store |v_#memory_int_56| ULTIMATE.start_main_p2 (+ .cse0 (- 1))) |#memory_int|))) [2019-02-14 16:53:13,752 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (- 1) (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)) [2019-02-14 16:53:13,771 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:53:13,772 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:53:13,774 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:53:13,775 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:53:13,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-14 16:53:13,778 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:53:13,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-14 16:53:13,788 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2019-02-14 16:53:15,920 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:53:15,920 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_57|, ULTIMATE.start_main_p3]. (let ((.cse0 (select |v_#memory_int_57| ULTIMATE.start_main_p3))) (and (= .cse0 0) (= (store |v_#memory_int_57| ULTIMATE.start_main_p3 (+ .cse0 1)) |#memory_int|) (= 0 (+ (select |v_#memory_int_57| ULTIMATE.start_main_p2) 1)))) [2019-02-14 16:53:15,920 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3]. (and (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)) [2019-02-14 16:53:15,999 INFO L273 TraceCheckUtils]: 0: Hoare triple {2060#true} havoc main_p1, main_p2, main_p3;malloc_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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {2068#(and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} is VALID [2019-02-14 16:53:16,000 INFO L273 TraceCheckUtils]: 1: Hoare triple {2068#(and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {2072#(and (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} is VALID [2019-02-14 16:53:16,001 INFO L273 TraceCheckUtils]: 2: Hoare triple {2072#(and (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} #memory_int := #memory_int[main_p3 := #memory_int[main_p3] + 1]; {2076#(and (exists ((ULTIMATE.start_main_p3 Int)) (= (select |#memory_int| ULTIMATE.start_main_p3) 1)) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0))} is VALID [2019-02-14 16:53:16,001 INFO L273 TraceCheckUtils]: 3: Hoare triple {2076#(and (exists ((ULTIMATE.start_main_p3 Int)) (= (select |#memory_int| ULTIMATE.start_main_p3) 1)) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0))} assume #memory_int[main_p1] >= 0; {2076#(and (exists ((ULTIMATE.start_main_p3 Int)) (= (select |#memory_int| ULTIMATE.start_main_p3) 1)) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0))} is VALID [2019-02-14 16:53:16,002 INFO L273 TraceCheckUtils]: 4: Hoare triple {2076#(and (exists ((ULTIMATE.start_main_p3 Int)) (= (select |#memory_int| ULTIMATE.start_main_p3) 1)) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0))} assume !(#memory_int[main_p2] <= 0); {2061#false} is VALID [2019-02-14 16:53:16,002 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:53:16,003 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-14 16:53:16,038 INFO L273 TraceCheckUtils]: 4: Hoare triple {2083#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume !(#memory_int[main_p2] <= 0); {2061#false} is VALID [2019-02-14 16:53:16,039 INFO L273 TraceCheckUtils]: 3: Hoare triple {2083#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume #memory_int[main_p1] >= 0; {2083#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2019-02-14 16:53:16,040 INFO L273 TraceCheckUtils]: 2: Hoare triple {2090#(<= (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p2) 0)} #memory_int := #memory_int[main_p3 := #memory_int[main_p3] + 1]; {2083#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2019-02-14 16:53:16,041 INFO L273 TraceCheckUtils]: 1: Hoare triple {2094#(<= (select (store (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p3 (+ (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p2) 0)} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {2090#(<= (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p2) 0)} is VALID [2019-02-14 16:53:16,043 INFO L273 TraceCheckUtils]: 0: Hoare triple {2060#true} havoc main_p1, main_p2, main_p3;malloc_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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {2094#(<= (select (store (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p3 (+ (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p2) 0)} is VALID [2019-02-14 16:53:16,043 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:53:16,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-14 16:53:16,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-14 16:53:16,064 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-14 16:53:16,064 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-14 16:53:16,064 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:53:16,064 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2019-02-14 16:53:16,075 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:53:16,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-14 16:53:16,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-14 16:53:16,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-14 16:53:16,076 INFO L87 Difference]: Start difference. First operand 36 states and 120 transitions. Second operand 8 states. [2019-02-14 16:53:16,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:53:16,530 INFO L93 Difference]: Finished difference Result 52 states and 158 transitions. [2019-02-14 16:53:16,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-14 16:53:16,531 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-14 16:53:16,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:53:16,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-14 16:53:16,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2019-02-14 16:53:16,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-14 16:53:16,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2019-02-14 16:53:16,532 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 33 transitions. [2019-02-14 16:53:16,602 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:53:16,604 INFO L225 Difference]: With dead ends: 52 [2019-02-14 16:53:16,604 INFO L226 Difference]: Without dead ends: 51 [2019-02-14 16:53:16,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-14 16:53:16,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-02-14 16:53:16,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 43. [2019-02-14 16:53:16,784 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:53:16,784 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 43 states. [2019-02-14 16:53:16,784 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 43 states. [2019-02-14 16:53:16,785 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 43 states. [2019-02-14 16:53:16,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:53:16,787 INFO L93 Difference]: Finished difference Result 51 states and 156 transitions. [2019-02-14 16:53:16,787 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 156 transitions. [2019-02-14 16:53:16,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:53:16,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:53:16,788 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 51 states. [2019-02-14 16:53:16,788 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 51 states. [2019-02-14 16:53:16,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:53:16,790 INFO L93 Difference]: Finished difference Result 51 states and 156 transitions. [2019-02-14 16:53:16,790 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 156 transitions. [2019-02-14 16:53:16,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:53:16,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:53:16,790 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:53:16,790 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:53:16,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-02-14 16:53:16,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 151 transitions. [2019-02-14 16:53:16,792 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 151 transitions. Word has length 5 [2019-02-14 16:53:16,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:53:16,792 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 151 transitions. [2019-02-14 16:53:16,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-14 16:53:16,793 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 151 transitions. [2019-02-14 16:53:16,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-14 16:53:16,793 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:53:16,793 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-14 16:53:16,793 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-14 16:53:16,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:53:16,794 INFO L82 PathProgramCache]: Analyzing trace with hash 28992734, now seen corresponding path program 1 times [2019-02-14 16:53:16,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:53:16,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:53:16,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:53:16,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:53:16,795 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:53:16,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:53:16,973 INFO L273 TraceCheckUtils]: 0: Hoare triple {2368#true} havoc main_p1, main_p2, main_p3;malloc_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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {2370#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (or (= 0 (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p1)) (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3)))} is VALID [2019-02-14 16:53:16,974 INFO L273 TraceCheckUtils]: 1: Hoare triple {2370#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0) (or (= 0 (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p1)) (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3)))} #memory_int := #memory_int[main_p3 := #memory_int[main_p3] + 1]; {2371#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (<= 0 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)))} is VALID [2019-02-14 16:53:16,976 INFO L273 TraceCheckUtils]: 2: Hoare triple {2371#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (<= 0 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2372#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (<= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1)))} is VALID [2019-02-14 16:53:16,977 INFO L273 TraceCheckUtils]: 3: Hoare triple {2372#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (<= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1)))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {2373#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2019-02-14 16:53:16,977 INFO L273 TraceCheckUtils]: 4: Hoare triple {2373#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {2369#false} is VALID [2019-02-14 16:53:16,978 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:53:16,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:53:16,978 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-14 16:53:16,979 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-14 16:53:16,979 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [12], [15] [2019-02-14 16:53:16,983 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-14 16:53:16,983 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-14 16:53:23,420 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-14 16:53:23,420 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-14 16:53:23,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:53:23,420 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-14 16:53:23,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:53:23,421 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-14 16:53:23,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:53:23,432 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-14 16:53:23,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:53:23,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:53:23,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-14 16:53:23,495 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:53:23,496 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 17 treesize of output 29 [2019-02-14 16:53:23,531 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:53:23,533 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:53:23,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-14 16:53:23,536 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:53:23,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:53:23,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 12 treesize of output 15 [2019-02-14 16:53:23,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 15 treesize of output 21 [2019-02-14 16:53:23,568 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-02-14 16:53:23,570 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:53:23,580 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:53:23,587 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:53:23,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:53:23,600 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-02-14 16:53:23,605 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:53:23,605 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_60|, |v_#valid_15|]. (let ((.cse0 (store |v_#valid_15| ULTIMATE.start_main_p1 1))) (and (= 0 (select .cse0 ULTIMATE.start_main_p2)) (= (store (store (store |v_#memory_int_60| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0) ULTIMATE.start_main_p3 0) |#memory_int|) (= 0 (select (store .cse0 ULTIMATE.start_main_p2 1) ULTIMATE.start_main_p3)))) [2019-02-14 16:53:23,605 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ []. (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)) (= 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)) [2019-02-14 16:53:23,647 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:53:23,648 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-02-14 16:53:23,651 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:53:23,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-14 16:53:23,665 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-14 16:53:25,904 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:53:25,904 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_61|, ULTIMATE.start_main_p3]. (let ((.cse0 (select |v_#memory_int_61| ULTIMATE.start_main_p3))) (and (= |#memory_int| (store |v_#memory_int_61| ULTIMATE.start_main_p3 (+ .cse0 1))) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select |v_#memory_int_61| ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= 0 .cse0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (select |v_#memory_int_61| ULTIMATE.start_main_p2) 0))) [2019-02-14 16:53:25,904 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (= 0 (select |#memory_int| ULTIMATE.start_main_p2))) [2019-02-14 16:53:26,052 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:53:26,054 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:53:26,055 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:53:26,056 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:53:26,057 INFO L683 Elim1Store]: detected equality via solver [2019-02-14 16:53:26,058 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-02-14 16:53:26,060 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:53:26,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-14 16:53:26,074 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:20 [2019-02-14 16:53:26,085 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:53:26,085 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_62|, ULTIMATE.start_main_p3]. (let ((.cse0 (select |v_#memory_int_62| ULTIMATE.start_main_p1))) (and (= (select |v_#memory_int_62| ULTIMATE.start_main_p3) 1) (= 0 .cse0) (= |#memory_int| (store |v_#memory_int_62| ULTIMATE.start_main_p1 (+ .cse0 1))) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= (select |v_#memory_int_62| ULTIMATE.start_main_p2) 0))) [2019-02-14 16:53:26,086 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p3]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1))) [2019-02-14 16:53:26,130 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:53:26,131 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:53:26,134 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:53:26,135 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:53:26,136 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:53:26,137 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-14 16:53:26,141 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:53:26,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-14 16:53:26,156 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2019-02-14 16:53:28,369 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:53:28,369 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_63|, ULTIMATE.start_main_p2, ULTIMATE.start_main_p3]. (let ((.cse0 (select |v_#memory_int_63| ULTIMATE.start_main_p2))) (and (= (select |v_#memory_int_63| ULTIMATE.start_main_p1) 1) (= (select |v_#memory_int_63| ULTIMATE.start_main_p3) 1) (= (store |v_#memory_int_63| ULTIMATE.start_main_p2 (+ .cse0 (- 1))) |#memory_int|) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= .cse0 0))) [2019-02-14 16:53:28,370 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p2, ULTIMATE.start_main_p3]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= (- 1) (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1))) [2019-02-14 16:53:28,489 INFO L273 TraceCheckUtils]: 0: Hoare triple {2368#true} havoc main_p1, main_p2, main_p3;malloc_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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {2377#(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)) (= 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))} is VALID [2019-02-14 16:53:28,491 INFO L273 TraceCheckUtils]: 1: Hoare triple {2377#(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)) (= 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))} #memory_int := #memory_int[main_p3 := #memory_int[main_p3] + 1]; {2381#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (exists ((ULTIMATE.start_main_p3 Int)) (= (select |#memory_int| ULTIMATE.start_main_p3) 1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))} is VALID [2019-02-14 16:53:28,492 INFO L273 TraceCheckUtils]: 2: Hoare triple {2381#(and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (exists ((ULTIMATE.start_main_p3 Int)) (= (select |#memory_int| ULTIMATE.start_main_p3) 1)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2385#(and (exists ((ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)))) (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))} is VALID [2019-02-14 16:53:28,494 INFO L273 TraceCheckUtils]: 3: Hoare triple {2385#(and (exists ((ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)))) (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {2389#(and (exists ((ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)))) (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (exists ((ULTIMATE.start_main_p2 Int)) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1))))} is VALID [2019-02-14 16:53:28,495 INFO L273 TraceCheckUtils]: 4: Hoare triple {2389#(and (exists ((ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)))) (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (exists ((ULTIMATE.start_main_p2 Int)) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1))))} assume !(#memory_int[main_p1] >= 0); {2369#false} is VALID [2019-02-14 16:53:28,495 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:53:28,495 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-14 16:53:28,552 INFO L273 TraceCheckUtils]: 4: Hoare triple {2373#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} assume !(#memory_int[main_p1] >= 0); {2369#false} is VALID [2019-02-14 16:53:28,553 INFO L273 TraceCheckUtils]: 3: Hoare triple {2396#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {2373#(<= 0 (select |#memory_int| ULTIMATE.start_main_p1))} is VALID [2019-02-14 16:53:28,562 INFO L273 TraceCheckUtils]: 2: Hoare triple {2400#(<= 0 (select (store (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2 (+ (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2396#(<= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))} is VALID [2019-02-14 16:53:28,563 INFO L273 TraceCheckUtils]: 1: Hoare triple {2404#(<= 0 (select (store (store (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p1 (+ (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2 (+ (select (store (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p1 (+ (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))} #memory_int := #memory_int[main_p3 := #memory_int[main_p3] + 1]; {2400#(<= 0 (select (store (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2 (+ (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))} is VALID [2019-02-14 16:53:28,564 INFO L273 TraceCheckUtils]: 0: Hoare triple {2368#true} havoc main_p1, main_p2, main_p3;malloc_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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {2404#(<= 0 (select (store (store (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p1 (+ (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2 (+ (select (store (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p1 (+ (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))} is VALID [2019-02-14 16:53:28,565 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:53:28,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-14 16:53:28,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-14 16:53:28,583 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-14 16:53:28,584 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-14 16:53:28,584 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:53:28,584 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2019-02-14 16:53:28,598 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:53:28,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-14 16:53:28,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-14 16:53:28,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-02-14 16:53:28,599 INFO L87 Difference]: Start difference. First operand 43 states and 151 transitions. Second operand 10 states. [2019-02-14 16:53:29,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:53:29,276 INFO L93 Difference]: Finished difference Result 49 states and 162 transitions. [2019-02-14 16:53:29,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-14 16:53:29,276 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-14 16:53:29,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:53:29,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-14 16:53:29,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2019-02-14 16:53:29,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-14 16:53:29,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2019-02-14 16:53:29,277 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 29 transitions. [2019-02-14 16:53:29,660 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:53:29,661 INFO L225 Difference]: With dead ends: 49 [2019-02-14 16:53:29,661 INFO L226 Difference]: Without dead ends: 48 [2019-02-14 16:53:29,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=108, Unknown=0, NotChecked=0, Total=182 [2019-02-14 16:53:29,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-02-14 16:53:29,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 23. [2019-02-14 16:53:29,826 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:53:29,826 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 23 states. [2019-02-14 16:53:29,826 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 23 states. [2019-02-14 16:53:29,826 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 23 states. [2019-02-14 16:53:29,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:53:29,828 INFO L93 Difference]: Finished difference Result 48 states and 151 transitions. [2019-02-14 16:53:29,828 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 151 transitions. [2019-02-14 16:53:29,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:53:29,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:53:29,828 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 48 states. [2019-02-14 16:53:29,828 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 48 states. [2019-02-14 16:53:29,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:53:29,830 INFO L93 Difference]: Finished difference Result 48 states and 151 transitions. [2019-02-14 16:53:29,830 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 151 transitions. [2019-02-14 16:53:29,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:53:29,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:53:29,831 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:53:29,831 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:53:29,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-02-14 16:53:29,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 66 transitions. [2019-02-14 16:53:29,832 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 66 transitions. Word has length 5 [2019-02-14 16:53:29,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:53:29,832 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 66 transitions. [2019-02-14 16:53:29,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-14 16:53:29,832 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 66 transitions. [2019-02-14 16:53:29,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-14 16:53:29,832 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:53:29,833 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-14 16:53:29,833 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-14 16:53:29,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:53:29,833 INFO L82 PathProgramCache]: Analyzing trace with hash 893358670, now seen corresponding path program 1 times [2019-02-14 16:53:29,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:53:29,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:53:29,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:53:29,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:53:29,834 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:53:29,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:53:30,111 INFO L273 TraceCheckUtils]: 0: Hoare triple {2632#true} havoc main_p1, main_p2, main_p3;malloc_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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {2634#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2)) (or (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3))) (or (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p3)) (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3)))} is VALID [2019-02-14 16:53:30,113 INFO L273 TraceCheckUtils]: 1: Hoare triple {2634#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2)) (or (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3))) (or (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p3)) (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3)))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2635#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (or (= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p3)) (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3)) (= (select |#memory_int| ULTIMATE.start_main_p2) 0) (or (<= 1 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3))))} is VALID [2019-02-14 16:53:30,114 INFO L273 TraceCheckUtils]: 2: Hoare triple {2635#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (or (= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p3)) (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3)) (= (select |#memory_int| ULTIMATE.start_main_p2) 0) (or (<= 1 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3))))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {2636#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (or (<= 1 (select |#memory_int| ULTIMATE.start_main_p3)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3))) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (or (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)))} is VALID [2019-02-14 16:53:30,115 INFO L273 TraceCheckUtils]: 3: Hoare triple {2636#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (or (<= 1 (select |#memory_int| ULTIMATE.start_main_p3)) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3))) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (or (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)))} assume #memory_int[main_p1] >= 0; {2637#(and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (or (<= 1 (select |#memory_int| ULTIMATE.start_main_p3)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)))} is VALID [2019-02-14 16:53:30,116 INFO L273 TraceCheckUtils]: 4: Hoare triple {2637#(and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (or (<= 1 (select |#memory_int| ULTIMATE.start_main_p3)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)))} assume #memory_int[main_p2] <= 0; {2638#(or (<= 1 (select |#memory_int| ULTIMATE.start_main_p3)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} is VALID [2019-02-14 16:53:30,117 INFO L273 TraceCheckUtils]: 5: Hoare triple {2638#(or (<= 1 (select |#memory_int| ULTIMATE.start_main_p3)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} assume !(#memory_int[main_p3] >= 0); {2633#false} is VALID [2019-02-14 16:53:30,117 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:53:30,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:53:30,118 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-14 16:53:30,118 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-14 16:53:30,118 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [18], [19] [2019-02-14 16:53:30,124 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-14 16:53:30,124 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-14 16:53:34,685 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-14 16:53:34,686 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-14 16:53:34,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:53:34,686 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-14 16:53:34,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:53:34,686 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-14 16:53:34,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:53:34,698 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-14 16:53:34,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:53:34,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:53:34,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-14 16:53:34,726 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 12 treesize of output 15 [2019-02-14 16:53:34,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2019-02-14 16:53:34,745 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:53:34,746 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:53:34,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2019-02-14 16:53:34,748 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:53:34,757 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:53:34,763 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:53:34,775 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 11 treesize of output 14 [2019-02-14 16:53:34,791 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:53:34,792 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:53:34,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-02-14 16:53:34,795 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:53:34,799 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:53:34,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:53:34,810 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:24, output treesize:24 [2019-02-14 16:53:34,814 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:53:34,815 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_67|, |v_#valid_16|]. (and (= (store (store (store |v_#memory_int_67| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0) ULTIMATE.start_main_p3 0) |#memory_int|) (= (select (store (store |v_#valid_16| ULTIMATE.start_main_p1 1) ULTIMATE.start_main_p2 1) ULTIMATE.start_main_p3) 0)) [2019-02-14 16:53:34,815 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 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)) [2019-02-14 16:53:34,858 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:53:34,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 28 [2019-02-14 16:53:34,870 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-14 16:53:34,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-02-14 16:53:34,903 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-02-14 16:53:34,925 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:53:34,926 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_68|, ULTIMATE.start_main_p1]. (let ((.cse0 (select |v_#memory_int_68| ULTIMATE.start_main_p1))) (and (= (select |v_#memory_int_68| ULTIMATE.start_main_p2) 0) (= (store |v_#memory_int_68| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (select |v_#memory_int_68| ULTIMATE.start_main_p3) 0) (= .cse0 0) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)))) [2019-02-14 16:53:34,926 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p1]. (let ((.cse0 (select |#memory_int| ULTIMATE.start_main_p2)) (.cse1 (= (select |#memory_int| ULTIMATE.start_main_p3) 0))) (or (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 .cse0) .cse1) (and (= 1 .cse0) .cse1))) [2019-02-14 16:53:34,986 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:53:34,986 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:53:34,987 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:53:34,988 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:53:34,988 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:53:34,989 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 40 [2019-02-14 16:53:34,992 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:53:35,020 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:53:35,021 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:53:35,022 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:53:35,022 INFO L683 Elim1Store]: detected equality via solver [2019-02-14 16:53:35,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-14 16:53:35,026 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:53:35,045 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 2 xjuncts. [2019-02-14 16:53:35,045 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:32 [2019-02-14 16:53:37,123 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:53:37,124 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_prenex_1, v_prenex_2, ULTIMATE.start_main_p1, |v_#memory_int_69|, ULTIMATE.start_main_p2]. (or (let ((.cse0 (select |v_#memory_int_69| ULTIMATE.start_main_p2))) (and (= (select |v_#memory_int_69| ULTIMATE.start_main_p3) 0) (= (store |v_#memory_int_69| ULTIMATE.start_main_p2 (+ .cse0 (- 1))) |#memory_int|) (= .cse0 1))) (let ((.cse1 (select v_prenex_1 v_prenex_2))) (and (not (= ULTIMATE.start_main_p3 v_prenex_2)) (= .cse1 0) (= (store v_prenex_1 v_prenex_2 (+ .cse1 (- 1))) |#memory_int|) (= (select v_prenex_1 ULTIMATE.start_main_p3) 0) (= (select v_prenex_1 ULTIMATE.start_main_p1) 1)))) [2019-02-14 16:53:37,124 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p1, v_prenex_2, ULTIMATE.start_main_p2]. (let ((.cse0 (= (select |#memory_int| ULTIMATE.start_main_p3) 0))) (or (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) .cse0 (= (select |#memory_int| v_prenex_2) (- 1))) (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) .cse0))) [2019-02-14 16:53:37,243 INFO L273 TraceCheckUtils]: 0: Hoare triple {2632#true} havoc main_p1, main_p2, main_p3;malloc_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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {2642#(and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 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))} is VALID [2019-02-14 16:53:37,248 INFO L273 TraceCheckUtils]: 1: Hoare triple {2642#(and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= 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))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2646#(or (and (= 1 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)) (and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)))} is VALID [2019-02-14 16:53:37,250 INFO L273 TraceCheckUtils]: 2: Hoare triple {2646#(or (and (= 1 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)) (and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {2650#(or (and (exists ((ULTIMATE.start_main_p2 Int)) (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)) (and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (exists ((v_prenex_2 Int)) (= (+ (select |#memory_int| v_prenex_2) 1) 0)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)))} is VALID [2019-02-14 16:53:37,250 INFO L273 TraceCheckUtils]: 3: Hoare triple {2650#(or (and (exists ((ULTIMATE.start_main_p2 Int)) (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)) (and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (exists ((v_prenex_2 Int)) (= (+ (select |#memory_int| v_prenex_2) 1) 0)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)))} assume #memory_int[main_p1] >= 0; {2650#(or (and (exists ((ULTIMATE.start_main_p2 Int)) (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)) (and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (exists ((v_prenex_2 Int)) (= (+ (select |#memory_int| v_prenex_2) 1) 0)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)))} is VALID [2019-02-14 16:53:37,251 INFO L273 TraceCheckUtils]: 4: Hoare triple {2650#(or (and (exists ((ULTIMATE.start_main_p2 Int)) (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)) (and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (exists ((v_prenex_2 Int)) (= (+ (select |#memory_int| v_prenex_2) 1) 0)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)))} assume #memory_int[main_p2] <= 0; {2650#(or (and (exists ((ULTIMATE.start_main_p2 Int)) (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)) (and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (exists ((v_prenex_2 Int)) (= (+ (select |#memory_int| v_prenex_2) 1) 0)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)))} is VALID [2019-02-14 16:53:37,251 INFO L273 TraceCheckUtils]: 5: Hoare triple {2650#(or (and (exists ((ULTIMATE.start_main_p2 Int)) (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)))) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)) (and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (exists ((v_prenex_2 Int)) (= (+ (select |#memory_int| v_prenex_2) 1) 0)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)))} assume !(#memory_int[main_p3] >= 0); {2633#false} is VALID [2019-02-14 16:53:37,252 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:53:37,252 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-14 16:53:37,348 INFO L273 TraceCheckUtils]: 5: Hoare triple {2638#(or (<= 1 (select |#memory_int| ULTIMATE.start_main_p3)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} assume !(#memory_int[main_p3] >= 0); {2633#false} is VALID [2019-02-14 16:53:37,349 INFO L273 TraceCheckUtils]: 4: Hoare triple {2638#(or (<= 1 (select |#memory_int| ULTIMATE.start_main_p3)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} assume #memory_int[main_p2] <= 0; {2638#(or (<= 1 (select |#memory_int| ULTIMATE.start_main_p3)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} is VALID [2019-02-14 16:53:37,349 INFO L273 TraceCheckUtils]: 3: Hoare triple {2638#(or (<= 1 (select |#memory_int| ULTIMATE.start_main_p3)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} assume #memory_int[main_p1] >= 0; {2638#(or (<= 1 (select |#memory_int| ULTIMATE.start_main_p3)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} is VALID [2019-02-14 16:53:37,351 INFO L273 TraceCheckUtils]: 2: Hoare triple {2669#(or (<= 1 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p3)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p3)))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {2638#(or (<= 1 (select |#memory_int| ULTIMATE.start_main_p3)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} is VALID [2019-02-14 16:53:37,352 INFO L273 TraceCheckUtils]: 1: Hoare triple {2673#(or (<= 1 (select (store (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2 (+ (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p3)) (= 0 (select (store (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2 (+ (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p3)))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2669#(or (<= 1 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p3)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p3)))} is VALID [2019-02-14 16:53:37,354 INFO L273 TraceCheckUtils]: 0: Hoare triple {2632#true} havoc main_p1, main_p2, main_p3;malloc_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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {2673#(or (<= 1 (select (store (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2 (+ (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p3)) (= 0 (select (store (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2 (+ (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p3)))} is VALID [2019-02-14 16:53:37,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:53:37,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-14 16:53:37,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2019-02-14 16:53:37,375 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-14 16:53:37,375 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-14 16:53:37,375 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:53:37,376 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2019-02-14 16:53:37,395 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:53:37,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-14 16:53:37,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-14 16:53:37,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-02-14 16:53:37,396 INFO L87 Difference]: Start difference. First operand 23 states and 66 transitions. Second operand 10 states. [2019-02-14 16:53:38,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:53:38,174 INFO L93 Difference]: Finished difference Result 28 states and 74 transitions. [2019-02-14 16:53:38,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-14 16:53:38,174 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-14 16:53:38,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:53:38,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-14 16:53:38,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2019-02-14 16:53:38,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-14 16:53:38,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2019-02-14 16:53:38,176 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 29 transitions. [2019-02-14 16:53:38,567 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:53:38,568 INFO L225 Difference]: With dead ends: 28 [2019-02-14 16:53:38,568 INFO L226 Difference]: Without dead ends: 21 [2019-02-14 16:53:38,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2019-02-14 16:53:38,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-02-14 16:53:38,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2019-02-14 16:53:38,825 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:53:38,825 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 19 states. [2019-02-14 16:53:38,826 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 19 states. [2019-02-14 16:53:38,826 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 19 states. [2019-02-14 16:53:38,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:53:38,827 INFO L93 Difference]: Finished difference Result 21 states and 58 transitions. [2019-02-14 16:53:38,827 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 58 transitions. [2019-02-14 16:53:38,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:53:38,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:53:38,828 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 21 states. [2019-02-14 16:53:38,828 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 21 states. [2019-02-14 16:53:38,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:53:38,828 INFO L93 Difference]: Finished difference Result 21 states and 58 transitions. [2019-02-14 16:53:38,828 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 58 transitions. [2019-02-14 16:53:38,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:53:38,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:53:38,829 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:53:38,829 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:53:38,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-02-14 16:53:38,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 52 transitions. [2019-02-14 16:53:38,829 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 52 transitions. Word has length 6 [2019-02-14 16:53:38,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:53:38,830 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 52 transitions. [2019-02-14 16:53:38,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-14 16:53:38,830 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 52 transitions. [2019-02-14 16:53:38,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-14 16:53:38,830 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:53:38,830 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-14 16:53:38,830 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-14 16:53:38,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:53:38,831 INFO L82 PathProgramCache]: Analyzing trace with hash 893354762, now seen corresponding path program 1 times [2019-02-14 16:53:38,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:53:38,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:53:38,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:53:38,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:53:38,832 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:53:38,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:53:38,970 INFO L273 TraceCheckUtils]: 0: Hoare triple {2807#true} havoc main_p1, main_p2, main_p3;malloc_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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {2809#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2)))} is VALID [2019-02-14 16:53:38,972 INFO L273 TraceCheckUtils]: 1: Hoare triple {2809#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2)))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2809#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2)))} is VALID [2019-02-14 16:53:38,973 INFO L273 TraceCheckUtils]: 2: Hoare triple {2809#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2)))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {2810#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (<= (+ (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p2) 1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)))} is VALID [2019-02-14 16:53:38,974 INFO L273 TraceCheckUtils]: 3: Hoare triple {2810#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (<= (+ (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p2) 1) 0) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)))} #memory_int := #memory_int[main_p3 := #memory_int[main_p3] + 1]; {2811#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (<= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0))} is VALID [2019-02-14 16:53:38,975 INFO L273 TraceCheckUtils]: 4: Hoare triple {2811#(and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (<= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0))} assume #memory_int[main_p1] >= 0; {2812#(<= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)} is VALID [2019-02-14 16:53:38,976 INFO L273 TraceCheckUtils]: 5: Hoare triple {2812#(<= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)} assume !(#memory_int[main_p2] <= 0); {2808#false} is VALID [2019-02-14 16:53:38,976 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-14 16:53:38,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:53:38,977 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-14 16:53:38,977 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-14 16:53:38,977 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [12], [16], [17] [2019-02-14 16:53:38,978 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-14 16:53:38,979 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-14 16:53:46,440 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-14 16:53:46,440 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-14 16:53:46,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:53:46,441 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-14 16:53:46,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:53:46,441 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-14 16:53:46,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:53:46,450 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-14 16:53:46,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:53:46,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:53:46,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-14 16:53:46,488 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:53:46,489 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 17 treesize of output 29 [2019-02-14 16:53:46,525 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:53:46,526 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:53:46,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-02-14 16:53:46,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:53:46,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:53:46,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 12 treesize of output 15 [2019-02-14 16:53:46,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 15 treesize of output 21 [2019-02-14 16:53:46,564 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2019-02-14 16:53:46,567 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:53:46,578 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:53:46,586 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:53:46,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:53:46,598 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-02-14 16:53:46,603 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:53:46,603 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_72|, |v_#valid_17|]. (let ((.cse0 (store |v_#valid_17| ULTIMATE.start_main_p1 1))) (and (= |#memory_int| (store (store (store |v_#memory_int_72| ULTIMATE.start_main_p1 0) ULTIMATE.start_main_p2 0) ULTIMATE.start_main_p3 0)) (= 0 (select (store .cse0 ULTIMATE.start_main_p2 1) ULTIMATE.start_main_p3)) (= 0 (select .cse0 ULTIMATE.start_main_p2)))) [2019-02-14 16:53:46,603 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ []. (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)) (= 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)) [2019-02-14 16:53:46,649 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:53:46,650 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-14 16:53:46,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:53:46,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-14 16:53:46,665 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-14 16:53:48,731 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:53:48,732 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_73|, ULTIMATE.start_main_p1]. (let ((.cse0 (select |v_#memory_int_73| ULTIMATE.start_main_p1))) (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (store |v_#memory_int_73| ULTIMATE.start_main_p1 (+ .cse0 1)) |#memory_int|) (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)) (= .cse0 0) (= (select |v_#memory_int_73| ULTIMATE.start_main_p2) 0) (= 0 (select |v_#memory_int_73| ULTIMATE.start_main_p3)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)))) [2019-02-14 16:53:48,732 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p1]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)) [2019-02-14 16:53:48,774 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:53:48,775 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:53:48,776 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:53:48,777 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:53:48,778 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:53:48,779 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-14 16:53:48,782 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:53:48,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-14 16:53:48,797 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:16 [2019-02-14 16:53:48,809 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:53:48,809 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_74|, ULTIMATE.start_main_p1]. (let ((.cse0 (select |v_#memory_int_74| ULTIMATE.start_main_p2))) (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= (select |v_#memory_int_74| ULTIMATE.start_main_p1) 1) (= (store |v_#memory_int_74| ULTIMATE.start_main_p2 (+ .cse0 (- 1))) |#memory_int|) (= .cse0 0) (= (select |v_#memory_int_74| ULTIMATE.start_main_p3) 0))) [2019-02-14 16:53:48,810 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p1]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= (- 1) (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)) [2019-02-14 16:53:48,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:53:48,844 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:53:48,844 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:53:48,845 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:53:48,847 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:53:48,847 INFO L683 Elim1Store]: detected equality via solver [2019-02-14 16:53:48,848 INFO L701 Elim1Store]: detected not equals via solver [2019-02-14 16:53:48,849 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-14 16:53:48,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:53:48,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-14 16:53:48,868 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:22 [2019-02-14 16:53:48,901 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:53:48,901 WARN L398 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_75|, ULTIMATE.start_main_p3, ULTIMATE.start_main_p1]. (let ((.cse0 (select |v_#memory_int_75| ULTIMATE.start_main_p3))) (and (= (select |v_#memory_int_75| ULTIMATE.start_main_p1) 1) (= |#memory_int| (store |v_#memory_int_75| ULTIMATE.start_main_p3 (+ .cse0 1))) (= .cse0 0) (= 0 (+ (select |v_#memory_int_75| ULTIMATE.start_main_p2) 1)))) [2019-02-14 16:53:48,901 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_p1, ULTIMATE.start_main_p3]. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)) (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0)) [2019-02-14 16:53:48,935 INFO L273 TraceCheckUtils]: 0: Hoare triple {2807#true} havoc main_p1, main_p2, main_p3;malloc_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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {2816#(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)) (= 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))} is VALID [2019-02-14 16:53:48,937 INFO L273 TraceCheckUtils]: 1: Hoare triple {2816#(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)) (= 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))} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2820#(and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} is VALID [2019-02-14 16:53:48,938 INFO L273 TraceCheckUtils]: 2: Hoare triple {2820#(and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2)) (= 0 (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {2824#(and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} is VALID [2019-02-14 16:53:48,940 INFO L273 TraceCheckUtils]: 3: Hoare triple {2824#(and (exists ((ULTIMATE.start_main_p1 Int)) (= (select |#memory_int| ULTIMATE.start_main_p1) 1)) (= 0 (+ (select |#memory_int| ULTIMATE.start_main_p2) 1)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0))} #memory_int := #memory_int[main_p3 := #memory_int[main_p3] + 1]; {2828#(and (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0) (exists ((ULTIMATE.start_main_p1 Int) (ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)))))} is VALID [2019-02-14 16:53:48,941 INFO L273 TraceCheckUtils]: 4: Hoare triple {2828#(and (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0) (exists ((ULTIMATE.start_main_p1 Int) (ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)))))} assume #memory_int[main_p1] >= 0; {2828#(and (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0) (exists ((ULTIMATE.start_main_p1 Int) (ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)))))} is VALID [2019-02-14 16:53:48,941 INFO L273 TraceCheckUtils]: 5: Hoare triple {2828#(and (= (+ (select |#memory_int| ULTIMATE.start_main_p2) 1) 0) (exists ((ULTIMATE.start_main_p1 Int) (ULTIMATE.start_main_p3 Int)) (and (= (select |#memory_int| ULTIMATE.start_main_p1) 1) (= (select |#memory_int| ULTIMATE.start_main_p3) 1) (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)))))} assume !(#memory_int[main_p2] <= 0); {2808#false} is VALID [2019-02-14 16:53:48,942 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:53:48,942 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-14 16:53:49,013 INFO L273 TraceCheckUtils]: 5: Hoare triple {2835#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume !(#memory_int[main_p2] <= 0); {2808#false} is VALID [2019-02-14 16:53:49,013 INFO L273 TraceCheckUtils]: 4: Hoare triple {2835#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} assume #memory_int[main_p1] >= 0; {2835#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2019-02-14 16:53:49,015 INFO L273 TraceCheckUtils]: 3: Hoare triple {2842#(<= (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p2) 0)} #memory_int := #memory_int[main_p3 := #memory_int[main_p3] + 1]; {2835#(<= (select |#memory_int| ULTIMATE.start_main_p2) 0)} is VALID [2019-02-14 16:53:49,016 INFO L273 TraceCheckUtils]: 2: Hoare triple {2846#(<= (select (store (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p3 (+ (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p2) 0)} #memory_int := #memory_int[main_p2 := #memory_int[main_p2] - 1]; {2842#(<= (select (store |#memory_int| ULTIMATE.start_main_p3 (+ (select |#memory_int| ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p2) 0)} is VALID [2019-02-14 16:53:49,017 INFO L273 TraceCheckUtils]: 1: Hoare triple {2850#(<= (select (store (store (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2 (+ (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p3 (+ (select (store (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2 (+ (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p2) 0)} #memory_int := #memory_int[main_p1 := #memory_int[main_p1] + 1]; {2846#(<= (select (store (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p3 (+ (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p2) 0)} is VALID [2019-02-14 16:53:49,019 INFO L273 TraceCheckUtils]: 0: Hoare triple {2807#true} havoc main_p1, main_p2, main_p3;malloc_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;#memory_int := #memory_int[main_p1 := 0];#memory_int := #memory_int[main_p2 := 0];#memory_int := #memory_int[main_p3 := 0]; {2850#(<= (select (store (store (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2 (+ (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p3 (+ (select (store (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2 (+ (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p3) 1)) ULTIMATE.start_main_p2) 0)} is VALID [2019-02-14 16:53:49,020 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:53:49,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-14 16:53:49,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-14 16:53:49,039 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-14 16:53:49,040 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-14 16:53:49,040 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:53:49,040 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2019-02-14 16:53:49,056 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:53:49,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-14 16:53:49,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-14 16:53:49,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-02-14 16:53:49,057 INFO L87 Difference]: Start difference. First operand 19 states and 52 transitions. Second operand 10 states. [2019-02-14 16:53:49,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:53:49,844 INFO L93 Difference]: Finished difference Result 22 states and 60 transitions. [2019-02-14 16:53:49,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-14 16:53:49,845 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-14 16:53:49,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:53:49,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-14 16:53:49,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 23 transitions. [2019-02-14 16:53:49,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-14 16:53:49,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 23 transitions. [2019-02-14 16:53:49,845 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 23 transitions. [2019-02-14 16:53:49,984 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:53:49,985 INFO L225 Difference]: With dead ends: 22 [2019-02-14 16:53:49,985 INFO L226 Difference]: Without dead ends: 0 [2019-02-14 16:53:49,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-02-14 16:53:49,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-14 16:53:49,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-14 16:53:49,986 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:53:49,986 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-02-14 16:53:49,986 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-02-14 16:53:49,986 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-02-14 16:53:49,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:53:49,987 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-02-14 16:53:49,987 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-14 16:53:49,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:53:49,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:53:49,987 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-02-14 16:53:49,987 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-02-14 16:53:49,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:53:49,988 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-02-14 16:53:49,988 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-14 16:53:49,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:53:49,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:53:49,988 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:53:49,988 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:53:49,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-14 16:53:49,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-14 16:53:49,989 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2019-02-14 16:53:49,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:53:49,989 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-14 16:53:49,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-14 16:53:49,989 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-14 16:53:49,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:53:49,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-14 16:53:50,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-14 16:53:50,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-14 16:53:50,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-14 16:53:50,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-14 16:53:50,150 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 124 [2019-02-14 16:53:51,708 WARN L181 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 120 DAG size of output: 32 [2019-02-14 16:53:51,715 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 35) no Hoare annotation was computed. [2019-02-14 16:53:51,716 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-02-14 16:53:51,716 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-02-14 16:53:51,716 INFO L444 ceAbstractionStarter]: At program point L28-1(lines 25 33) the Hoare annotation is: (let ((.cse0 (select |#memory_int| ULTIMATE.start_main_p3))) (let ((.cse2 (<= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))) (.cse1 (or (<= 1 .cse0) (= .cse0 0)))) (or (and (<= (+ (select (store |#memory_int| ULTIMATE.start_main_p3 (+ .cse0 1)) ULTIMATE.start_main_p2) 1) 0) .cse1 .cse2) (and (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3)) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ (select |#memory_int| ULTIMATE.start_main_p1) 1)) ULTIMATE.start_main_p2)) .cse2) .cse1)))) [2019-02-14 16:53:51,716 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 36) no Hoare annotation was computed. [2019-02-14 16:53:51,717 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 39) no Hoare annotation was computed. [2019-02-14 16:53:51,717 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 37) no Hoare annotation was computed. [2019-02-14 16:53:51,717 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-02-14 16:53:51,717 INFO L448 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-02-14 16:53:51,718 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2019-02-14 16:53:51,719 WARN L170 areAnnotationChecker]: ULTIMATE.startErr0ASSERT_VIOLATIONASSERT has no Hoare annotation [2019-02-14 16:53:51,719 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2019-02-14 16:53:51,726 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2019-02-14 16:53:51,726 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2019-02-14 16:53:51,727 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2019-02-14 16:53:51,727 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2019-02-14 16:53:51,727 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2019-02-14 16:53:51,727 INFO L163 areAnnotationChecker]: CFG has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2019-02-14 16:53:51,735 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.02 04:53:51 BoogieIcfgContainer [2019-02-14 16:53:51,735 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-14 16:53:51,736 INFO L168 Benchmark]: Toolchain (without parser) took 145221.84 ms. Allocated memory was 132.1 MB in the beginning and 643.8 MB in the end (delta: 511.7 MB). Free memory was 106.1 MB in the beginning and 302.5 MB in the end (delta: -196.4 MB). Peak memory consumption was 315.3 MB. Max. memory is 7.1 GB. [2019-02-14 16:53:51,737 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 132.1 MB. Free memory is still 106.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-14 16:53:51,737 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.26 ms. Allocated memory is still 132.1 MB. Free memory was 105.6 MB in the beginning and 103.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-02-14 16:53:51,738 INFO L168 Benchmark]: Boogie Preprocessor took 22.47 ms. Allocated memory is still 132.1 MB. Free memory was 103.6 MB in the beginning and 102.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-02-14 16:53:51,738 INFO L168 Benchmark]: RCFGBuilder took 517.79 ms. Allocated memory is still 132.1 MB. Free memory was 102.3 MB in the beginning and 89.7 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 7.1 GB. [2019-02-14 16:53:51,738 INFO L168 Benchmark]: TraceAbstraction took 144622.58 ms. Allocated memory was 132.1 MB in the beginning and 643.8 MB in the end (delta: 511.7 MB). Free memory was 89.3 MB in the beginning and 302.5 MB in the end (delta: -213.2 MB). Peak memory consumption was 298.5 MB. Max. memory is 7.1 GB. [2019-02-14 16:53:51,740 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.20 ms. Allocated memory is still 132.1 MB. Free memory is still 106.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 54.26 ms. Allocated memory is still 132.1 MB. Free memory was 105.6 MB in the beginning and 103.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.47 ms. Allocated memory is still 132.1 MB. Free memory was 103.6 MB in the beginning and 102.3 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 517.79 ms. Allocated memory is still 132.1 MB. Free memory was 102.3 MB in the beginning and 89.7 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 144622.58 ms. Allocated memory was 132.1 MB in the beginning and 643.8 MB in the end (delta: 511.7 MB). Free memory was 89.3 MB in the beginning and 302.5 MB in the end (delta: -213.2 MB). Peak memory consumption was 298.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 36]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 37]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 35]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: ((#memory_int[p3 := #memory_int[p3] + 1][p2] + 1 <= 0 && (1 <= #memory_int[p3] || #memory_int[p3] == 0)) && 0 <= #memory_int[p2 := #memory_int[p2] + -1][p1]) || (((!(p2 == p3) && 0 == #memory_int[p1 := #memory_int[p1] + 1][p2]) && 0 <= #memory_int[p2 := #memory_int[p2] + -1][p1]) && (1 <= #memory_int[p3] || #memory_int[p3] == 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 3 error locations. SAFE Result, 144.5s OverallTime, 17 OverallIterations, 1 TraceHistogramMax, 8.5s AutomataDifference, 0.0s DeadEndRemovalTime, 1.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 49 SDtfs, 129 SDslu, 1 SDs, 0 SdLazy, 950 SolverSat, 119 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 161 GetRequests, 26 SyntacticMatches, 5 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 96.3s AbstIntTime, 14 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 114 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 18 NumberOfFragments, 80 HoareAnnotationTreeSize, 1 FomulaSimplifications, 4651 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 1 FomulaSimplificationsInter, 1656 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 35.1s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 153 ConstructedInterpolants, 35 QuantifiedInterpolants, 9351 SizeOfPredicates, 52 NumberOfNonLiveVariables, 231 ConjunctsInSsa, 130 ConjunctsInUnsatCore, 45 InterpolantComputations, 6 PerfectInterpolantSequences, 22/108 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...