java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b7bd044-m [2019-01-18 14:19:24,407 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-18 14:19:24,409 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-18 14:19:24,420 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-18 14:19:24,420 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-18 14:19:24,421 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-18 14:19:24,423 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-18 14:19:24,424 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-18 14:19:24,426 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-18 14:19:24,427 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-18 14:19:24,428 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-18 14:19:24,428 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-18 14:19:24,429 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-18 14:19:24,430 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-18 14:19:24,431 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-18 14:19:24,432 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-18 14:19:24,433 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-18 14:19:24,435 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-18 14:19:24,437 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-18 14:19:24,439 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-18 14:19:24,440 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-18 14:19:24,443 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-18 14:19:24,446 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-18 14:19:24,446 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-18 14:19:24,446 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-18 14:19:24,448 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-18 14:19:24,448 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-18 14:19:24,449 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-18 14:19:24,452 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-18 14:19:24,453 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-18 14:19:24,453 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-18 14:19:24,454 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-18 14:19:24,454 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-18 14:19:24,454 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-18 14:19:24,455 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-18 14:19:24,456 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-18 14:19:24,456 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-18 14:19:24,468 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-18 14:19:24,468 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-18 14:19:24,469 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-18 14:19:24,469 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-18 14:19:24,470 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-18 14:19:24,470 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-18 14:19:24,470 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-18 14:19:24,470 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-18 14:19:24,470 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-18 14:19:24,471 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-18 14:19:24,471 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-18 14:19:24,471 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-18 14:19:24,471 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-18 14:19:24,471 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-18 14:19:24,472 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-18 14:19:24,472 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-18 14:19:24,472 INFO L133 SettingsManager]: * Use SBE=true [2019-01-18 14:19:24,472 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-18 14:19:24,473 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-18 14:19:24,473 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-18 14:19:24,473 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-18 14:19:24,473 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-18 14:19:24,473 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-18 14:19:24,474 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-18 14:19:24,474 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-18 14:19:24,474 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-18 14:19:24,474 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-18 14:19:24,474 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-18 14:19:24,475 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-18 14:19:24,475 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-18 14:19:24,475 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-18 14:19:24,475 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-18 14:19:24,475 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-18 14:19:24,476 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-18 14:19:24,476 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-18 14:19:24,476 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-18 14:19:24,476 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-18 14:19:24,476 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-18 14:19:24,477 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-18 14:19:24,477 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-18 14:19:24,513 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-18 14:19:24,525 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-18 14:19:24,531 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-18 14:19:24,532 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-18 14:19:24,533 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-18 14:19:24,533 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-01-18 14:19:24,534 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-3-unlimited.bpl' [2019-01-18 14:19:24,573 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-18 14:19:24,575 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-18 14:19:24,576 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-18 14:19:24,576 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-18 14:19:24,576 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-18 14:19:24,593 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 18.01 02:19:24" (1/1) ... [2019-01-18 14:19:24,604 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 18.01 02:19:24" (1/1) ... [2019-01-18 14:19:24,635 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-18 14:19:24,636 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-18 14:19:24,636 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-18 14:19:24,636 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-18 14:19:24,648 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 18.01 02:19:24" (1/1) ... [2019-01-18 14:19:24,648 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 18.01 02:19:24" (1/1) ... [2019-01-18 14:19:24,650 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 18.01 02:19:24" (1/1) ... [2019-01-18 14:19:24,651 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 18.01 02:19:24" (1/1) ... [2019-01-18 14:19:24,654 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 18.01 02:19:24" (1/1) ... [2019-01-18 14:19:24,659 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 18.01 02:19:24" (1/1) ... [2019-01-18 14:19:24,662 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 18.01 02:19:24" (1/1) ... [2019-01-18 14:19:24,664 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-18 14:19:24,664 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-18 14:19:24,664 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-18 14:19:24,664 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-18 14:19:24,665 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 18.01 02:19:24" (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-01-18 14:19:24,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-18 14:19:24,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-18 14:19:25,255 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-18 14:19:25,256 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-01-18 14:19:25,257 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 02:19:25 BoogieIcfgContainer [2019-01-18 14:19:25,257 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-18 14:19:25,258 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-18 14:19:25,259 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-18 14:19:25,262 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-18 14:19:25,262 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 18.01 02:19:24" (1/2) ... [2019-01-18 14:19:25,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69d36bde and model type speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 02:19:25, skipping insertion in model container [2019-01-18 14:19:25,263 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 18.01 02:19:25" (2/2) ... [2019-01-18 14:19:25,265 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-3-unlimited.bpl [2019-01-18 14:19:25,275 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-18 14:19:25,283 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-01-18 14:19:25,300 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-01-18 14:19:25,333 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-18 14:19:25,333 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-18 14:19:25,333 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-18 14:19:25,333 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-18 14:19:25,334 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-18 14:19:25,334 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-18 14:19:25,334 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-18 14:19:25,334 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-18 14:19:25,349 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2019-01-18 14:19:25,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-18 14:19:25,356 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 14:19:25,357 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-18 14:19:25,360 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 14:19:25,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 14:19:25,366 INFO L82 PathProgramCache]: Analyzing trace with hash 976, now seen corresponding path program 1 times [2019-01-18 14:19:25,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 14:19:25,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:19:25,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 14:19:25,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:19:25,420 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 14:19:25,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:19:25,592 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-01-18 14:19:25,600 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-01-18 14:19:25,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:19:25,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 14:19:25,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-18 14:19:25,605 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 14:19:25,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-18 14:19:25,611 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-18 14:19:25,615 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-01-18 14:19:25,639 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-18 14:19:25,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-18 14:19:25,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-18 14:19:25,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-18 14:19:25,649 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2019-01-18 14:19:25,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:19:25,862 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-01-18 14:19:25,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-18 14:19:25,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-18 14:19:25,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 14:19:25,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-18 14:19:25,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2019-01-18 14:19:25,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-18 14:19:25,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2019-01-18 14:19:25,871 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 21 transitions. [2019-01-18 14:19:25,974 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-18 14:19:25,986 INFO L225 Difference]: With dead ends: 17 [2019-01-18 14:19:25,986 INFO L226 Difference]: Without dead ends: 12 [2019-01-18 14:19:25,990 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-01-18 14:19:26,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-18 14:19:26,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 8. [2019-01-18 14:19:26,079 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-18 14:19:26,079 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 8 states. [2019-01-18 14:19:26,080 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 8 states. [2019-01-18 14:19:26,080 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 8 states. [2019-01-18 14:19:26,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:19:26,084 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-01-18 14:19:26,084 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2019-01-18 14:19:26,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:19:26,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-18 14:19:26,085 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 12 states. [2019-01-18 14:19:26,085 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 12 states. [2019-01-18 14:19:26,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:19:26,088 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-01-18 14:19:26,088 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2019-01-18 14:19:26,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:19:26,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-18 14:19:26,089 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-18 14:19:26,089 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-18 14:19:26,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-18 14:19:26,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 13 transitions. [2019-01-18 14:19:26,094 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 13 transitions. Word has length 2 [2019-01-18 14:19:26,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 14:19:26,095 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 13 transitions. [2019-01-18 14:19:26,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-18 14:19:26,095 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 13 transitions. [2019-01-18 14:19:26,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-18 14:19:26,097 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 14:19:26,097 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-18 14:19:26,097 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 14:19:26,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 14:19:26,098 INFO L82 PathProgramCache]: Analyzing trace with hash 30304, now seen corresponding path program 1 times [2019-01-18 14:19:26,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 14:19:26,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:19:26,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 14:19:26,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:19:26,100 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 14:19:26,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:19:26,160 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-01-18 14:19:26,165 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-01-18 14:19:26,166 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-01-18 14:19:26,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:19:26,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 14:19:26,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-18 14:19:26,166 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 14:19:26,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-18 14:19:26,170 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-18 14:19:26,171 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-01-18 14:19:26,207 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-18 14:19:26,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-18 14:19:26,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-18 14:19:26,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-18 14:19:26,209 INFO L87 Difference]: Start difference. First operand 8 states and 13 transitions. Second operand 3 states. [2019-01-18 14:19:26,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:19:26,409 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-01-18 14:19:26,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-18 14:19:26,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-18 14:19:26,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 14:19:26,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-18 14:19:26,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-01-18 14:19:26,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-18 14:19:26,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-01-18 14:19:26,414 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 16 transitions. [2019-01-18 14:19:26,502 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-18 14:19:26,503 INFO L225 Difference]: With dead ends: 12 [2019-01-18 14:19:26,503 INFO L226 Difference]: Without dead ends: 11 [2019-01-18 14:19:26,504 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-01-18 14:19:26,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-18 14:19:26,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2019-01-18 14:19:26,513 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-18 14:19:26,513 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand 9 states. [2019-01-18 14:19:26,513 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 9 states. [2019-01-18 14:19:26,513 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 9 states. [2019-01-18 14:19:26,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:19:26,515 INFO L93 Difference]: Finished difference Result 11 states and 15 transitions. [2019-01-18 14:19:26,515 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2019-01-18 14:19:26,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:19:26,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-18 14:19:26,516 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 11 states. [2019-01-18 14:19:26,516 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 11 states. [2019-01-18 14:19:26,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:19:26,517 INFO L93 Difference]: Finished difference Result 11 states and 15 transitions. [2019-01-18 14:19:26,518 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 15 transitions. [2019-01-18 14:19:26,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:19:26,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-18 14:19:26,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-18 14:19:26,519 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-18 14:19:26,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-18 14:19:26,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2019-01-18 14:19:26,520 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 14 transitions. Word has length 3 [2019-01-18 14:19:26,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 14:19:26,521 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 14 transitions. [2019-01-18 14:19:26,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-18 14:19:26,521 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 14 transitions. [2019-01-18 14:19:26,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-18 14:19:26,521 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 14:19:26,522 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-18 14:19:26,522 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 14:19:26,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 14:19:26,522 INFO L82 PathProgramCache]: Analyzing trace with hash 29992, now seen corresponding path program 1 times [2019-01-18 14:19:26,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 14:19:26,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:19:26,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 14:19:26,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:19:26,524 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 14:19:26,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:19:26,699 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-01-18 14:19:26,701 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-01-18 14:19:26,703 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-01-18 14:19:26,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:19:26,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 14:19:26,704 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 14:19:26,705 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-18 14:19:26,707 INFO L207 CegarAbsIntRunner]: [0], [6], [15] [2019-01-18 14:19:26,740 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 14:19:26,741 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 14:19:26,860 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 14:19:26,861 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 34 root evaluator evaluations with a maximum evaluation depth of 2. Performed 34 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-18 14:19:26,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 14:19:26,869 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 14:19:26,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 14:19:26,870 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-01-18 14:19:26,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 14:19:26,892 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 14:19:26,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:19:26,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:19:26,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 14:19:27,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:27,194 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-01-18 14:19:27,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:27,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:27,399 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-01-18 14:19:27,402 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 14:19:27,410 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:19:27,428 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-01-18 14:19:27,484 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-01-18 14:19:27,636 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-01-18 14:19:27,659 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 14:19:27,847 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:19:27,956 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:19:28,060 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-01-18 14:19:28,061 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:32, output treesize:28 [2019-01-18 14:19:28,067 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:19:28,067 WARN L385 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-01-18 14:19:28,068 WARN L386 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-01-18 14:19:28,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:28,254 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-01-18 14:19:28,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 14:19:28,289 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-01-18 14:19:28,290 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-01-18 14:19:28,294 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:19:28,295 WARN L385 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-01-18 14:19:28,295 WARN L386 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-01-18 14:19:28,334 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-01-18 14:19:28,336 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-01-18 14:19:28,337 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-01-18 14:19:28,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:19:28,338 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 14:19:28,436 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-01-18 14:19:28,437 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-01-18 14:19:28,438 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-01-18 14:19:28,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:19:28,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-18 14:19:28,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-18 14:19:28,460 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 14:19:28,460 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-18 14:19:28,461 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-18 14:19:28,461 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-01-18 14:19:28,465 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-18 14:19:28,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-18 14:19:28,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-18 14:19:28,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-18 14:19:28,466 INFO L87 Difference]: Start difference. First operand 9 states and 14 transitions. Second operand 4 states. [2019-01-18 14:19:28,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:19:28,560 INFO L93 Difference]: Finished difference Result 13 states and 24 transitions. [2019-01-18 14:19:28,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-18 14:19:28,561 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-18 14:19:28,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 14:19:28,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-18 14:19:28,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2019-01-18 14:19:28,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-18 14:19:28,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2019-01-18 14:19:28,564 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 19 transitions. [2019-01-18 14:19:28,616 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-18 14:19:28,618 INFO L225 Difference]: With dead ends: 13 [2019-01-18 14:19:28,618 INFO L226 Difference]: Without dead ends: 12 [2019-01-18 14:19:28,619 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-01-18 14:19:28,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-18 14:19:28,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-01-18 14:19:28,665 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-18 14:19:28,666 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 11 states. [2019-01-18 14:19:28,666 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 11 states. [2019-01-18 14:19:28,666 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 11 states. [2019-01-18 14:19:28,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:19:28,669 INFO L93 Difference]: Finished difference Result 12 states and 23 transitions. [2019-01-18 14:19:28,669 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 23 transitions. [2019-01-18 14:19:28,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:19:28,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-18 14:19:28,669 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 12 states. [2019-01-18 14:19:28,669 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 12 states. [2019-01-18 14:19:28,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:19:28,671 INFO L93 Difference]: Finished difference Result 12 states and 23 transitions. [2019-01-18 14:19:28,671 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 23 transitions. [2019-01-18 14:19:28,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:19:28,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-18 14:19:28,672 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-18 14:19:28,672 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-18 14:19:28,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-18 14:19:28,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 23 transitions. [2019-01-18 14:19:28,674 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 23 transitions. Word has length 3 [2019-01-18 14:19:28,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 14:19:28,674 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 23 transitions. [2019-01-18 14:19:28,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-18 14:19:28,675 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 23 transitions. [2019-01-18 14:19:28,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-18 14:19:28,675 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 14:19:28,675 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-18 14:19:28,676 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 14:19:28,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 14:19:28,676 INFO L82 PathProgramCache]: Analyzing trace with hash 30116, now seen corresponding path program 1 times [2019-01-18 14:19:28,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 14:19:28,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:19:28,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 14:19:28,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:19:28,678 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 14:19:28,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:19:28,779 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-01-18 14:19:28,780 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-01-18 14:19:28,782 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-01-18 14:19:28,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:19:28,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 14:19:28,783 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 14:19:28,783 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-18 14:19:28,784 INFO L207 CegarAbsIntRunner]: [0], [10], [15] [2019-01-18 14:19:28,785 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 14:19:28,785 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 14:19:28,795 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 14:19:28,795 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 34 root evaluator evaluations with a maximum evaluation depth of 2. Performed 34 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-18 14:19:28,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 14:19:28,796 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 14:19:28,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 14:19:28,796 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01-18 14:19:28,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 14:19:28,805 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 14:19:28,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:19:28,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:19:28,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 14:19:28,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:28,915 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-01-18 14:19:28,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:28,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:28,974 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-01-18 14:19:28,976 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 14:19:29,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:19:29,042 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-01-18 14:19:29,053 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-01-18 14:19:29,073 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-01-18 14:19:29,077 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 14:19:29,088 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:19:29,100 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:19:29,121 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-01-18 14:19:29,122 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-01-18 14:19:29,125 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:19:29,125 WARN L385 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-01-18 14:19:29,125 WARN L386 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-01-18 14:19:29,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:29,234 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-01-18 14:19:29,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 14:19:29,252 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-01-18 14:19:29,252 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-01-18 14:19:29,259 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:19:29,259 WARN L385 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-01-18 14:19:29,259 WARN L386 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-01-18 14:19:29,323 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-01-18 14:19:29,325 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-01-18 14:19:29,327 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-01-18 14:19:29,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:19:29,328 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 14:19:29,355 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-01-18 14:19:29,361 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-01-18 14:19:29,363 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-01-18 14:19:29,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:19:29,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 14:19:29,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-18 14:19:29,383 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 14:19:29,383 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-18 14:19:29,384 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-18 14:19:29,384 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2019-01-18 14:19:29,397 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-18 14:19:29,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-18 14:19:29,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-18 14:19:29,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-18 14:19:29,398 INFO L87 Difference]: Start difference. First operand 11 states and 23 transitions. Second operand 6 states. [2019-01-18 14:19:29,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:19:29,800 INFO L93 Difference]: Finished difference Result 24 states and 40 transitions. [2019-01-18 14:19:29,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-18 14:19:29,801 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-18 14:19:29,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 14:19:29,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-18 14:19:29,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2019-01-18 14:19:29,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-18 14:19:29,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2019-01-18 14:19:29,804 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2019-01-18 14:19:29,862 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-18 14:19:29,863 INFO L225 Difference]: With dead ends: 24 [2019-01-18 14:19:29,863 INFO L226 Difference]: Without dead ends: 23 [2019-01-18 14:19:29,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-18 14:19:29,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-18 14:19:29,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 13. [2019-01-18 14:19:29,892 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-18 14:19:29,892 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 13 states. [2019-01-18 14:19:29,892 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 13 states. [2019-01-18 14:19:29,893 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 13 states. [2019-01-18 14:19:29,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:19:29,896 INFO L93 Difference]: Finished difference Result 23 states and 38 transitions. [2019-01-18 14:19:29,897 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. [2019-01-18 14:19:29,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:19:29,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-18 14:19:29,897 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 23 states. [2019-01-18 14:19:29,898 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 23 states. [2019-01-18 14:19:29,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:19:29,900 INFO L93 Difference]: Finished difference Result 23 states and 38 transitions. [2019-01-18 14:19:29,900 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 38 transitions. [2019-01-18 14:19:29,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:19:29,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-18 14:19:29,901 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-18 14:19:29,901 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-18 14:19:29,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-18 14:19:29,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 31 transitions. [2019-01-18 14:19:29,903 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 31 transitions. Word has length 3 [2019-01-18 14:19:29,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 14:19:29,903 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 31 transitions. [2019-01-18 14:19:29,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-18 14:19:29,903 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 31 transitions. [2019-01-18 14:19:29,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 14:19:29,904 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 14:19:29,904 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 14:19:29,904 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 14:19:29,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 14:19:29,905 INFO L82 PathProgramCache]: Analyzing trace with hash 939474, now seen corresponding path program 1 times [2019-01-18 14:19:29,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 14:19:29,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:19:29,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 14:19:29,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:19:29,907 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 14:19:29,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:19:29,951 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-01-18 14:19:29,952 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-01-18 14:19:29,952 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-01-18 14:19:29,955 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-01-18 14:19:29,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:19:29,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 14:19:29,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-18 14:19:29,956 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 14:19:29,956 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-18 14:19:29,957 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-18 14:19:29,957 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-01-18 14:19:29,962 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-18 14:19:29,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-18 14:19:29,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-18 14:19:29,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-18 14:19:29,963 INFO L87 Difference]: Start difference. First operand 13 states and 31 transitions. Second operand 3 states. [2019-01-18 14:19:30,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:19:30,021 INFO L93 Difference]: Finished difference Result 15 states and 32 transitions. [2019-01-18 14:19:30,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-18 14:19:30,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-18 14:19:30,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 14:19:30,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-18 14:19:30,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2019-01-18 14:19:30,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-18 14:19:30,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2019-01-18 14:19:30,023 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 15 transitions. [2019-01-18 14:19:30,038 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-18 14:19:30,040 INFO L225 Difference]: With dead ends: 15 [2019-01-18 14:19:30,040 INFO L226 Difference]: Without dead ends: 12 [2019-01-18 14:19:30,041 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-01-18 14:19:30,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-18 14:19:30,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-18 14:19:30,081 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-18 14:19:30,081 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2019-01-18 14:19:30,081 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2019-01-18 14:19:30,082 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2019-01-18 14:19:30,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:19:30,083 INFO L93 Difference]: Finished difference Result 12 states and 29 transitions. [2019-01-18 14:19:30,083 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 29 transitions. [2019-01-18 14:19:30,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:19:30,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-18 14:19:30,084 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2019-01-18 14:19:30,084 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2019-01-18 14:19:30,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:19:30,086 INFO L93 Difference]: Finished difference Result 12 states and 29 transitions. [2019-01-18 14:19:30,086 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 29 transitions. [2019-01-18 14:19:30,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:19:30,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-18 14:19:30,087 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-18 14:19:30,087 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-18 14:19:30,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-18 14:19:30,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 29 transitions. [2019-01-18 14:19:30,089 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 29 transitions. Word has length 4 [2019-01-18 14:19:30,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 14:19:30,089 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 29 transitions. [2019-01-18 14:19:30,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-18 14:19:30,089 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 29 transitions. [2019-01-18 14:19:30,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 14:19:30,090 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 14:19:30,090 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 14:19:30,090 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 14:19:30,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 14:19:30,090 INFO L82 PathProgramCache]: Analyzing trace with hash 929800, now seen corresponding path program 1 times [2019-01-18 14:19:30,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 14:19:30,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:19:30,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 14:19:30,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:19:30,092 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 14:19:30,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:19:30,171 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-01-18 14:19:30,172 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-01-18 14:19:30,172 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-01-18 14:19:30,177 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-01-18 14:19:30,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:19:30,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 14:19:30,178 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 14:19:30,178 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 14:19:30,178 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [17] [2019-01-18 14:19:30,180 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 14:19:30,180 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 14:19:30,202 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 14:19:30,203 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 36 root evaluator evaluations with a maximum evaluation depth of 2. Performed 36 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-18 14:19:30,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 14:19:30,203 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 14:19:30,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 14:19:30,203 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-01-18 14:19:30,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 14:19:30,213 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 14:19:30,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:19:30,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:19:30,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 14:19:30,277 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-01-18 14:19:30,289 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-01-18 14:19:30,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:30,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:30,301 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-01-18 14:19:30,310 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 14:19:30,324 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:19:30,331 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:19:30,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:30,351 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-01-18 14:19:30,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:30,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:30,391 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-01-18 14:19:30,394 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 14:19:30,401 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:19:30,476 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-01-18 14:19:30,476 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-01-18 14:19:30,479 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:19:30,480 WARN L385 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-01-18 14:19:30,480 WARN L386 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-01-18 14:19:30,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:30,535 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-01-18 14:19:30,538 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 14:19:30,551 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-01-18 14:19:30,552 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2019-01-18 14:19:31,023 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:19:31,024 WARN L385 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-01-18 14:19:31,024 WARN L386 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-01-18 14:19:31,066 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-01-18 14:19:31,069 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-01-18 14:19:31,070 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-01-18 14:19:31,073 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-01-18 14:19:31,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:19:31,073 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 14:19:31,100 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-01-18 14:19:31,101 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-01-18 14:19:31,102 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-01-18 14:19:31,104 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-01-18 14:19:31,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:19:31,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 14:19:31,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-18 14:19:31,130 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 14:19:31,130 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-18 14:19:31,130 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-18 14:19:31,130 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2019-01-18 14:19:31,139 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-18 14:19:31,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-18 14:19:31,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-18 14:19:31,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-18 14:19:31,140 INFO L87 Difference]: Start difference. First operand 12 states and 29 transitions. Second operand 6 states. [2019-01-18 14:19:31,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:19:31,420 INFO L93 Difference]: Finished difference Result 21 states and 43 transitions. [2019-01-18 14:19:31,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-18 14:19:31,420 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-18 14:19:31,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 14:19:31,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-18 14:19:31,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2019-01-18 14:19:31,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-18 14:19:31,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2019-01-18 14:19:31,423 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 26 transitions. [2019-01-18 14:19:31,523 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-18 14:19:31,524 INFO L225 Difference]: With dead ends: 21 [2019-01-18 14:19:31,524 INFO L226 Difference]: Without dead ends: 20 [2019-01-18 14:19:31,525 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-01-18 14:19:31,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-18 14:19:31,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2019-01-18 14:19:31,558 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-18 14:19:31,558 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 14 states. [2019-01-18 14:19:31,558 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 14 states. [2019-01-18 14:19:31,558 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 14 states. [2019-01-18 14:19:31,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:19:31,560 INFO L93 Difference]: Finished difference Result 20 states and 41 transitions. [2019-01-18 14:19:31,561 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 41 transitions. [2019-01-18 14:19:31,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:19:31,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-18 14:19:31,561 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 20 states. [2019-01-18 14:19:31,561 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 20 states. [2019-01-18 14:19:31,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:19:31,563 INFO L93 Difference]: Finished difference Result 20 states and 41 transitions. [2019-01-18 14:19:31,563 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 41 transitions. [2019-01-18 14:19:31,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:19:31,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-18 14:19:31,564 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-18 14:19:31,564 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-18 14:19:31,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-18 14:19:31,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 34 transitions. [2019-01-18 14:19:31,565 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 34 transitions. Word has length 4 [2019-01-18 14:19:31,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 14:19:31,566 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 34 transitions. [2019-01-18 14:19:31,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-18 14:19:31,566 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 34 transitions. [2019-01-18 14:19:31,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 14:19:31,566 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 14:19:31,566 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 14:19:31,567 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 14:19:31,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 14:19:31,567 INFO L82 PathProgramCache]: Analyzing trace with hash 929612, now seen corresponding path program 1 times [2019-01-18 14:19:31,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 14:19:31,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:19:31,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 14:19:31,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:19:31,570 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 14:19:31,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:19:31,684 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-01-18 14:19:31,685 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-01-18 14:19:31,686 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-01-18 14:19:31,686 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-01-18 14:19:31,687 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:19:31,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 14:19:31,687 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 14:19:31,688 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 14:19:31,688 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [15] [2019-01-18 14:19:31,689 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 14:19:31,690 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 14:19:31,704 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 14:19:31,704 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 36 root evaluator evaluations with a maximum evaluation depth of 2. Performed 36 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 14:19:31,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 14:19:31,704 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 14:19:31,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 14:19:31,705 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-01-18 14:19:31,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 14:19:31,713 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 14:19:31,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:19:31,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:19:31,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 14:19:31,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:31,921 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-01-18 14:19:31,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:31,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:31,963 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-01-18 14:19:31,965 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 14:19:31,971 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:19:31,984 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-01-18 14:19:32,002 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-01-18 14:19:32,011 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-01-18 14:19:32,014 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 14:19:32,026 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:19:32,034 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:19:32,047 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-01-18 14:19:32,048 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-01-18 14:19:32,051 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:19:32,051 WARN L385 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-01-18 14:19:32,051 WARN L386 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-01-18 14:19:32,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:32,130 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-01-18 14:19:32,136 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 14:19:32,164 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-01-18 14:19:32,165 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-18 14:19:32,168 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:19:32,168 WARN L385 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-01-18 14:19:32,169 WARN L386 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-01-18 14:19:32,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:32,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:32,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:32,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:32,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:32,244 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-01-18 14:19:32,280 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 14:19:32,317 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-01-18 14:19:32,317 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2019-01-18 14:19:32,355 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:19:32,356 WARN L385 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-01-18 14:19:32,356 WARN L386 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-01-18 14:19:32,375 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-01-18 14:19:32,377 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-01-18 14:19:32,379 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-01-18 14:19:32,385 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-01-18 14:19:32,386 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:19:32,386 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 14:19:32,446 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-01-18 14:19:32,447 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-01-18 14:19:32,448 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-01-18 14:19:32,449 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-01-18 14:19:32,449 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:19:32,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 14:19:32,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 14:19:32,469 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 14:19:32,469 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-18 14:19:32,469 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-18 14:19:32,469 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2019-01-18 14:19:32,482 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-18 14:19:32,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 14:19:32,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 14:19:32,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-18 14:19:32,483 INFO L87 Difference]: Start difference. First operand 14 states and 34 transitions. Second operand 8 states. [2019-01-18 14:19:32,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:19:32,992 INFO L93 Difference]: Finished difference Result 35 states and 68 transitions. [2019-01-18 14:19:32,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 14:19:32,992 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-18 14:19:32,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 14:19:32,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-18 14:19:32,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2019-01-18 14:19:32,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-18 14:19:32,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2019-01-18 14:19:32,994 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 41 transitions. [2019-01-18 14:19:33,052 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-18 14:19:33,054 INFO L225 Difference]: With dead ends: 35 [2019-01-18 14:19:33,055 INFO L226 Difference]: Without dead ends: 34 [2019-01-18 14:19:33,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 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-01-18 14:19:33,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-18 14:19:33,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 15. [2019-01-18 14:19:33,152 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-18 14:19:33,152 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 15 states. [2019-01-18 14:19:33,153 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 15 states. [2019-01-18 14:19:33,153 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 15 states. [2019-01-18 14:19:33,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:19:33,156 INFO L93 Difference]: Finished difference Result 34 states and 65 transitions. [2019-01-18 14:19:33,156 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 65 transitions. [2019-01-18 14:19:33,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:19:33,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-18 14:19:33,157 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 34 states. [2019-01-18 14:19:33,157 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 34 states. [2019-01-18 14:19:33,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:19:33,159 INFO L93 Difference]: Finished difference Result 34 states and 65 transitions. [2019-01-18 14:19:33,159 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 65 transitions. [2019-01-18 14:19:33,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:19:33,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-18 14:19:33,160 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-18 14:19:33,160 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-18 14:19:33,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-18 14:19:33,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 38 transitions. [2019-01-18 14:19:33,162 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 38 transitions. Word has length 4 [2019-01-18 14:19:33,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 14:19:33,162 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 38 transitions. [2019-01-18 14:19:33,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 14:19:33,162 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 38 transitions. [2019-01-18 14:19:33,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 14:19:33,163 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 14:19:33,163 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 14:19:33,163 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 14:19:33,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 14:19:33,163 INFO L82 PathProgramCache]: Analyzing trace with hash 933644, now seen corresponding path program 1 times [2019-01-18 14:19:33,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 14:19:33,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:19:33,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 14:19:33,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:19:33,165 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 14:19:33,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:19:33,217 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-01-18 14:19:33,222 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-01-18 14:19:33,231 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-01-18 14:19:33,233 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-01-18 14:19:33,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:19:33,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 14:19:33,233 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 14:19:33,234 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 14:19:33,234 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [17] [2019-01-18 14:19:33,236 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 14:19:33,236 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 14:19:33,250 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 14:19:33,250 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 36 root evaluator evaluations with a maximum evaluation depth of 2. Performed 36 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-18 14:19:33,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 14:19:33,251 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 14:19:33,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 14:19:33,251 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-01-18 14:19:33,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 14:19:33,261 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 14:19:33,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:19:33,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:19:33,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 14:19:33,286 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-01-18 14:19:33,297 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-01-18 14:19:33,318 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-01-18 14:19:33,322 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 14:19:33,330 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:19:33,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:19:33,345 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-01-18 14:19:33,345 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:12, output treesize:16 [2019-01-18 14:19:33,349 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:19:33,349 WARN L385 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-01-18 14:19:33,350 WARN L386 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-01-18 14:19:33,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:33,373 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-01-18 14:19:33,375 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 14:19:33,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:19:33,380 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-01-18 14:19:33,386 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:19:33,387 WARN L385 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-01-18 14:19:33,387 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ []. (= (- 1) (select |#memory_int| ULTIMATE.start_main_p2)) [2019-01-18 14:19:33,395 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-01-18 14:19:33,397 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-01-18 14:19:33,397 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-01-18 14:19:33,398 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-01-18 14:19:33,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:19:33,398 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 14:19:33,410 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-01-18 14:19:33,411 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-01-18 14:19:33,412 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-01-18 14:19:33,413 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-01-18 14:19:33,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:19:33,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-18 14:19:33,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 4 [2019-01-18 14:19:33,434 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 14:19:33,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-18 14:19:33,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-18 14:19:33,435 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-01-18 14:19:33,443 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-18 14:19:33,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-18 14:19:33,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-18 14:19:33,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-01-18 14:19:33,444 INFO L87 Difference]: Start difference. First operand 15 states and 38 transitions. Second operand 4 states. [2019-01-18 14:19:33,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:19:33,739 INFO L93 Difference]: Finished difference Result 30 states and 79 transitions. [2019-01-18 14:19:33,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-18 14:19:33,739 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-18 14:19:33,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 14:19:33,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-18 14:19:33,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2019-01-18 14:19:33,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-18 14:19:33,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2019-01-18 14:19:33,740 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 23 transitions. [2019-01-18 14:19:33,826 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-18 14:19:33,828 INFO L225 Difference]: With dead ends: 30 [2019-01-18 14:19:33,828 INFO L226 Difference]: Without dead ends: 29 [2019-01-18 14:19:33,829 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-01-18 14:19:33,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-18 14:19:33,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2019-01-18 14:19:33,906 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-18 14:19:33,906 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 23 states. [2019-01-18 14:19:33,906 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 23 states. [2019-01-18 14:19:33,906 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 23 states. [2019-01-18 14:19:33,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:19:33,909 INFO L93 Difference]: Finished difference Result 29 states and 78 transitions. [2019-01-18 14:19:33,909 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 78 transitions. [2019-01-18 14:19:33,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:19:33,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-18 14:19:33,910 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 29 states. [2019-01-18 14:19:33,910 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 29 states. [2019-01-18 14:19:33,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:19:33,912 INFO L93 Difference]: Finished difference Result 29 states and 78 transitions. [2019-01-18 14:19:33,912 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 78 transitions. [2019-01-18 14:19:33,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:19:33,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-18 14:19:33,913 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-18 14:19:33,913 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-18 14:19:33,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-18 14:19:33,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 74 transitions. [2019-01-18 14:19:33,915 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 74 transitions. Word has length 4 [2019-01-18 14:19:33,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 14:19:33,915 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 74 transitions. [2019-01-18 14:19:33,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-18 14:19:33,915 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 74 transitions. [2019-01-18 14:19:33,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 14:19:33,916 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 14:19:33,916 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 14:19:33,916 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 14:19:33,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 14:19:33,917 INFO L82 PathProgramCache]: Analyzing trace with hash 933518, now seen corresponding path program 1 times [2019-01-18 14:19:33,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 14:19:33,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:19:33,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 14:19:33,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:19:33,918 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 14:19:33,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:19:34,062 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-01-18 14:19:34,064 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-01-18 14:19:34,065 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-01-18 14:19:34,066 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-01-18 14:19:34,067 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:19:34,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 14:19:34,067 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 14:19:34,067 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 14:19:34,068 INFO L207 CegarAbsIntRunner]: [0], [10], [12], [15] [2019-01-18 14:19:34,069 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 14:19:34,069 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 14:19:34,082 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 14:19:34,082 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 36 root evaluator evaluations with a maximum evaluation depth of 2. Performed 36 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 14:19:34,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 14:19:34,082 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 14:19:34,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 14:19:34,083 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-01-18 14:19:34,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 14:19:34,092 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 14:19:34,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:19:34,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:19:34,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 14:19:34,166 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-01-18 14:19:34,178 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-01-18 14:19:34,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:34,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:34,188 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-01-18 14:19:34,190 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 14:19:34,201 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:19:34,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:19:34,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:34,245 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-01-18 14:19:34,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:34,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:34,302 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-01-18 14:19:34,304 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 14:19:34,310 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:19:34,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:19:34,336 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-01-18 14:19:34,339 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:19:34,340 WARN L385 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-01-18 14:19:34,340 WARN L386 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-01-18 14:19:34,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:34,421 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-01-18 14:19:34,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 14:19:34,439 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-01-18 14:19:34,439 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-18 14:19:36,460 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:19:36,460 WARN L385 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-01-18 14:19:36,461 WARN L386 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-01-18 14:19:36,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:36,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:36,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:36,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:36,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:36,573 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-01-18 14:19:36,587 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 14:19:36,602 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-01-18 14:19:36,602 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2019-01-18 14:19:36,634 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:19:36,635 WARN L385 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-01-18 14:19:36,635 WARN L386 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-01-18 14:19:36,656 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-01-18 14:19:36,657 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-01-18 14:19:36,658 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-01-18 14:19:36,658 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-01-18 14:19:36,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:19:36,659 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 14:19:36,720 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-01-18 14:19:36,722 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-01-18 14:19:36,724 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-01-18 14:19:36,726 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-01-18 14:19:36,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:19:36,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 14:19:36,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-18 14:19:36,745 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 14:19:36,746 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-18 14:19:36,746 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-18 14:19:36,746 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2019-01-18 14:19:36,758 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-18 14:19:36,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 14:19:36,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 14:19:36,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-01-18 14:19:36,759 INFO L87 Difference]: Start difference. First operand 23 states and 74 transitions. Second operand 8 states. [2019-01-18 14:19:37,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:19:37,350 INFO L93 Difference]: Finished difference Result 48 states and 138 transitions. [2019-01-18 14:19:37,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 14:19:37,350 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-18 14:19:37,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 14:19:37,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-18 14:19:37,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2019-01-18 14:19:37,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-18 14:19:37,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2019-01-18 14:19:37,352 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 39 transitions. [2019-01-18 14:19:37,485 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-18 14:19:37,488 INFO L225 Difference]: With dead ends: 48 [2019-01-18 14:19:37,488 INFO L226 Difference]: Without dead ends: 44 [2019-01-18 14:19:37,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-01-18 14:19:37,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-18 14:19:37,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2019-01-18 14:19:37,664 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-18 14:19:37,664 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 31 states. [2019-01-18 14:19:37,665 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 31 states. [2019-01-18 14:19:37,665 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 31 states. [2019-01-18 14:19:37,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:19:37,668 INFO L93 Difference]: Finished difference Result 44 states and 128 transitions. [2019-01-18 14:19:37,668 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 128 transitions. [2019-01-18 14:19:37,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:19:37,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-18 14:19:37,669 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 44 states. [2019-01-18 14:19:37,669 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 44 states. [2019-01-18 14:19:37,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:19:37,672 INFO L93 Difference]: Finished difference Result 44 states and 128 transitions. [2019-01-18 14:19:37,672 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 128 transitions. [2019-01-18 14:19:37,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:19:37,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-18 14:19:37,673 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-18 14:19:37,673 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-18 14:19:37,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-18 14:19:37,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 105 transitions. [2019-01-18 14:19:37,676 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 105 transitions. Word has length 4 [2019-01-18 14:19:37,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 14:19:37,676 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 105 transitions. [2019-01-18 14:19:37,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 14:19:37,676 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 105 transitions. [2019-01-18 14:19:37,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 14:19:37,677 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 14:19:37,677 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 14:19:37,677 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 14:19:37,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 14:19:37,677 INFO L82 PathProgramCache]: Analyzing trace with hash 935566, now seen corresponding path program 1 times [2019-01-18 14:19:37,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 14:19:37,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:19:37,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 14:19:37,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:19:37,679 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 14:19:37,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:19:37,725 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-01-18 14:19:37,726 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-01-18 14:19:37,726 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-01-18 14:19:37,731 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-01-18 14:19:37,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:19:37,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 14:19:37,732 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 14:19:37,732 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 14:19:37,732 INFO L207 CegarAbsIntRunner]: [0], [12], [16], [17] [2019-01-18 14:19:37,733 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 14:19:37,733 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 14:19:37,765 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 14:19:37,765 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 36 root evaluator evaluations with a maximum evaluation depth of 2. Performed 36 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-18 14:19:37,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 14:19:37,766 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 14:19:37,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 14:19:37,766 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-01-18 14:19:37,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 14:19:37,775 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 14:19:37,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:19:37,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:19:37,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 14:19:37,813 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-01-18 14:19:37,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:37,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:37,842 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-01-18 14:19:37,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 14:19:37,857 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:19:37,865 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-01-18 14:19:37,874 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-01-18 14:19:37,886 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-01-18 14:19:37,888 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 14:19:37,898 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:19:37,906 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:19:37,917 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-01-18 14:19:37,917 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:24, output treesize:24 [2019-01-18 14:19:37,920 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:19:37,921 WARN L385 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-01-18 14:19:37,921 WARN L386 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-01-18 14:19:37,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:37,964 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-01-18 14:19:37,973 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 14:19:37,981 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-01-18 14:19:37,981 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:11 [2019-01-18 14:19:39,999 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:19:40,000 WARN L385 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-01-18 14:19:40,000 WARN L386 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-01-18 14:19:40,025 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-01-18 14:19:40,027 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-01-18 14:19:40,028 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-01-18 14:19:40,028 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-01-18 14:19:40,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:19:40,029 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 14:19:40,069 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-01-18 14:19:40,069 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-01-18 14:19:40,070 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-01-18 14:19:40,071 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-01-18 14:19:40,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:19:40,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 14:19:40,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-18 14:19:40,091 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 14:19:40,091 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-18 14:19:40,091 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-18 14:19:40,092 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2019-01-18 14:19:40,101 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-18 14:19:40,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-18 14:19:40,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-18 14:19:40,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-18 14:19:40,102 INFO L87 Difference]: Start difference. First operand 31 states and 105 transitions. Second operand 6 states. [2019-01-18 14:19:40,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:19:40,511 INFO L93 Difference]: Finished difference Result 39 states and 115 transitions. [2019-01-18 14:19:40,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-18 14:19:40,511 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-18 14:19:40,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 14:19:40,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-18 14:19:40,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2019-01-18 14:19:40,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-18 14:19:40,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2019-01-18 14:19:40,512 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 26 transitions. [2019-01-18 14:19:40,579 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-18 14:19:40,580 INFO L225 Difference]: With dead ends: 39 [2019-01-18 14:19:40,580 INFO L226 Difference]: Without dead ends: 38 [2019-01-18 14:19:40,581 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-01-18 14:19:40,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-18 14:19:40,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2019-01-18 14:19:40,766 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-18 14:19:40,766 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 32 states. [2019-01-18 14:19:40,766 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 32 states. [2019-01-18 14:19:40,766 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 32 states. [2019-01-18 14:19:40,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:19:40,769 INFO L93 Difference]: Finished difference Result 38 states and 113 transitions. [2019-01-18 14:19:40,769 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 113 transitions. [2019-01-18 14:19:40,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:19:40,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-18 14:19:40,770 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 38 states. [2019-01-18 14:19:40,770 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 38 states. [2019-01-18 14:19:40,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:19:40,772 INFO L93 Difference]: Finished difference Result 38 states and 113 transitions. [2019-01-18 14:19:40,772 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 113 transitions. [2019-01-18 14:19:40,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:19:40,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-18 14:19:40,773 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-18 14:19:40,773 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-18 14:19:40,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-18 14:19:40,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 109 transitions. [2019-01-18 14:19:40,775 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 109 transitions. Word has length 4 [2019-01-18 14:19:40,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 14:19:40,775 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 109 transitions. [2019-01-18 14:19:40,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-18 14:19:40,775 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 109 transitions. [2019-01-18 14:19:40,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 14:19:40,776 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 14:19:40,776 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 14:19:40,776 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 14:19:40,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 14:19:40,777 INFO L82 PathProgramCache]: Analyzing trace with hash 28823850, now seen corresponding path program 1 times [2019-01-18 14:19:40,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 14:19:40,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:19:40,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 14:19:40,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:19:40,778 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 14:19:40,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:19:40,877 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-01-18 14:19:40,878 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-01-18 14:19:40,879 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-01-18 14:19:40,880 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-01-18 14:19:40,881 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-01-18 14:19:40,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:19:40,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 14:19:40,882 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 14:19:40,882 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 14:19:40,882 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [18], [19] [2019-01-18 14:19:40,885 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 14:19:40,885 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 14:19:40,900 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 14:19:40,901 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 38 root evaluator evaluations with a maximum evaluation depth of 2. Performed 38 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-18 14:19:40,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 14:19:40,901 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 14:19:40,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 14:19:40,901 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-01-18 14:19:40,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 14:19:40,911 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 14:19:40,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:19:40,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:19:40,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 14:19:40,940 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-01-18 14:19:40,956 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-01-18 14:19:40,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:40,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:40,965 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-01-18 14:19:40,969 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 14:19:40,983 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:19:40,996 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:19:41,021 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-01-18 14:19:41,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:41,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:41,038 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-01-18 14:19:41,039 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 14:19:41,045 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:19:41,058 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-01-18 14:19:41,058 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:24, output treesize:24 [2019-01-18 14:19:41,062 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:19:41,062 WARN L385 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-01-18 14:19:41,062 WARN L386 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-01-18 14:19:41,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:41,111 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-01-18 14:19:41,122 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 14:19:41,128 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-01-18 14:19:41,129 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:11 [2019-01-18 14:19:43,367 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:19:43,367 WARN L385 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-01-18 14:19:43,367 WARN L386 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-01-18 14:19:43,434 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-01-18 14:19:43,435 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-01-18 14:19:43,436 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-01-18 14:19:43,437 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-01-18 14:19:43,438 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-01-18 14:19:43,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:19:43,439 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 14:19:43,454 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-01-18 14:19:43,455 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-01-18 14:19:43,455 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-01-18 14:19:43,456 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-01-18 14:19:43,458 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-01-18 14:19:43,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:19:43,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-18 14:19:43,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3, 2] total 6 [2019-01-18 14:19:43,478 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 14:19:43,479 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-18 14:19:43,479 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-18 14:19:43,479 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-01-18 14:19:43,484 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-18 14:19:43,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-18 14:19:43,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-18 14:19:43,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-01-18 14:19:43,484 INFO L87 Difference]: Start difference. First operand 32 states and 109 transitions. Second operand 4 states. [2019-01-18 14:19:43,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:19:43,692 INFO L93 Difference]: Finished difference Result 39 states and 121 transitions. [2019-01-18 14:19:43,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-18 14:19:43,693 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-18 14:19:43,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 14:19:43,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-18 14:19:43,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-01-18 14:19:43,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-18 14:19:43,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-01-18 14:19:43,694 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 16 transitions. [2019-01-18 14:19:43,809 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-18 14:19:43,810 INFO L225 Difference]: With dead ends: 39 [2019-01-18 14:19:43,811 INFO L226 Difference]: Without dead ends: 36 [2019-01-18 14:19:43,811 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-01-18 14:19:43,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-18 14:19:43,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-01-18 14:19:43,945 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-18 14:19:43,945 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 35 states. [2019-01-18 14:19:43,945 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 35 states. [2019-01-18 14:19:43,946 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 35 states. [2019-01-18 14:19:43,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:19:43,948 INFO L93 Difference]: Finished difference Result 36 states and 114 transitions. [2019-01-18 14:19:43,949 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 114 transitions. [2019-01-18 14:19:43,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:19:43,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-18 14:19:43,949 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 36 states. [2019-01-18 14:19:43,950 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 36 states. [2019-01-18 14:19:43,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:19:43,951 INFO L93 Difference]: Finished difference Result 36 states and 114 transitions. [2019-01-18 14:19:43,952 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 114 transitions. [2019-01-18 14:19:43,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:19:43,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-18 14:19:43,952 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-18 14:19:43,952 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-18 14:19:43,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-18 14:19:43,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 114 transitions. [2019-01-18 14:19:43,954 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 114 transitions. Word has length 5 [2019-01-18 14:19:43,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 14:19:43,954 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 114 transitions. [2019-01-18 14:19:43,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-18 14:19:43,955 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 114 transitions. [2019-01-18 14:19:43,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 14:19:43,955 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 14:19:43,955 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 14:19:43,955 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 14:19:43,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 14:19:43,956 INFO L82 PathProgramCache]: Analyzing trace with hash 28819942, now seen corresponding path program 1 times [2019-01-18 14:19:43,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 14:19:43,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:19:43,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 14:19:43,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:19:43,957 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 14:19:43,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:19:44,048 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-01-18 14:19:44,049 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-01-18 14:19:44,050 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-01-18 14:19:44,051 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-01-18 14:19:44,051 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-01-18 14:19:44,052 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 14:19:44,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 14:19:44,052 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 14:19:44,053 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 14:19:44,053 INFO L207 CegarAbsIntRunner]: [0], [6], [12], [16], [17] [2019-01-18 14:19:44,054 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 14:19:44,054 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 14:19:44,076 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 14:19:44,076 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 38 root evaluator evaluations with a maximum evaluation depth of 2. Performed 38 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 14:19:44,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 14:19:44,076 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 14:19:44,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 14:19:44,077 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-01-18 14:19:44,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 14:19:44,094 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 14:19:44,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:19:44,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:19:44,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 14:19:44,142 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-01-18 14:19:44,150 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-01-18 14:19:44,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:44,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:44,159 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-01-18 14:19:44,162 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 14:19:44,173 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:19:44,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:19:44,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:44,200 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-01-18 14:19:44,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:44,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:44,281 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-01-18 14:19:44,285 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 14:19:44,291 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:19:44,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:19:44,303 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-01-18 14:19:44,316 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:19:44,316 WARN L385 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-01-18 14:19:44,317 WARN L386 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-01-18 14:19:44,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:44,361 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-01-18 14:19:44,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 14:19:44,378 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-01-18 14:19:44,379 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-18 14:19:46,390 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:19:46,390 WARN L385 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-01-18 14:19:46,390 WARN L386 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-01-18 14:19:46,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:46,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:46,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:46,434 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 14:19:46,435 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-01-18 14:19:46,438 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 14:19:46,452 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-01-18 14:19:46,452 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2019-01-18 14:19:46,469 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:19:46,469 WARN L385 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-01-18 14:19:46,469 WARN L386 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-01-18 14:19:46,496 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-01-18 14:19:46,497 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-01-18 14:19:46,499 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-01-18 14:19:46,500 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-01-18 14:19:46,501 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-01-18 14:19:46,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:19:46,502 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 14:19:46,543 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-01-18 14:19:46,544 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-01-18 14:19:46,545 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-01-18 14:19:46,547 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-01-18 14:19:46,549 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-01-18 14:19:46,549 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:19:46,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 14:19:46,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-18 14:19:46,570 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 14:19:46,570 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 5 [2019-01-18 14:19:46,570 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-18 14:19:46,570 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2019-01-18 14:19:46,583 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-18 14:19:46,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-18 14:19:46,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-18 14:19:46,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-18 14:19:46,584 INFO L87 Difference]: Start difference. First operand 35 states and 114 transitions. Second operand 7 states. [2019-01-18 14:19:47,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:19:47,209 INFO L93 Difference]: Finished difference Result 38 states and 119 transitions. [2019-01-18 14:19:47,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 14:19:47,209 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 5 [2019-01-18 14:19:47,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 14:19:47,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-18 14:19:47,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 25 transitions. [2019-01-18 14:19:47,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-18 14:19:47,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 25 transitions. [2019-01-18 14:19:47,211 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 25 transitions. [2019-01-18 14:19:47,247 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-18 14:19:47,248 INFO L225 Difference]: With dead ends: 38 [2019-01-18 14:19:47,249 INFO L226 Difference]: Without dead ends: 35 [2019-01-18 14:19:47,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-18 14:19:47,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-18 14:19:47,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2019-01-18 14:19:47,404 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-18 14:19:47,404 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 32 states. [2019-01-18 14:19:47,405 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 32 states. [2019-01-18 14:19:47,405 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 32 states. [2019-01-18 14:19:47,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:19:47,407 INFO L93 Difference]: Finished difference Result 35 states and 114 transitions. [2019-01-18 14:19:47,407 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 114 transitions. [2019-01-18 14:19:47,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:19:47,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-18 14:19:47,407 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 35 states. [2019-01-18 14:19:47,408 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 35 states. [2019-01-18 14:19:47,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:19:47,409 INFO L93 Difference]: Finished difference Result 35 states and 114 transitions. [2019-01-18 14:19:47,409 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 114 transitions. [2019-01-18 14:19:47,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:19:47,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-18 14:19:47,410 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-18 14:19:47,410 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-18 14:19:47,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-18 14:19:47,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 105 transitions. [2019-01-18 14:19:47,412 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 105 transitions. Word has length 5 [2019-01-18 14:19:47,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 14:19:47,412 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 105 transitions. [2019-01-18 14:19:47,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-18 14:19:47,412 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 105 transitions. [2019-01-18 14:19:47,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 14:19:47,412 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 14:19:47,412 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 14:19:47,413 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 14:19:47,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 14:19:47,413 INFO L82 PathProgramCache]: Analyzing trace with hash 28933340, now seen corresponding path program 1 times [2019-01-18 14:19:47,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 14:19:47,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:19:47,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 14:19:47,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:19:47,414 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 14:19:47,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:19:47,546 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-01-18 14:19:47,547 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-01-18 14:19:47,552 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-01-18 14:19:47,552 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-01-18 14:19:47,554 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-01-18 14:19:47,554 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:19:47,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 14:19:47,554 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 14:19:47,555 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 14:19:47,555 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [17] [2019-01-18 14:19:47,566 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 14:19:47,566 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 14:19:47,586 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 14:19:47,586 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 38 root evaluator evaluations with a maximum evaluation depth of 2. Performed 38 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 14:19:47,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 14:19:47,586 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 14:19:47,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 14:19:47,586 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-01-18 14:19:47,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 14:19:47,605 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 14:19:47,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:19:47,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:19:47,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 14:19:47,664 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-01-18 14:19:47,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 14:19:47,678 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-01-18 14:19:47,693 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-01-18 14:19:47,703 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-01-18 14:19:47,706 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-18 14:19:47,718 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:19:47,727 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:19:47,743 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-01-18 14:19:47,744 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:21, output treesize:20 [2019-01-18 14:19:47,752 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:19:47,752 WARN L385 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-01-18 14:19:47,753 WARN L386 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-01-18 14:19:47,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:47,826 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-01-18 14:19:47,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 14:19:47,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:19:47,840 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-01-18 14:19:47,851 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:19:47,852 WARN L385 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-01-18 14:19:47,852 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select |#memory_int| ULTIMATE.start_main_p1) 0) (= (- 1) (select |#memory_int| ULTIMATE.start_main_p2))) [2019-01-18 14:19:47,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:47,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:47,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:47,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:47,909 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-01-18 14:19:47,912 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 14:19:47,920 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-01-18 14:19:47,921 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2019-01-18 14:19:49,940 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:19:49,940 WARN L385 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-01-18 14:19:49,940 WARN L386 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-01-18 14:19:49,965 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-01-18 14:19:49,967 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-01-18 14:19:49,968 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-01-18 14:19:49,969 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-01-18 14:19:49,970 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-01-18 14:19:49,971 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:19:49,971 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 14:19:50,012 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-01-18 14:19:50,013 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-01-18 14:19:50,014 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-01-18 14:19:50,015 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-01-18 14:19:50,016 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-01-18 14:19:50,017 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:19:50,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 14:19:50,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 14:19:50,037 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 14:19:50,037 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-18 14:19:50,037 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-18 14:19:50,037 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2019-01-18 14:19:50,049 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-18 14:19:50,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 14:19:50,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 14:19:50,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-18 14:19:50,050 INFO L87 Difference]: Start difference. First operand 32 states and 105 transitions. Second operand 8 states. [2019-01-18 14:19:50,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:19:50,627 INFO L93 Difference]: Finished difference Result 45 states and 131 transitions. [2019-01-18 14:19:50,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 14:19:50,628 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-18 14:19:50,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 14:19:50,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-18 14:19:50,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2019-01-18 14:19:50,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-18 14:19:50,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2019-01-18 14:19:50,630 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 32 transitions. [2019-01-18 14:19:50,690 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-18 14:19:50,692 INFO L225 Difference]: With dead ends: 45 [2019-01-18 14:19:50,692 INFO L226 Difference]: Without dead ends: 44 [2019-01-18 14:19:50,692 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-01-18 14:19:50,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-18 14:19:50,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2019-01-18 14:19:50,943 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-18 14:19:50,943 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 36 states. [2019-01-18 14:19:50,943 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 36 states. [2019-01-18 14:19:50,943 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 36 states. [2019-01-18 14:19:50,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:19:50,945 INFO L93 Difference]: Finished difference Result 44 states and 129 transitions. [2019-01-18 14:19:50,945 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 129 transitions. [2019-01-18 14:19:50,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:19:50,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-18 14:19:50,946 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 44 states. [2019-01-18 14:19:50,946 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 44 states. [2019-01-18 14:19:50,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:19:50,948 INFO L93 Difference]: Finished difference Result 44 states and 129 transitions. [2019-01-18 14:19:50,948 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 129 transitions. [2019-01-18 14:19:50,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:19:50,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-18 14:19:50,948 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-18 14:19:50,948 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-18 14:19:50,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-18 14:19:50,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 120 transitions. [2019-01-18 14:19:50,950 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 120 transitions. Word has length 5 [2019-01-18 14:19:50,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 14:19:50,950 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 120 transitions. [2019-01-18 14:19:50,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 14:19:50,950 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 120 transitions. [2019-01-18 14:19:50,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 14:19:50,951 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 14:19:50,951 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 14:19:50,951 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 14:19:50,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 14:19:50,952 INFO L82 PathProgramCache]: Analyzing trace with hash 28939106, now seen corresponding path program 1 times [2019-01-18 14:19:50,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 14:19:50,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:19:50,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 14:19:50,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:19:50,953 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 14:19:50,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:19:51,030 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-01-18 14:19:51,031 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-01-18 14:19:51,032 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-01-18 14:19:51,033 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-01-18 14:19:51,034 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-01-18 14:19:51,034 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:19:51,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 14:19:51,034 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 14:19:51,035 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 14:19:51,035 INFO L207 CegarAbsIntRunner]: [0], [10], [12], [16], [17] [2019-01-18 14:19:51,036 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 14:19:51,036 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 14:19:51,049 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 14:19:51,049 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 38 root evaluator evaluations with a maximum evaluation depth of 2. Performed 38 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 14:19:51,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 14:19:51,050 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 14:19:51,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 14:19:51,050 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-01-18 14:19:51,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 14:19:51,061 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 14:19:51,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:19:51,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:19:51,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 14:19:51,084 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-01-18 14:19:51,097 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-01-18 14:19:51,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:51,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:51,110 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-01-18 14:19:51,118 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 14:19:51,131 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:19:51,139 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:19:51,152 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-01-18 14:19:51,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:51,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:51,172 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-01-18 14:19:51,174 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 14:19:51,185 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:19:51,197 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-01-18 14:19:51,197 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:24, output treesize:24 [2019-01-18 14:19:51,201 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:19:51,201 WARN L385 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-01-18 14:19:51,201 WARN L386 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-01-18 14:19:51,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:51,241 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-01-18 14:19:51,243 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 14:19:51,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:19:51,251 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-01-18 14:19:51,262 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:19:51,262 WARN L385 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-01-18 14:19:51,262 WARN L386 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (- 1) (select |#memory_int| ULTIMATE.start_main_p2)) (= (select |#memory_int| ULTIMATE.start_main_p3) 0)) [2019-01-18 14:19:51,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:51,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:51,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:51,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:51,323 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-01-18 14:19:51,328 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 14:19:51,335 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-01-18 14:19:51,335 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2019-01-18 14:19:53,408 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:19:53,409 WARN L385 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-01-18 14:19:53,409 WARN L386 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-01-18 14:19:53,455 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-01-18 14:19:53,456 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-01-18 14:19:53,457 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-01-18 14:19:53,458 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-01-18 14:19:53,459 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-01-18 14:19:53,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:19:53,460 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 14:19:53,500 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-01-18 14:19:53,500 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-01-18 14:19:53,501 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-01-18 14:19:53,503 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-01-18 14:19:53,504 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-01-18 14:19:53,505 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:19:53,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 14:19:53,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-18 14:19:53,524 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 14:19:53,525 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-18 14:19:53,525 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-18 14:19:53,525 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2019-01-18 14:19:53,535 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-18 14:19:53,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 14:19:53,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 14:19:53,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-18 14:19:53,536 INFO L87 Difference]: Start difference. First operand 36 states and 120 transitions. Second operand 8 states. [2019-01-18 14:19:53,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:19:53,984 INFO L93 Difference]: Finished difference Result 52 states and 158 transitions. [2019-01-18 14:19:53,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 14:19:53,985 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-18 14:19:53,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 14:19:53,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-18 14:19:53,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2019-01-18 14:19:53,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-18 14:19:53,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2019-01-18 14:19:53,986 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 33 transitions. [2019-01-18 14:19:54,029 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-18 14:19:54,031 INFO L225 Difference]: With dead ends: 52 [2019-01-18 14:19:54,032 INFO L226 Difference]: Without dead ends: 51 [2019-01-18 14:19:54,032 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-01-18 14:19:54,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-18 14:19:54,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 43. [2019-01-18 14:19:54,241 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-18 14:19:54,241 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 43 states. [2019-01-18 14:19:54,241 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 43 states. [2019-01-18 14:19:54,242 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 43 states. [2019-01-18 14:19:54,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:19:54,244 INFO L93 Difference]: Finished difference Result 51 states and 156 transitions. [2019-01-18 14:19:54,244 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 156 transitions. [2019-01-18 14:19:54,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:19:54,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-18 14:19:54,244 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 51 states. [2019-01-18 14:19:54,245 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 51 states. [2019-01-18 14:19:54,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:19:54,246 INFO L93 Difference]: Finished difference Result 51 states and 156 transitions. [2019-01-18 14:19:54,247 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 156 transitions. [2019-01-18 14:19:54,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:19:54,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-18 14:19:54,247 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-18 14:19:54,247 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-18 14:19:54,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-18 14:19:54,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 151 transitions. [2019-01-18 14:19:54,249 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 151 transitions. Word has length 5 [2019-01-18 14:19:54,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 14:19:54,249 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 151 transitions. [2019-01-18 14:19:54,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 14:19:54,250 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 151 transitions. [2019-01-18 14:19:54,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 14:19:54,250 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 14:19:54,250 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 14:19:54,250 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 14:19:54,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 14:19:54,251 INFO L82 PathProgramCache]: Analyzing trace with hash 28992734, now seen corresponding path program 1 times [2019-01-18 14:19:54,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 14:19:54,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:19:54,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 14:19:54,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:19:54,252 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 14:19:54,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:19:54,702 WARN L181 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2019-01-18 14:19:54,766 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-01-18 14:19:54,767 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-01-18 14:19:54,769 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-01-18 14:19:54,770 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-01-18 14:19:54,782 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-01-18 14:19:54,783 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:19:54,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 14:19:54,783 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 14:19:54,783 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-18 14:19:54,784 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [12], [15] [2019-01-18 14:19:54,785 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 14:19:54,785 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 14:19:54,798 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 14:19:54,799 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 38 root evaluator evaluations with a maximum evaluation depth of 2. Performed 38 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 14:19:54,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 14:19:54,799 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 14:19:54,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 14:19:54,799 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-01-18 14:19:54,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 14:19:54,808 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 14:19:54,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:19:54,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:19:54,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 14:19:54,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:54,962 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-01-18 14:19:54,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:54,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:55,000 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-01-18 14:19:55,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 14:19:55,008 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:19:55,021 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-01-18 14:19:55,027 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-01-18 14:19:55,037 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-01-18 14:19:55,052 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 14:19:55,060 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:19:55,068 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:19:55,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:19:55,082 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-01-18 14:19:55,087 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:19:55,088 WARN L385 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-01-18 14:19:55,088 WARN L386 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-01-18 14:19:55,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:55,133 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-01-18 14:19:55,136 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 14:19:55,151 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-01-18 14:19:55,151 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-18 14:19:57,268 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:19:57,269 WARN L385 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-01-18 14:19:57,269 WARN L386 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-01-18 14:19:57,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:57,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:57,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:57,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:57,357 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 14:19:57,357 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-01-18 14:19:57,360 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 14:19:57,375 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-01-18 14:19:57,375 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:20 [2019-01-18 14:19:57,385 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:19:57,385 WARN L385 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-01-18 14:19:57,385 WARN L386 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-01-18 14:19:57,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:57,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:57,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:57,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:57,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:57,427 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-01-18 14:19:57,430 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 14:19:57,447 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-01-18 14:19:57,447 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:20 [2019-01-18 14:19:57,458 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:19:57,459 WARN L385 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-01-18 14:19:57,459 WARN L386 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-01-18 14:19:57,481 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-01-18 14:19:57,482 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-01-18 14:19:57,484 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-01-18 14:19:57,486 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-01-18 14:19:57,487 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-01-18 14:19:57,488 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:19:57,488 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 14:19:57,540 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-01-18 14:19:57,541 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-01-18 14:19:57,543 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-01-18 14:19:57,544 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-01-18 14:19:57,546 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-01-18 14:19:57,547 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:19:57,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 14:19:57,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-18 14:19:57,567 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 14:19:57,568 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-18 14:19:57,568 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-18 14:19:57,568 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2019-01-18 14:19:57,580 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-18 14:19:57,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 14:19:57,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 14:19:57,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-01-18 14:19:57,581 INFO L87 Difference]: Start difference. First operand 43 states and 151 transitions. Second operand 10 states. [2019-01-18 14:19:58,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:19:58,322 INFO L93 Difference]: Finished difference Result 49 states and 162 transitions. [2019-01-18 14:19:58,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 14:19:58,322 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-18 14:19:58,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 14:19:58,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-18 14:19:58,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2019-01-18 14:19:58,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-18 14:19:58,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2019-01-18 14:19:58,323 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 29 transitions. [2019-01-18 14:19:58,735 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-18 14:19:58,736 INFO L225 Difference]: With dead ends: 49 [2019-01-18 14:19:58,736 INFO L226 Difference]: Without dead ends: 48 [2019-01-18 14:19:58,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=108, Unknown=0, NotChecked=0, Total=182 [2019-01-18 14:19:58,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-18 14:19:58,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 23. [2019-01-18 14:19:58,878 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-18 14:19:58,878 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 23 states. [2019-01-18 14:19:58,879 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 23 states. [2019-01-18 14:19:58,879 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 23 states. [2019-01-18 14:19:58,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:19:58,881 INFO L93 Difference]: Finished difference Result 48 states and 151 transitions. [2019-01-18 14:19:58,881 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 151 transitions. [2019-01-18 14:19:58,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:19:58,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-18 14:19:58,882 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 48 states. [2019-01-18 14:19:58,882 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 48 states. [2019-01-18 14:19:58,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:19:58,883 INFO L93 Difference]: Finished difference Result 48 states and 151 transitions. [2019-01-18 14:19:58,883 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 151 transitions. [2019-01-18 14:19:58,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:19:58,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-18 14:19:58,884 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-18 14:19:58,884 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-18 14:19:58,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-18 14:19:58,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 66 transitions. [2019-01-18 14:19:58,885 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 66 transitions. Word has length 5 [2019-01-18 14:19:58,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 14:19:58,885 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 66 transitions. [2019-01-18 14:19:58,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 14:19:58,886 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 66 transitions. [2019-01-18 14:19:58,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 14:19:58,886 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 14:19:58,886 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 14:19:58,886 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 14:19:58,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 14:19:58,887 INFO L82 PathProgramCache]: Analyzing trace with hash 893358670, now seen corresponding path program 1 times [2019-01-18 14:19:58,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 14:19:58,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:19:58,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 14:19:58,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:19:58,888 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 14:19:58,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:19:59,158 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-01-18 14:19:59,160 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-01-18 14:19:59,161 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-01-18 14:19:59,162 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-01-18 14:19:59,162 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-01-18 14:19:59,163 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-01-18 14:19:59,164 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:19:59,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 14:19:59,164 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 14:19:59,164 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 14:19:59,165 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [18], [19] [2019-01-18 14:19:59,166 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 14:19:59,166 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 14:19:59,181 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 14:19:59,182 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 40 root evaluator evaluations with a maximum evaluation depth of 2. Performed 40 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-18 14:19:59,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 14:19:59,182 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 14:19:59,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 14:19:59,182 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-01-18 14:19:59,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 14:19:59,191 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 14:19:59,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:19:59,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:19:59,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 14:19:59,218 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-01-18 14:19:59,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-01-18 14:19:59,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:59,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:59,237 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-01-18 14:19:59,248 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-18 14:19:59,258 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:19:59,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:19:59,278 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-01-18 14:19:59,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:59,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:59,300 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-01-18 14:19:59,307 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 14:19:59,311 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:19:59,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:19:59,323 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:24, output treesize:24 [2019-01-18 14:19:59,328 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:19:59,328 WARN L385 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-01-18 14:19:59,329 WARN L386 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-01-18 14:19:59,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:59,383 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-01-18 14:19:59,387 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-18 14:19:59,420 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-01-18 14:19:59,420 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2019-01-18 14:19:59,432 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:19:59,433 WARN L385 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-01-18 14:19:59,433 WARN L386 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-01-18 14:19:59,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:59,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:59,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:59,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:59,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:59,492 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-01-18 14:19:59,498 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 14:19:59,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:59,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:59,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:19:59,529 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 14:19:59,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, 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-01-18 14:19:59,533 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 14:19:59,552 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-01-18 14:19:59,552 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:32 [2019-01-18 14:20:01,673 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:20:01,674 WARN L385 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-01-18 14:20:01,674 WARN L386 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-01-18 14:20:01,780 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-01-18 14:20:01,782 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-01-18 14:20:01,784 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-01-18 14:20:01,785 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-01-18 14:20:01,785 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-01-18 14:20:01,787 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-01-18 14:20:01,787 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:20:01,788 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 14:20:01,917 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-01-18 14:20:01,918 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-01-18 14:20:01,918 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-01-18 14:20:01,920 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-01-18 14:20:01,921 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-01-18 14:20:01,923 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-01-18 14:20:01,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:20:01,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 14:20:01,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2019-01-18 14:20:01,945 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 14:20:01,945 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-18 14:20:01,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-18 14:20:01,945 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2019-01-18 14:20:01,965 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-18 14:20:01,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 14:20:01,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 14:20:01,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-01-18 14:20:01,966 INFO L87 Difference]: Start difference. First operand 23 states and 66 transitions. Second operand 10 states. [2019-01-18 14:20:02,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:20:02,914 INFO L93 Difference]: Finished difference Result 28 states and 74 transitions. [2019-01-18 14:20:02,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 14:20:02,915 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-18 14:20:02,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 14:20:02,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-18 14:20:02,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2019-01-18 14:20:02,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-18 14:20:02,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2019-01-18 14:20:02,916 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 29 transitions. [2019-01-18 14:20:02,975 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-18 14:20:02,976 INFO L225 Difference]: With dead ends: 28 [2019-01-18 14:20:02,976 INFO L226 Difference]: Without dead ends: 21 [2019-01-18 14:20:02,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2019-01-18 14:20:02,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-18 14:20:03,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2019-01-18 14:20:03,277 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-18 14:20:03,277 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 19 states. [2019-01-18 14:20:03,278 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 19 states. [2019-01-18 14:20:03,278 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 19 states. [2019-01-18 14:20:03,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:20:03,279 INFO L93 Difference]: Finished difference Result 21 states and 58 transitions. [2019-01-18 14:20:03,280 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 58 transitions. [2019-01-18 14:20:03,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:20:03,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-18 14:20:03,280 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 21 states. [2019-01-18 14:20:03,280 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 21 states. [2019-01-18 14:20:03,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:20:03,281 INFO L93 Difference]: Finished difference Result 21 states and 58 transitions. [2019-01-18 14:20:03,281 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 58 transitions. [2019-01-18 14:20:03,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:20:03,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-18 14:20:03,281 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-18 14:20:03,281 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-18 14:20:03,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-18 14:20:03,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 52 transitions. [2019-01-18 14:20:03,282 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 52 transitions. Word has length 6 [2019-01-18 14:20:03,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 14:20:03,282 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 52 transitions. [2019-01-18 14:20:03,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 14:20:03,282 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 52 transitions. [2019-01-18 14:20:03,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 14:20:03,283 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 14:20:03,283 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 14:20:03,283 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-18 14:20:03,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 14:20:03,283 INFO L82 PathProgramCache]: Analyzing trace with hash 893354762, now seen corresponding path program 1 times [2019-01-18 14:20:03,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 14:20:03,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:20:03,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 14:20:03,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 14:20:03,284 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 14:20:03,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:20:03,406 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-01-18 14:20:03,407 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-01-18 14:20:03,408 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-01-18 14:20:03,409 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-01-18 14:20:03,410 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-01-18 14:20:03,411 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-01-18 14:20:03,411 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-18 14:20:03,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 14:20:03,412 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 14:20:03,412 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 14:20:03,412 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [12], [16], [17] [2019-01-18 14:20:03,414 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 14:20:03,414 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 14:20:03,426 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 14:20:03,426 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 40 root evaluator evaluations with a maximum evaluation depth of 2. Performed 40 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-18 14:20:03,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 14:20:03,427 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 14:20:03,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 14:20:03,427 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-01-18 14:20:03,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 14:20:03,439 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 14:20:03,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:20:03,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 14:20:03,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 14:20:03,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:03,516 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-01-18 14:20:03,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:03,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:03,554 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-01-18 14:20:03,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-18 14:20:03,565 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:20:03,577 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-01-18 14:20:03,585 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-01-18 14:20:03,593 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-01-18 14:20:03,596 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-18 14:20:03,606 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:20:03,613 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:20:03,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 14:20:03,625 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-01-18 14:20:03,629 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:20:03,630 WARN L385 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-01-18 14:20:03,630 WARN L386 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-01-18 14:20:03,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:03,676 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-01-18 14:20:03,683 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 14:20:03,696 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-01-18 14:20:03,697 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-01-18 14:20:05,711 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:20:05,711 WARN L385 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-01-18 14:20:05,711 WARN L386 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-01-18 14:20:05,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:05,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:05,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:05,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:05,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:05,760 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-01-18 14:20:05,763 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 14:20:05,776 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-01-18 14:20:05,777 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:16 [2019-01-18 14:20:05,789 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:20:05,789 WARN L385 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-01-18 14:20:05,789 WARN L386 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-01-18 14:20:05,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:05,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:05,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:05,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:05,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:05,829 INFO L683 Elim1Store]: detected equality via solver [2019-01-18 14:20:05,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-18 14:20:05,832 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-01-18 14:20:05,839 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 14:20:05,855 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-01-18 14:20:05,855 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:22 [2019-01-18 14:20:05,942 WARN L384 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-01-18 14:20:05,943 WARN L385 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-01-18 14:20:05,943 WARN L386 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-01-18 14:20:05,975 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-01-18 14:20:05,977 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-01-18 14:20:05,978 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-01-18 14:20:05,980 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-01-18 14:20:05,981 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-01-18 14:20:05,982 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-01-18 14:20:05,983 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:20:05,983 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 14:20:06,056 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-01-18 14:20:06,057 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-01-18 14:20:06,058 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-01-18 14:20:06,059 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-01-18 14:20:06,061 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-01-18 14:20:06,063 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-01-18 14:20:06,064 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 14:20:06,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 14:20:06,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-18 14:20:06,084 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 14:20:06,085 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-18 14:20:06,085 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-18 14:20:06,085 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2019-01-18 14:20:06,101 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-18 14:20:06,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 14:20:06,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 14:20:06,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-01-18 14:20:06,102 INFO L87 Difference]: Start difference. First operand 19 states and 52 transitions. Second operand 10 states. [2019-01-18 14:20:06,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:20:06,950 INFO L93 Difference]: Finished difference Result 22 states and 60 transitions. [2019-01-18 14:20:06,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 14:20:06,950 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-18 14:20:06,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 14:20:06,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-18 14:20:06,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 23 transitions. [2019-01-18 14:20:06,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-18 14:20:06,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 23 transitions. [2019-01-18 14:20:06,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 23 transitions. [2019-01-18 14:20:06,987 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-18 14:20:06,988 INFO L225 Difference]: With dead ends: 22 [2019-01-18 14:20:06,988 INFO L226 Difference]: Without dead ends: 0 [2019-01-18 14:20:06,989 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-01-18 14:20:06,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-18 14:20:06,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-18 14:20:06,989 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-18 14:20:06,989 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-01-18 14:20:06,990 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-01-18 14:20:06,990 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-01-18 14:20:06,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:20:06,990 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-18 14:20:06,990 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-18 14:20:06,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:20:06,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-18 14:20:06,990 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-01-18 14:20:06,990 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-01-18 14:20:06,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 14:20:06,991 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-18 14:20:06,991 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-18 14:20:06,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:20:06,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-18 14:20:06,991 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-18 14:20:06,991 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-18 14:20:06,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-18 14:20:06,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-18 14:20:06,991 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2019-01-18 14:20:06,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 14:20:06,992 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-18 14:20:06,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 14:20:06,992 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-18 14:20:06,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-18 14:20:06,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-18 14:20:07,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 14:20:07,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 14:20:07,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 14:20:07,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-18 14:20:07,145 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 124 [2019-01-18 14:20:09,135 WARN L181 SmtUtils]: Spent 1.97 s on a formula simplification. DAG size of input: 120 DAG size of output: 32 [2019-01-18 14:20:09,140 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 35) no Hoare annotation was computed. [2019-01-18 14:20:09,140 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-01-18 14:20:09,140 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-01-18 14:20:09,141 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-01-18 14:20:09,141 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 39) no Hoare annotation was computed. [2019-01-18 14:20:09,141 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-01-18 14:20:09,141 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 37) no Hoare annotation was computed. [2019-01-18 14:20:09,141 INFO L448 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-01-18 14:20:09,142 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 36) no Hoare annotation was computed. [2019-01-18 14:20:09,144 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2019-01-18 14:20:09,144 WARN L170 areAnnotationChecker]: ULTIMATE.startErr0ASSERT_VIOLATIONASSERT has no Hoare annotation [2019-01-18 14:20:09,144 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2019-01-18 14:20:09,151 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2019-01-18 14:20:09,152 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2019-01-18 14:20:09,152 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2019-01-18 14:20:09,152 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2019-01-18 14:20:09,152 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2019-01-18 14:20:09,152 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-01-18 14:20:09,160 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-3-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.01 02:20:09 BoogieIcfgContainer [2019-01-18 14:20:09,160 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-18 14:20:09,162 INFO L168 Benchmark]: Toolchain (without parser) took 44587.73 ms. Allocated memory was 133.7 MB in the beginning and 408.9 MB in the end (delta: 275.3 MB). Free memory was 107.7 MB in the beginning and 316.0 MB in the end (delta: -208.3 MB). Peak memory consumption was 66.9 MB. Max. memory is 7.1 GB. [2019-01-18 14:20:09,162 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 133.7 MB. Free memory is still 109.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-18 14:20:09,163 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.86 ms. Allocated memory is still 133.7 MB. Free memory was 107.7 MB in the beginning and 105.3 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2019-01-18 14:20:09,163 INFO L168 Benchmark]: Boogie Preprocessor took 27.77 ms. Allocated memory is still 133.7 MB. Free memory was 105.3 MB in the beginning and 104.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-01-18 14:20:09,163 INFO L168 Benchmark]: RCFGBuilder took 593.33 ms. Allocated memory is still 133.7 MB. Free memory was 104.1 MB in the beginning and 92.0 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 7.1 GB. [2019-01-18 14:20:09,164 INFO L168 Benchmark]: TraceAbstraction took 43902.13 ms. Allocated memory was 133.7 MB in the beginning and 408.9 MB in the end (delta: 275.3 MB). Free memory was 91.6 MB in the beginning and 316.0 MB in the end (delta: -224.4 MB). Peak memory consumption was 50.8 MB. Max. memory is 7.1 GB. [2019-01-18 14:20:09,166 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.21 ms. Allocated memory is still 133.7 MB. Free memory is still 109.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.86 ms. Allocated memory is still 133.7 MB. Free memory was 107.7 MB in the beginning and 105.3 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.77 ms. Allocated memory is still 133.7 MB. Free memory was 105.3 MB in the beginning and 104.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 593.33 ms. Allocated memory is still 133.7 MB. Free memory was 104.1 MB in the beginning and 92.0 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 43902.13 ms. Allocated memory was 133.7 MB in the beginning and 408.9 MB in the end (delta: 275.3 MB). Free memory was 91.6 MB in the beginning and 316.0 MB in the end (delta: -224.4 MB). Peak memory consumption was 50.8 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: 35]: 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 - 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, 43.8s OverallTime, 17 OverallIterations, 1 TraceHistogramMax, 9.0s AutomataDifference, 0.0s DeadEndRemovalTime, 2.1s 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.7s 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, 0.4s AbstIntTime, 14 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s 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.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 28.8s 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...