java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/toy/WaterTank1.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:40:52,554 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:40:52,559 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:40:52,574 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:40:52,574 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:40:52,576 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:40:52,578 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:40:52,581 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:40:52,583 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:40:52,584 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:40:52,585 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:40:52,585 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:40:52,586 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:40:52,587 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:40:52,588 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:40:52,589 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:40:52,592 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:40:52,593 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:40:52,594 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:40:52,598 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:40:52,601 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:40:52,602 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:40:52,604 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:40:52,605 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:40:52,608 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:40:52,609 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:40:52,609 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:40:52,610 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:40:52,611 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:40:52,612 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:40:52,612 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:40:52,615 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:40:52,616 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:40:52,617 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:40:52,619 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:40:52,620 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:40:52,621 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:40:52,621 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:40:52,622 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:40:52,623 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:40:52,624 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:40:52,668 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:40:52,679 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:40:52,683 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:40:52,684 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:40:52,685 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:40:52,685 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/WaterTank1.bpl [2019-08-05 10:40:52,686 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/WaterTank1.bpl' [2019-08-05 10:40:52,717 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:40:52,718 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:40:52,719 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:40:52,719 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:40:52,719 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:40:52,737 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "WaterTank1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:40:52" (1/1) ... [2019-08-05 10:40:52,745 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "WaterTank1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:40:52" (1/1) ... [2019-08-05 10:40:52,750 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:40:52,751 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:40:52,751 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:40:52,753 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:40:52,754 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:40:52,754 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:40:52,754 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:40:52,764 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "WaterTank1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:40:52" (1/1) ... [2019-08-05 10:40:52,765 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "WaterTank1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:40:52" (1/1) ... [2019-08-05 10:40:52,765 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "WaterTank1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:40:52" (1/1) ... [2019-08-05 10:40:52,766 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "WaterTank1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:40:52" (1/1) ... [2019-08-05 10:40:52,768 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "WaterTank1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:40:52" (1/1) ... [2019-08-05 10:40:52,772 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "WaterTank1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:40:52" (1/1) ... [2019-08-05 10:40:52,773 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "WaterTank1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:40:52" (1/1) ... [2019-08-05 10:40:52,774 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:40:52,774 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:40:52,774 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:40:52,775 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:40:52,775 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "WaterTank1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:40:52" (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:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:40:52,829 INFO L124 BoogieDeclarations]: Specification and implementation of procedure waterTank given in one single declaration [2019-08-05 10:40:52,829 INFO L130 BoogieDeclarations]: Found specification of procedure waterTank [2019-08-05 10:40:52,829 INFO L138 BoogieDeclarations]: Found implementation of procedure waterTank [2019-08-05 10:40:53,091 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:40:53,091 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:40:53,092 INFO L202 PluginConnector]: Adding new model WaterTank1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:40:53 BoogieIcfgContainer [2019-08-05 10:40:53,092 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:40:53,094 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:40:53,094 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:40:53,097 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:40:53,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "WaterTank1.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:40:52" (1/2) ... [2019-08-05 10:40:53,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@514b37ba and model type WaterTank1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:40:53, skipping insertion in model container [2019-08-05 10:40:53,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "WaterTank1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:40:53" (2/2) ... [2019-08-05 10:40:53,102 INFO L109 eAbstractionObserver]: Analyzing ICFG WaterTank1.bpl [2019-08-05 10:40:53,111 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:40:53,118 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:40:53,132 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:40:53,155 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:40:53,155 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:40:53,156 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:40:53,156 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:40:53,156 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:40:53,156 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:40:53,156 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:40:53,156 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:40:53,157 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:40:53,169 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:40:53,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:40:53,177 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:53,178 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:40:53,180 INFO L418 AbstractCegarLoop]: === Iteration 1 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:53,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:53,186 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2019-08-05 10:40:53,231 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:53,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:53,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:40:53,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:53,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:53,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:40:53,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:40:53,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:40:53,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:40:53,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:40:53,326 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:40:53,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:53,378 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:40:53,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:40:53,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:40:53,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:53,393 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:40:53,393 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:40:53,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-08-05 10:40:53,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:40:53,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:40:53,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:40:53,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:40:53,427 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:40:53,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:53,428 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:40:53,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:40:53,428 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:40:53,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:40:53,428 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:53,429 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:40:53,429 INFO L418 AbstractCegarLoop]: === Iteration 2 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:53,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:53,430 INFO L82 PathProgramCache]: Analyzing trace with hash 927558, now seen corresponding path program 1 times [2019-08-05 10:40:53,431 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:53,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:53,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:40:53,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:53,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:53,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:53,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:40:53,553 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:40:53,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:40:53,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:40:53,554 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:40:53,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:53,620 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:40:53,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:40:53,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:40:53,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:53,622 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:40:53,622 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:40:53,623 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:40:53,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:40:53,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:40:53,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:40:53,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:40:53,625 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:40:53,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:53,626 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:40:53,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:40:53,626 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:40:53,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:40:53,626 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:53,627 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:40:53,627 INFO L418 AbstractCegarLoop]: === Iteration 3 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:53,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:53,627 INFO L82 PathProgramCache]: Analyzing trace with hash 28752352, now seen corresponding path program 2 times [2019-08-05 10:40:53,628 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:53,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:53,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:40:53,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:53,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:53,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:53,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:40:53,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:40:53,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:40:53,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:40:53,722 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:40:53,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:53,756 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:40:53,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:40:53,757 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:40:53,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:53,757 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:40:53,757 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:40:53,758 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:40:53,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:40:53,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:40:53,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:40:53,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:40:53,760 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:40:53,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:53,761 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:40:53,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:40:53,761 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:40:53,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:40:53,762 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:53,762 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:40:53,762 INFO L418 AbstractCegarLoop]: === Iteration 4 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:53,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:53,763 INFO L82 PathProgramCache]: Analyzing trace with hash 891320966, now seen corresponding path program 3 times [2019-08-05 10:40:53,764 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:53,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:53,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:40:53,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:53,891 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:53,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:53,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:40:53,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:40:53,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:40:53,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:40:53,894 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 10:40:53,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:53,919 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:40:53,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:40:53,921 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:40:53,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:53,922 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:40:53,922 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:40:53,923 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:40:53,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:40:53,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:40:53,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:40:53,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:40:53,925 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:40:53,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:53,926 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:40:53,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:40:53,926 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:40:53,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:40:53,927 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:53,927 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:40:53,927 INFO L418 AbstractCegarLoop]: === Iteration 5 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:53,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:53,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144224, now seen corresponding path program 4 times [2019-08-05 10:40:53,929 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:53,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:53,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:40:53,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:54,120 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:54,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:54,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:40:54,121 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:40:54,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:40:54,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:40:54,122 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 10:40:54,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:54,174 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:40:54,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:40:54,175 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:40:54,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:54,175 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:40:54,175 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:40:54,176 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:40:54,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:40:54,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:40:54,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:40:54,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:40:54,178 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:40:54,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:54,179 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:40:54,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:40:54,179 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:40:54,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:40:54,179 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:54,179 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:40:54,180 INFO L418 AbstractCegarLoop]: === Iteration 6 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:54,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:54,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894150, now seen corresponding path program 5 times [2019-08-05 10:40:54,181 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:54,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:54,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 10:40:54,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:54,443 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:54,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:54,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:40:54,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:40:54,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:40:54,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:40:54,445 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-05 10:40:54,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:54,470 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:40:54,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:40:54,471 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:40:54,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:54,471 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:40:54,471 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:40:54,472 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:40:54,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:40:54,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:40:54,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:40:54,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:40:54,476 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:40:54,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:54,476 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:40:54,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:40:54,476 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:40:54,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:40:54,477 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:54,477 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:40:54,479 INFO L418 AbstractCegarLoop]: === Iteration 7 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:54,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:54,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141856, now seen corresponding path program 6 times [2019-08-05 10:40:54,480 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:54,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:54,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 10:40:54,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:54,688 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:54,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:54,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:40:54,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:40:54,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:40:54,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:40:54,691 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-05 10:40:54,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:54,801 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:40:54,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:40:54,801 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:40:54,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:54,802 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:40:54,802 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:40:54,802 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:40:54,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:40:54,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:40:54,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:40:54,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:40:54,805 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 10:40:54,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:54,806 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:40:54,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:40:54,806 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:40:54,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:40:54,807 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:54,807 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 10:40:54,807 INFO L418 AbstractCegarLoop]: === Iteration 8 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:54,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:54,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820742, now seen corresponding path program 7 times [2019-08-05 10:40:54,808 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:54,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:54,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:40:54,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:54,988 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:54,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:54,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:40:54,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:40:54,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:40:54,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:40:54,993 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-05 10:40:55,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:55,029 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:40:55,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:40:55,030 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:40:55,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:55,031 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:40:55,031 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:40:55,032 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:40:55,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:40:55,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:40:55,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:40:55,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:40:55,035 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 10:40:55,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:55,035 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:40:55,035 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:40:55,035 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:40:55,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:40:55,036 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:55,036 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:40:55,036 INFO L418 AbstractCegarLoop]: === Iteration 9 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:55,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:55,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166496, now seen corresponding path program 8 times [2019-08-05 10:40:55,038 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:55,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:55,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 10:40:55,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:55,500 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:55,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:55,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:40:55,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:40:55,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:40:55,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:40:55,503 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-05 10:40:55,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:55,538 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:40:55,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:40:55,538 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:40:55,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:55,539 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:40:55,539 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:40:55,540 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:40:55,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:40:55,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:40:55,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:40:55,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:40:55,542 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 10:40:55,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:55,542 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:40:55,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:40:55,543 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:40:55,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:40:55,543 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:55,543 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 10:40:55,544 INFO L418 AbstractCegarLoop]: === Iteration 10 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:55,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:55,544 INFO L82 PathProgramCache]: Analyzing trace with hash -562523066, now seen corresponding path program 9 times [2019-08-05 10:40:55,545 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:55,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:55,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 10:40:55,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:55,707 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:55,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:55,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:40:55,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:40:55,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:40:55,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:40:55,709 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-05 10:40:55,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:55,749 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:40:55,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:40:55,749 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:40:55,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:55,750 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:40:55,750 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:40:55,751 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:40:55,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:40:55,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:40:55,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:40:55,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:40:55,754 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 10:40:55,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:55,755 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:40:55,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:40:55,755 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:40:55,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:40:55,755 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:55,756 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 10:40:55,756 INFO L418 AbstractCegarLoop]: === Iteration 11 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:55,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:55,756 INFO L82 PathProgramCache]: Analyzing trace with hash -258347808, now seen corresponding path program 10 times [2019-08-05 10:40:55,757 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:55,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:55,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:40:55,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:55,951 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:55,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:55,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:40:55,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:40:55,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:40:55,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:40:55,953 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-08-05 10:40:55,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:55,993 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:40:55,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:40:55,994 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 10:40:55,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:55,995 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:40:55,995 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:40:55,995 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:40:55,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:40:55,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:40:55,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:40:55,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:40:55,998 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 10:40:55,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:55,998 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:40:55,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:40:55,999 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:40:55,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:40:55,999 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:55,999 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 10:40:56,000 INFO L418 AbstractCegarLoop]: === Iteration 12 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:56,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:56,000 INFO L82 PathProgramCache]: Analyzing trace with hash 581150598, now seen corresponding path program 11 times [2019-08-05 10:40:56,001 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:56,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:56,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:40:56,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:56,378 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:56,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:56,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:40:56,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:40:56,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:40:56,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:40:56,380 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-08-05 10:40:56,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:56,428 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 10:40:56,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:40:56,429 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 10:40:56,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:56,430 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:40:56,430 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:40:56,431 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:40:56,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:40:56,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:40:56,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:40:56,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:40:56,435 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 10:40:56,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:56,435 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:40:56,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:40:56,435 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:40:56,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:40:56,436 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:56,436 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 10:40:56,436 INFO L418 AbstractCegarLoop]: === Iteration 13 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:56,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:56,437 INFO L82 PathProgramCache]: Analyzing trace with hash 835797408, now seen corresponding path program 12 times [2019-08-05 10:40:56,437 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:56,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:56,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:40:56,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:56,621 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:56,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:56,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:40:56,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:40:56,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:40:56,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:40:56,624 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-05 10:40:56,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:56,650 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:40:56,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:40:56,651 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 10:40:56,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:56,652 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:40:56,652 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:40:56,653 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:40:56,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:40:56,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:40:56,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:40:56,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:40:56,656 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 10:40:56,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:56,656 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:40:56,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:40:56,656 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:40:56,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:40:56,657 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:56,657 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-05 10:40:56,657 INFO L418 AbstractCegarLoop]: === Iteration 14 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:56,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:56,658 INFO L82 PathProgramCache]: Analyzing trace with hash 139913926, now seen corresponding path program 13 times [2019-08-05 10:40:56,658 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:56,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:56,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:40:56,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:56,896 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:56,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:56,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:40:56,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:40:56,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:40:56,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:40:56,898 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-05 10:40:56,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:56,927 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 10:40:56,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:40:56,928 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 10:40:56,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:56,929 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:40:56,929 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:40:56,930 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:40:56,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:40:56,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:40:56,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:40:56,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 10:40:56,933 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 10:40:56,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:56,933 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 10:40:56,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:40:56,934 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 10:40:56,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:40:56,934 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:56,934 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-05 10:40:56,934 INFO L418 AbstractCegarLoop]: === Iteration 15 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:56,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:56,935 INFO L82 PathProgramCache]: Analyzing trace with hash 42362464, now seen corresponding path program 14 times [2019-08-05 10:40:56,936 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:56,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:56,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:40:56,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:57,133 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:57,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:57,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:40:57,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:40:57,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:40:57,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:40:57,135 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-08-05 10:40:57,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:57,342 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:40:57,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:40:57,343 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 10:40:57,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:57,344 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:40:57,344 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:40:57,345 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:40:57,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:40:57,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:40:57,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:40:57,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:40:57,353 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 10:40:57,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:57,353 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:40:57,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:40:57,353 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:40:57,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:40:57,354 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:57,354 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-05 10:40:57,354 INFO L418 AbstractCegarLoop]: === Iteration 16 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:57,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:57,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234438, now seen corresponding path program 15 times [2019-08-05 10:40:57,356 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:57,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:57,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 10:40:57,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:57,632 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:57,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:57,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:40:57,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:40:57,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:40:57,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:40:57,633 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-08-05 10:40:57,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:57,895 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 10:40:57,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:40:57,895 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 10:40:57,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:57,896 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:40:57,896 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:40:57,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:40:57,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:40:57,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:40:57,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:40:57,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:40:57,899 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 10:40:57,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:57,899 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:40:57,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:40:57,900 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:40:57,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:40:57,900 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:57,900 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 10:40:57,901 INFO L418 AbstractCegarLoop]: === Iteration 17 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:57,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:57,901 INFO L82 PathProgramCache]: Analyzing trace with hash 2055559968, now seen corresponding path program 16 times [2019-08-05 10:40:57,902 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:57,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:57,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:40:57,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:58,182 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:58,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:58,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:40:58,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:40:58,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:40:58,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:40:58,184 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-05 10:40:58,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:58,262 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:40:58,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:40:58,262 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:40:58,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:58,262 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:40:58,263 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:40:58,263 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:40:58,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:40:58,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:40:58,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:40:58,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:40:58,266 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 10:40:58,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:58,266 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:40:58,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:40:58,267 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:40:58,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:40:58,267 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:58,268 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-05 10:40:58,268 INFO L418 AbstractCegarLoop]: === Iteration 18 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:58,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:58,268 INFO L82 PathProgramCache]: Analyzing trace with hash -702152378, now seen corresponding path program 17 times [2019-08-05 10:40:58,269 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:58,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:58,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:40:58,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:58,782 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:58,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:58,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:40:58,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:40:58,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:40:58,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:40:58,784 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-08-05 10:40:58,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:58,838 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 10:40:58,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:40:58,838 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:40:58,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:58,839 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:40:58,839 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:40:58,839 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:40:58,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:40:58,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:40:58,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:40:58,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 10:40:58,842 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 10:40:58,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:58,843 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 10:40:58,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:40:58,843 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 10:40:58,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:40:58,844 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:58,844 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-05 10:40:58,844 INFO L418 AbstractCegarLoop]: === Iteration 19 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:58,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:58,844 INFO L82 PathProgramCache]: Analyzing trace with hash -291889184, now seen corresponding path program 18 times [2019-08-05 10:40:58,845 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:58,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 10:40:58,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:59,367 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:59,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:59,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:40:59,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:40:59,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:40:59,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:40:59,369 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-08-05 10:40:59,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:59,400 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 10:40:59,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:40:59,400 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 10:40:59,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:59,401 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:40:59,402 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:40:59,403 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:40:59,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:40:59,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:40:59,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:40:59,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 10:40:59,406 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-05 10:40:59,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:59,407 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 10:40:59,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:40:59,407 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 10:40:59,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:40:59,408 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:59,408 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-05 10:40:59,408 INFO L418 AbstractCegarLoop]: === Iteration 20 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:59,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:59,408 INFO L82 PathProgramCache]: Analyzing trace with hash -458632058, now seen corresponding path program 19 times [2019-08-05 10:40:59,409 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:59,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:59,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:40:59,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:40:59,843 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:40:59,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:40:59,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:40:59,844 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:40:59,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:40:59,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:40:59,845 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-08-05 10:40:59,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:40:59,881 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 10:40:59,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:40:59,882 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 10:40:59,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:40:59,883 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:40:59,883 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:40:59,884 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:40:59,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:40:59,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:40:59,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:40:59,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 10:40:59,887 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-05 10:40:59,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:40:59,888 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 10:40:59,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:40:59,888 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 10:40:59,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:40:59,888 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:40:59,889 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-05 10:40:59,889 INFO L418 AbstractCegarLoop]: === Iteration 21 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:40:59,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:40:59,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693856, now seen corresponding path program 20 times [2019-08-05 10:40:59,890 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:40:59,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:40:59,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:40:59,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:00,192 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:00,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:00,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:41:00,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:41:00,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:41:00,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:41:00,194 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-08-05 10:41:00,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:00,225 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:41:00,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:41:00,226 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-08-05 10:41:00,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:00,226 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:41:00,227 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:41:00,228 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:41:00,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:41:00,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:41:00,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:41:00,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 10:41:00,230 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-05 10:41:00,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:00,231 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 10:41:00,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:41:00,231 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 10:41:00,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:41:00,231 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:00,232 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-05 10:41:00,232 INFO L418 AbstractCegarLoop]: === Iteration 22 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:00,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:00,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161478, now seen corresponding path program 21 times [2019-08-05 10:41:00,233 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:00,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:00,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:41:00,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:00,535 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:00,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:00,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:41:00,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:41:00,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:41:00,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:41:00,536 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-08-05 10:41:00,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:00,603 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 10:41:00,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:41:00,606 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-08-05 10:41:00,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:00,606 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:41:00,606 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:41:00,607 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:41:00,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:41:00,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 10:41:00,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:41:00,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 10:41:00,610 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-05 10:41:00,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:00,610 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 10:41:00,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:41:00,610 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 10:41:00,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:41:00,611 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:00,611 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-05 10:41:00,611 INFO L418 AbstractCegarLoop]: === Iteration 23 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:00,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:00,611 INFO L82 PathProgramCache]: Analyzing trace with hash -818603680, now seen corresponding path program 22 times [2019-08-05 10:41:00,612 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:00,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:00,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 24 conjunts are in the unsatisfiable core [2019-08-05 10:41:00,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:00,908 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:00,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:00,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:41:00,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:41:00,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:41:00,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:41:00,909 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-08-05 10:41:00,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:00,943 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:41:00,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:41:00,944 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-08-05 10:41:00,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:00,944 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:41:00,945 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:41:00,946 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:41:00,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:41:00,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 10:41:00,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:41:00,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 10:41:00,948 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-05 10:41:00,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:00,949 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 10:41:00,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:41:00,949 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 10:41:00,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:41:00,950 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:00,950 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-05 10:41:00,950 INFO L418 AbstractCegarLoop]: === Iteration 24 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:00,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:00,950 INFO L82 PathProgramCache]: Analyzing trace with hash 393087750, now seen corresponding path program 23 times [2019-08-05 10:41:00,951 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:00,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:00,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:41:00,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:01,569 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:01,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:01,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:41:01,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:41:01,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:41:01,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:41:01,571 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-08-05 10:41:01,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:01,639 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 10:41:01,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:41:01,646 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-08-05 10:41:01,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:01,647 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:41:01,647 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:41:01,647 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:41:01,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:41:01,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:41:01,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:41:01,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 10:41:01,650 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-05 10:41:01,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:01,650 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 10:41:01,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:41:01,651 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 10:41:01,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:41:01,651 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:01,651 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-05 10:41:01,652 INFO L418 AbstractCegarLoop]: === Iteration 25 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:01,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:01,652 INFO L82 PathProgramCache]: Analyzing trace with hash -699183584, now seen corresponding path program 24 times [2019-08-05 10:41:01,653 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:01,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:01,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 26 conjunts are in the unsatisfiable core [2019-08-05 10:41:01,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:02,363 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:02,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:02,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:41:02,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:41:02,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:41:02,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:41:02,364 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-08-05 10:41:02,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:02,395 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 10:41:02,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:41:02,395 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:41:02,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:02,396 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:41:02,396 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:41:02,396 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:41:02,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:41:02,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:41:02,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:41:02,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:41:02,398 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-05 10:41:02,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:02,399 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:41:02,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:41:02,399 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:41:02,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:41:02,400 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:02,400 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-05 10:41:02,400 INFO L418 AbstractCegarLoop]: === Iteration 26 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:02,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:02,400 INFO L82 PathProgramCache]: Analyzing trace with hash -199856570, now seen corresponding path program 25 times [2019-08-05 10:41:02,401 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:02,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:02,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 27 conjunts are in the unsatisfiable core [2019-08-05 10:41:02,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:02,898 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:02,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:02,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:41:02,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:41:02,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:41:02,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:41:02,901 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-08-05 10:41:02,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:02,950 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 10:41:02,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:41:02,951 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-05 10:41:02,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:02,951 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:41:02,952 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:41:02,952 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:41:02,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:41:02,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:41:02,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:41:02,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 10:41:02,955 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-05 10:41:02,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:02,956 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 10:41:02,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:41:02,956 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 10:41:02,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:41:02,956 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:02,956 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-05 10:41:02,957 INFO L418 AbstractCegarLoop]: === Iteration 27 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:02,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:02,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588320, now seen corresponding path program 26 times [2019-08-05 10:41:02,957 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:02,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:02,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:41:02,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:03,732 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:03,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:03,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:41:03,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:41:03,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:41:03,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:41:03,734 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-08-05 10:41:03,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:03,869 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 10:41:03,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:41:03,870 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-08-05 10:41:03,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:03,871 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:41:03,871 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:41:03,871 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:41:03,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:41:03,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:41:03,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:41:03,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 10:41:03,874 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-05 10:41:03,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:03,875 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 10:41:03,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:41:03,875 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 10:41:03,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:41:03,875 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:03,876 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-05 10:41:03,876 INFO L418 AbstractCegarLoop]: === Iteration 28 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:03,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:03,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302278, now seen corresponding path program 27 times [2019-08-05 10:41:03,877 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:03,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:03,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 29 conjunts are in the unsatisfiable core [2019-08-05 10:41:03,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:04,266 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:04,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:04,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:41:04,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:41:04,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:41:04,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:41:04,268 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-08-05 10:41:04,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:04,306 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 10:41:04,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:41:04,307 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-08-05 10:41:04,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:04,308 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:41:04,308 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:41:04,308 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:41:04,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:41:04,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 10:41:04,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:41:04,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 10:41:04,312 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-05 10:41:04,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:04,313 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 10:41:04,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:41:04,313 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 10:41:04,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:41:04,313 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:04,314 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-05 10:41:04,314 INFO L418 AbstractCegarLoop]: === Iteration 29 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:04,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:04,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1104336992, now seen corresponding path program 28 times [2019-08-05 10:41:04,315 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:04,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:04,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 30 conjunts are in the unsatisfiable core [2019-08-05 10:41:04,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:05,313 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:05,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:05,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:41:05,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:41:05,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:41:05,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:41:05,314 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-08-05 10:41:05,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:05,363 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 10:41:05,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:41:05,363 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-08-05 10:41:05,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:05,364 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:41:05,364 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:41:05,365 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:41:05,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:41:05,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 10:41:05,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:41:05,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 10:41:05,368 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-05 10:41:05,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:05,369 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 10:41:05,369 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:41:05,369 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 10:41:05,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:41:05,369 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:05,369 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-05 10:41:05,370 INFO L418 AbstractCegarLoop]: === Iteration 30 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:05,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:05,370 INFO L82 PathProgramCache]: Analyzing trace with hash 125289670, now seen corresponding path program 29 times [2019-08-05 10:41:05,371 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:05,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:05,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:41:05,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:05,887 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:05,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:05,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:41:05,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:41:05,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:41:05,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:41:05,889 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-08-05 10:41:06,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:06,030 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 10:41:06,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:41:06,030 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-08-05 10:41:06,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:06,031 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:41:06,031 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:41:06,031 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:41:06,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:41:06,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 10:41:06,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:41:06,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 10:41:06,034 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-05 10:41:06,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:06,034 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 10:41:06,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:41:06,034 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 10:41:06,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:41:06,035 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:06,035 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-05 10:41:06,035 INFO L418 AbstractCegarLoop]: === Iteration 31 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:06,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:06,036 INFO L82 PathProgramCache]: Analyzing trace with hash -410989472, now seen corresponding path program 30 times [2019-08-05 10:41:06,036 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:06,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:06,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:41:06,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:06,735 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:06,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:06,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:41:06,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:41:06,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:41:06,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:41:06,737 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-08-05 10:41:06,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:06,775 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:41:06,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:41:06,775 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-08-05 10:41:06,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:06,776 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:41:06,776 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:41:06,777 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:41:06,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:41:06,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:41:06,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:41:06,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 10:41:06,779 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-05 10:41:06,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:06,779 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 10:41:06,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:41:06,779 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 10:41:06,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:41:06,780 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:06,780 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-05 10:41:06,780 INFO L418 AbstractCegarLoop]: === Iteration 32 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:06,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:06,780 INFO L82 PathProgramCache]: Analyzing trace with hash 144226310, now seen corresponding path program 31 times [2019-08-05 10:41:06,781 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:06,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:06,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 33 conjunts are in the unsatisfiable core [2019-08-05 10:41:06,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:07,293 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:07,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:07,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:41:07,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:41:07,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:41:07,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:41:07,295 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-08-05 10:41:07,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:07,443 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 10:41:07,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:41:07,443 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-08-05 10:41:07,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:07,444 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:41:07,444 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:41:07,445 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:41:07,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:41:07,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:41:07,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:41:07,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 10:41:07,448 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-05 10:41:07,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:07,448 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 10:41:07,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:41:07,448 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 10:41:07,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:41:07,449 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:07,449 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-05 10:41:07,449 INFO L418 AbstractCegarLoop]: === Iteration 33 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:07,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:07,450 INFO L82 PathProgramCache]: Analyzing trace with hash 176046368, now seen corresponding path program 32 times [2019-08-05 10:41:07,450 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:07,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:07,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:41:07,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:08,043 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:08,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:08,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:41:08,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:41:08,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:41:08,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:41:08,045 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-08-05 10:41:08,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:08,086 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:41:08,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:41:08,086 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-05 10:41:08,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:08,087 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:41:08,087 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:41:08,088 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:41:08,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:41:08,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:41:08,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:41:08,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:41:08,091 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-05 10:41:08,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:08,091 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:41:08,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:41:08,091 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:41:08,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:41:08,092 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:08,092 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-05 10:41:08,092 INFO L418 AbstractCegarLoop]: === Iteration 34 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:08,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:08,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468166, now seen corresponding path program 33 times [2019-08-05 10:41:08,093 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:08,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:08,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 35 conjunts are in the unsatisfiable core [2019-08-05 10:41:08,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:08,641 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:08,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:08,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:41:08,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:41:08,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:41:08,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:41:08,643 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-08-05 10:41:08,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:08,680 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 10:41:08,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:41:08,680 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-05 10:41:08,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:08,681 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:41:08,681 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:41:08,682 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:41:08,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:41:08,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 10:41:08,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:41:08,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 10:41:08,684 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-05 10:41:08,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:08,684 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 10:41:08,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:41:08,685 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 10:41:08,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:41:08,685 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:08,685 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-05 10:41:08,685 INFO L418 AbstractCegarLoop]: === Iteration 35 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:08,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:08,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772832, now seen corresponding path program 34 times [2019-08-05 10:41:08,686 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:08,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:08,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 36 conjunts are in the unsatisfiable core [2019-08-05 10:41:08,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:09,247 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:09,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:09,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:41:09,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:41:09,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:41:09,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:41:09,248 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-08-05 10:41:09,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:09,322 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 10:41:09,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:41:09,323 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-08-05 10:41:09,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:09,323 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:41:09,323 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:41:09,324 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:41:09,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:41:09,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 10:41:09,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:41:09,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 10:41:09,327 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-05 10:41:09,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:09,327 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 10:41:09,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:41:09,327 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 10:41:09,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:41:09,327 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:09,328 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-05 10:41:09,328 INFO L418 AbstractCegarLoop]: === Iteration 36 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:09,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:09,328 INFO L82 PathProgramCache]: Analyzing trace with hash 440348294, now seen corresponding path program 35 times [2019-08-05 10:41:09,329 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:09,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:09,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:41:09,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:10,331 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:10,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:10,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:41:10,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:41:10,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:41:10,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:41:10,333 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-08-05 10:41:10,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:10,389 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 10:41:10,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:41:10,390 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-08-05 10:41:10,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:10,390 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:41:10,390 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:41:10,391 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:41:10,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:41:10,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:41:10,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:41:10,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 10:41:10,393 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-05 10:41:10,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:10,394 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 10:41:10,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:41:10,394 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 10:41:10,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:41:10,394 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:10,394 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-05 10:41:10,394 INFO L418 AbstractCegarLoop]: === Iteration 37 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:10,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:10,395 INFO L82 PathProgramCache]: Analyzing trace with hash 765893280, now seen corresponding path program 36 times [2019-08-05 10:41:10,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:10,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:10,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:41:10,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:12,188 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:12,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:12,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:41:12,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:41:12,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:41:12,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:41:12,190 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-08-05 10:41:12,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:12,237 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 10:41:12,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:41:12,238 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-08-05 10:41:12,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:12,238 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:41:12,239 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:41:12,240 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:41:12,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:41:12,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 10:41:12,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:41:12,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 10:41:12,242 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-05 10:41:12,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:12,243 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 10:41:12,243 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:41:12,243 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 10:41:12,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:41:12,244 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:12,244 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-05 10:41:12,244 INFO L418 AbstractCegarLoop]: === Iteration 38 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:12,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:12,244 INFO L82 PathProgramCache]: Analyzing trace with hash -2027114042, now seen corresponding path program 37 times [2019-08-05 10:41:12,245 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:12,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:12,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:41:12,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:12,797 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:12,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:12,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:41:12,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:41:12,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:41:12,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:41:12,800 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-08-05 10:41:12,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:12,846 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 10:41:12,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:41:12,847 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-08-05 10:41:12,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:12,848 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:41:12,848 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:41:12,849 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:41:12,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:41:12,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 10:41:12,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:41:12,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 10:41:12,851 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-05 10:41:12,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:12,852 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 10:41:12,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:41:12,852 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 10:41:12,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:41:12,852 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:12,852 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-05 10:41:12,853 INFO L418 AbstractCegarLoop]: === Iteration 39 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:12,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:12,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972192, now seen corresponding path program 38 times [2019-08-05 10:41:12,854 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:12,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:41:12,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:13,489 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:13,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:13,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:41:13,490 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:41:13,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:41:13,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:41:13,491 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-08-05 10:41:13,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:13,551 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:41:13,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:41:13,552 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-08-05 10:41:13,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:13,552 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:41:13,552 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:41:13,553 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:41:13,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:41:13,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:41:13,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:41:13,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 10:41:13,556 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-05 10:41:13,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:13,556 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 10:41:13,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:41:13,556 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 10:41:13,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:41:13,557 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:13,557 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-05 10:41:13,557 INFO L418 AbstractCegarLoop]: === Iteration 40 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:13,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:13,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495750, now seen corresponding path program 39 times [2019-08-05 10:41:13,558 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:13,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:13,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 41 conjunts are in the unsatisfiable core [2019-08-05 10:41:13,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:14,391 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:14,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:14,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:41:14,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:41:14,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:41:14,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:41:14,393 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-08-05 10:41:14,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:14,456 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 10:41:14,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:41:14,456 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-08-05 10:41:14,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:14,457 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:41:14,457 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:41:14,458 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:41:14,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:41:14,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:41:14,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:41:14,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 10:41:14,460 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-05 10:41:14,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:14,460 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 10:41:14,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:41:14,460 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 10:41:14,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:41:14,461 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:14,461 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-05 10:41:14,461 INFO L418 AbstractCegarLoop]: === Iteration 41 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:14,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:14,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791456, now seen corresponding path program 40 times [2019-08-05 10:41:14,462 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:14,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:14,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 42 conjunts are in the unsatisfiable core [2019-08-05 10:41:14,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:15,403 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:15,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:15,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:41:15,404 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:41:15,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:41:15,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:41:15,405 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-08-05 10:41:15,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:15,454 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 10:41:15,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:41:15,454 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-05 10:41:15,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:15,455 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:41:15,455 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:41:15,456 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:41:15,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:41:15,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:41:15,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:41:15,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:41:15,458 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-05 10:41:15,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:15,458 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:41:15,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:41:15,459 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:41:15,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:41:15,459 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:15,459 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-05 10:41:15,459 INFO L418 AbstractCegarLoop]: === Iteration 42 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:15,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:15,460 INFO L82 PathProgramCache]: Analyzing trace with hash -692041658, now seen corresponding path program 41 times [2019-08-05 10:41:15,460 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:15,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:15,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:41:15,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:16,326 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:16,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:16,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:41:16,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:41:16,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:41:16,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:41:16,328 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-08-05 10:41:16,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:16,389 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 10:41:16,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:41:16,390 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-05 10:41:16,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:16,391 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:41:16,391 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:41:16,392 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:41:16,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:41:16,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 10:41:16,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:41:16,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 10:41:16,394 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-05 10:41:16,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:16,394 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 10:41:16,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:41:16,394 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 10:41:16,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:41:16,395 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:16,395 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-05 10:41:16,395 INFO L418 AbstractCegarLoop]: === Iteration 43 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:16,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:16,396 INFO L82 PathProgramCache]: Analyzing trace with hash 21543136, now seen corresponding path program 42 times [2019-08-05 10:41:16,396 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:16,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:16,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 44 conjunts are in the unsatisfiable core [2019-08-05 10:41:16,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:17,094 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:17,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:17,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:41:17,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:41:17,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:41:17,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:41:17,096 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-08-05 10:41:17,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:17,151 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 10:41:17,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:41:17,151 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-08-05 10:41:17,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:17,152 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:41:17,152 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:41:17,154 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:41:17,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:41:17,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 10:41:17,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:41:17,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 10:41:17,156 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-05 10:41:17,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:17,156 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 10:41:17,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:41:17,156 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 10:41:17,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:41:17,157 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:17,157 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-05 10:41:17,157 INFO L418 AbstractCegarLoop]: === Iteration 44 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:17,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:17,157 INFO L82 PathProgramCache]: Analyzing trace with hash 667835270, now seen corresponding path program 43 times [2019-08-05 10:41:17,158 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:17,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:17,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 45 conjunts are in the unsatisfiable core [2019-08-05 10:41:17,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:18,195 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:18,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:18,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:41:18,196 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:41:18,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:41:18,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:41:18,197 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-08-05 10:41:18,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:18,302 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 10:41:18,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:41:18,302 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-08-05 10:41:18,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:18,303 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:41:18,303 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:41:18,304 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:41:18,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:41:18,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 10:41:18,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:41:18,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 10:41:18,306 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-05 10:41:18,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:18,307 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 10:41:18,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:41:18,307 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 10:41:18,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:41:18,307 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:18,307 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-05 10:41:18,308 INFO L418 AbstractCegarLoop]: === Iteration 45 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:18,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:18,308 INFO L82 PathProgramCache]: Analyzing trace with hash -771945056, now seen corresponding path program 44 times [2019-08-05 10:41:18,309 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:18,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:18,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:41:18,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:19,123 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:19,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:19,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:41:19,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:41:19,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:41:19,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:41:19,124 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-08-05 10:41:19,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:19,191 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:41:19,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:41:19,191 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-08-05 10:41:19,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:19,192 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:41:19,192 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:41:19,192 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:41:19,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:41:19,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 10:41:19,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:41:19,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 10:41:19,194 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-05 10:41:19,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:19,195 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 10:41:19,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:41:19,195 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 10:41:19,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:41:19,196 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:19,196 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-05 10:41:19,196 INFO L418 AbstractCegarLoop]: === Iteration 46 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:19,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:19,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1839505094, now seen corresponding path program 45 times [2019-08-05 10:41:19,197 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:19,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:19,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 10:41:19,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:20,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:20,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:20,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:41:20,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:41:20,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:41:20,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:41:20,586 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-08-05 10:41:20,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:20,926 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 10:41:20,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:41:20,927 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-08-05 10:41:20,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:20,928 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:41:20,928 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:41:20,928 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:41:20,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:41:20,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 10:41:20,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:41:20,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 10:41:20,930 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-05 10:41:20,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:20,931 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 10:41:20,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:41:20,931 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 10:41:20,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:41:20,932 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:20,932 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-05 10:41:20,932 INFO L418 AbstractCegarLoop]: === Iteration 47 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:20,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:20,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1190081120, now seen corresponding path program 46 times [2019-08-05 10:41:20,933 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:20,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:20,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 48 conjunts are in the unsatisfiable core [2019-08-05 10:41:20,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:21,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:21,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:21,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:41:21,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:41:21,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:41:21,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:41:21,951 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-08-05 10:41:22,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:22,015 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:41:22,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:41:22,016 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-08-05 10:41:22,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:22,016 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:41:22,017 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:41:22,017 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:41:22,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:41:22,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:41:22,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:41:22,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 10:41:22,019 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-05 10:41:22,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:22,019 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 10:41:22,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:41:22,020 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 10:41:22,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:41:22,020 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:22,020 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-05 10:41:22,021 INFO L418 AbstractCegarLoop]: === Iteration 48 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:22,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:22,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1762192890, now seen corresponding path program 47 times [2019-08-05 10:41:22,021 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:22,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:22,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:41:22,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:22,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:22,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:22,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:41:22,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:41:22,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:41:22,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:41:22,995 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-08-05 10:41:23,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:23,052 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 10:41:23,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:41:23,052 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-08-05 10:41:23,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:23,053 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:41:23,053 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:41:23,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:41:23,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:41:23,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:41:23,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:41:23,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 10:41:23,056 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-05 10:41:23,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:23,057 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 10:41:23,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:41:23,057 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 10:41:23,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:41:23,057 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:23,058 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-05 10:41:23,058 INFO L418 AbstractCegarLoop]: === Iteration 49 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:23,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:23,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1206593312, now seen corresponding path program 48 times [2019-08-05 10:41:23,059 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:23,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:23,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 50 conjunts are in the unsatisfiable core [2019-08-05 10:41:23,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:24,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:24,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:24,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:41:24,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:41:24,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:41:24,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:41:24,078 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-08-05 10:41:24,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:24,149 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 10:41:24,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:41:24,150 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-05 10:41:24,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:24,151 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:41:24,151 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:41:24,152 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:41:24,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:41:24,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:41:24,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:41:24,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:41:24,154 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-05 10:41:24,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:24,154 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:41:24,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:41:24,155 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:41:24,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:41:24,155 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:24,155 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-05 10:41:24,155 INFO L418 AbstractCegarLoop]: === Iteration 50 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:24,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:24,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1250314938, now seen corresponding path program 49 times [2019-08-05 10:41:24,156 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:24,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:24,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:41:24,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:25,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:25,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:25,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:41:25,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:41:25,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:41:25,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:41:25,458 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-08-05 10:41:25,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:25,533 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 10:41:25,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:41:25,533 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-05 10:41:25,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:25,534 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:41:25,534 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:41:25,535 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:41:25,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:41:25,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 10:41:25,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:41:25,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 10:41:25,537 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-05 10:41:25,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:25,538 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 10:41:25,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:41:25,538 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 10:41:25,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:41:25,538 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:25,538 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-05 10:41:25,539 INFO L418 AbstractCegarLoop]: === Iteration 51 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:25,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:25,539 INFO L82 PathProgramCache]: Analyzing trace with hash -105059360, now seen corresponding path program 50 times [2019-08-05 10:41:25,539 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:25,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:25,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 10:41:25,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:26,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:26,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:26,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:41:26,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:41:26,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:41:26,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:41:26,523 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-08-05 10:41:26,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:26,602 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 10:41:26,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:41:26,603 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-08-05 10:41:26,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:26,604 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:41:26,604 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:41:26,605 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:41:26,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:41:26,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 10:41:26,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:41:26,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 10:41:26,606 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-05 10:41:26,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:26,607 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 10:41:26,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:41:26,607 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 10:41:26,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:41:26,607 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:26,607 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-05 10:41:26,608 INFO L418 AbstractCegarLoop]: === Iteration 52 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:26,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:26,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1038125190, now seen corresponding path program 51 times [2019-08-05 10:41:26,609 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:26,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:26,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 53 conjunts are in the unsatisfiable core [2019-08-05 10:41:26,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:27,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:27,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:27,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:41:27,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:41:27,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:41:27,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:41:27,812 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-08-05 10:41:27,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:27,886 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 10:41:27,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:41:27,887 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-08-05 10:41:27,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:27,888 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:41:27,888 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:41:27,888 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:41:27,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:41:27,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 10:41:27,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:41:27,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 10:41:27,891 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-05 10:41:27,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:27,891 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 10:41:27,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:41:27,891 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 10:41:27,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:41:27,891 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:27,892 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-05 10:41:27,892 INFO L418 AbstractCegarLoop]: === Iteration 53 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:27,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:27,892 INFO L82 PathProgramCache]: Analyzing trace with hash 2117107872, now seen corresponding path program 52 times [2019-08-05 10:41:27,893 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:27,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:27,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 54 conjunts are in the unsatisfiable core [2019-08-05 10:41:27,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:29,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:29,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:29,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:41:29,216 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:41:29,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:41:29,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:41:29,217 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-08-05 10:41:29,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:29,280 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 10:41:29,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:41:29,280 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-08-05 10:41:29,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:29,281 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:41:29,281 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:41:29,282 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:41:29,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:41:29,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 10:41:29,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:41:29,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 10:41:29,284 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-05 10:41:29,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:29,285 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 10:41:29,285 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:41:29,285 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 10:41:29,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:41:29,285 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:29,285 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-05 10:41:29,285 INFO L418 AbstractCegarLoop]: === Iteration 54 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:29,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:29,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1205832646, now seen corresponding path program 53 times [2019-08-05 10:41:29,286 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:29,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:29,300 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 10:41:29,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:30,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:30,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:30,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:41:30,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:41:30,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:41:30,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:41:30,719 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-08-05 10:41:30,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:30,849 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 10:41:30,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:41:30,849 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-08-05 10:41:30,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:30,850 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:41:30,850 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:41:30,850 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:41:30,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:41:30,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 10:41:30,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:41:30,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 10:41:30,852 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-05 10:41:30,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:30,852 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 10:41:30,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:41:30,852 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 10:41:30,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:41:30,852 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:30,853 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-05 10:41:30,853 INFO L418 AbstractCegarLoop]: === Iteration 55 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:30,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:30,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1273895584, now seen corresponding path program 54 times [2019-08-05 10:41:30,853 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:30,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:30,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:41:30,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:32,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:32,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:32,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:41:32,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:41:32,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:41:32,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:41:32,056 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-08-05 10:41:32,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:32,119 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 10:41:32,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:41:32,119 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-08-05 10:41:32,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:32,120 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:41:32,120 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:41:32,121 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:41:32,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:41:32,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 10:41:32,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:41:32,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 10:41:32,123 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-05 10:41:32,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:32,123 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 10:41:32,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:41:32,124 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 10:41:32,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:41:32,124 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:32,124 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-05 10:41:32,125 INFO L418 AbstractCegarLoop]: === Iteration 56 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:32,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:32,125 INFO L82 PathProgramCache]: Analyzing trace with hash -836059386, now seen corresponding path program 55 times [2019-08-05 10:41:32,125 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:32,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:32,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 57 conjunts are in the unsatisfiable core [2019-08-05 10:41:32,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:33,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:33,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:33,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:41:33,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:41:33,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:41:33,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:41:33,697 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-08-05 10:41:33,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:33,772 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 10:41:33,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:41:33,773 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-08-05 10:41:33,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:33,773 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:41:33,773 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:41:33,774 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:41:33,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:41:33,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 10:41:33,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:41:33,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 10:41:33,775 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-05 10:41:33,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:33,776 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 10:41:33,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:41:33,776 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 10:41:33,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:41:33,776 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:33,776 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-05 10:41:33,776 INFO L418 AbstractCegarLoop]: === Iteration 57 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:33,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:33,777 INFO L82 PathProgramCache]: Analyzing trace with hash -148039136, now seen corresponding path program 56 times [2019-08-05 10:41:33,777 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:33,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:33,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:41:33,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:35,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:35,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:35,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:41:35,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:41:35,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:41:35,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:41:35,167 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-08-05 10:41:35,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:35,245 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 10:41:35,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:41:35,245 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-05 10:41:35,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:35,246 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:41:35,246 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:41:35,247 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:41:35,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:41:35,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:41:35,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:41:35,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 10:41:35,249 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-05 10:41:35,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:35,249 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 10:41:35,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:41:35,250 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 10:41:35,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:41:35,250 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:35,251 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-05 10:41:35,251 INFO L418 AbstractCegarLoop]: === Iteration 58 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:35,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:35,251 INFO L82 PathProgramCache]: Analyzing trace with hash -294247866, now seen corresponding path program 57 times [2019-08-05 10:41:35,252 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:35,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:35,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:41:35,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:36,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:36,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:36,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:41:36,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:41:36,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:41:36,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:41:36,815 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-08-05 10:41:36,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:36,899 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 10:41:36,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:41:36,900 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-05 10:41:36,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:36,901 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:41:36,901 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:41:36,902 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:41:36,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:41:36,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 10:41:36,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:41:36,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 10:41:36,904 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-05 10:41:36,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:36,905 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 10:41:36,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:41:36,905 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 10:41:36,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 10:41:36,905 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:36,906 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-05 10:41:36,906 INFO L418 AbstractCegarLoop]: === Iteration 59 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:36,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:36,906 INFO L82 PathProgramCache]: Analyzing trace with hash -531751200, now seen corresponding path program 58 times [2019-08-05 10:41:36,907 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:36,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:36,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 60 conjunts are in the unsatisfiable core [2019-08-05 10:41:36,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:38,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:38,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:38,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:41:38,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:41:38,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:41:38,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:41:38,143 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-08-05 10:41:38,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:38,219 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 10:41:38,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:41:38,220 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-08-05 10:41:38,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:38,220 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:41:38,220 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:41:38,221 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:41:38,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:41:38,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 10:41:38,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:41:38,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 10:41:38,223 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-05 10:41:38,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:38,223 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 10:41:38,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:41:38,223 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 10:41:38,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:41:38,223 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:38,223 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-05 10:41:38,224 INFO L418 AbstractCegarLoop]: === Iteration 60 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:38,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:38,224 INFO L82 PathProgramCache]: Analyzing trace with hash 695580038, now seen corresponding path program 59 times [2019-08-05 10:41:38,224 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:38,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:38,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:41:38,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:39,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:39,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:39,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:41:39,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:41:39,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:41:39,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:41:39,587 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-08-05 10:41:39,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:39,656 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 10:41:39,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:41:39,657 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-08-05 10:41:39,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:39,657 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:41:39,658 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:41:39,658 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:41:39,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:41:39,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 10:41:39,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:41:39,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 10:41:39,661 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-05 10:41:39,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:39,661 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 10:41:39,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:41:39,661 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 10:41:39,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:41:39,662 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:39,662 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-05 10:41:39,662 INFO L418 AbstractCegarLoop]: === Iteration 61 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:39,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:39,662 INFO L82 PathProgramCache]: Analyzing trace with hash 88142752, now seen corresponding path program 60 times [2019-08-05 10:41:39,663 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:39,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:39,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:41:39,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:41,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:41,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:41,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:41:41,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:41:41,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:41:41,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:41:41,489 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-08-05 10:41:41,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:41,565 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 10:41:41,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:41:41,566 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-08-05 10:41:41,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:41,567 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:41:41,567 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:41:41,567 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:41:41,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:41:41,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 10:41:41,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:41:41,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 10:41:41,570 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-05 10:41:41,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:41,570 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 10:41:41,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:41:41,570 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 10:41:41,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:41:41,570 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:41,570 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-05 10:41:41,571 INFO L418 AbstractCegarLoop]: === Iteration 62 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:41,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:41,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1562543930, now seen corresponding path program 61 times [2019-08-05 10:41:41,571 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:41,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:41,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 63 conjunts are in the unsatisfiable core [2019-08-05 10:41:41,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:43,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:43,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:43,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:41:43,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:41:43,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:41:43,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:41:43,244 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-08-05 10:41:43,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:43,335 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 10:41:43,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:41:43,336 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-08-05 10:41:43,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:43,337 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:41:43,337 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:41:43,337 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:41:43,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:41:43,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 10:41:43,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:41:43,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 10:41:43,339 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-05 10:41:43,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:43,340 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 10:41:43,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:41:43,340 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 10:41:43,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 10:41:43,340 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:43,340 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-05 10:41:43,340 INFO L418 AbstractCegarLoop]: === Iteration 63 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:43,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:43,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1194223520, now seen corresponding path program 62 times [2019-08-05 10:41:43,341 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:43,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:43,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 10:41:43,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:44,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:44,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:44,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:41:44,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:41:44,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:41:44,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:41:44,811 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-08-05 10:41:44,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:44,886 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:41:44,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:41:44,886 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-08-05 10:41:44,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:44,887 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:41:44,887 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:41:44,888 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:41:44,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:41:44,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 10:41:44,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:41:44,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 10:41:44,890 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-05 10:41:44,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:44,890 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 10:41:44,890 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:41:44,891 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 10:41:44,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:41:44,891 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:44,891 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-08-05 10:41:44,891 INFO L418 AbstractCegarLoop]: === Iteration 64 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:44,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:44,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1633774598, now seen corresponding path program 63 times [2019-08-05 10:41:44,892 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:44,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:44,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 65 conjunts are in the unsatisfiable core [2019-08-05 10:41:44,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:46,626 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:46,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:46,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:41:46,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:41:46,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:41:46,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:41:46,628 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-08-05 10:41:46,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:46,707 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 10:41:46,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:41:46,707 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-08-05 10:41:46,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:46,708 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:41:46,708 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:41:46,709 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:41:46,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:41:46,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 10:41:46,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:41:46,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 10:41:46,711 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-05 10:41:46,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:46,711 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 10:41:46,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:41:46,711 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 10:41:46,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:41:46,712 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:46,712 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-05 10:41:46,712 INFO L418 AbstractCegarLoop]: === Iteration 65 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:46,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:46,713 INFO L82 PathProgramCache]: Analyzing trace with hash -892596960, now seen corresponding path program 64 times [2019-08-05 10:41:46,713 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:46,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:46,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 66 conjunts are in the unsatisfiable core [2019-08-05 10:41:46,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:48,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:48,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:48,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:41:48,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:41:48,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:41:48,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:41:48,330 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-08-05 10:41:48,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:48,436 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 10:41:48,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:41:48,437 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-08-05 10:41:48,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:48,438 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:41:48,438 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:41:48,438 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:41:48,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:41:48,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 10:41:48,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:41:48,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 10:41:48,440 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-05 10:41:48,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:48,441 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 10:41:48,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:41:48,441 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 10:41:48,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:41:48,441 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:48,441 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-05 10:41:48,442 INFO L418 AbstractCegarLoop]: === Iteration 66 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:48,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:48,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1900703930, now seen corresponding path program 65 times [2019-08-05 10:41:48,442 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:48,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:48,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 10:41:48,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:50,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:50,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:50,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:41:50,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:41:50,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:41:50,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:41:50,048 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-08-05 10:41:50,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:50,136 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 10:41:50,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:41:50,136 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-08-05 10:41:50,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:50,137 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:41:50,137 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:41:50,138 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:41:50,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:41:50,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 10:41:50,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:41:50,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 10:41:50,140 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-05 10:41:50,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:50,140 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 10:41:50,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:41:50,140 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 10:41:50,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:41:50,140 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:50,141 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-08-05 10:41:50,141 INFO L418 AbstractCegarLoop]: === Iteration 67 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:50,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:50,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1207718368, now seen corresponding path program 66 times [2019-08-05 10:41:50,141 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:50,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:50,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 68 conjunts are in the unsatisfiable core [2019-08-05 10:41:50,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:52,031 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:52,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:52,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:41:52,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:41:52,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:41:52,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:41:52,033 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-08-05 10:41:52,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:52,115 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 10:41:52,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:41:52,115 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-08-05 10:41:52,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:52,116 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:41:52,116 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:41:52,117 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:41:52,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:41:52,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 10:41:52,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:41:52,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 10:41:52,119 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-05 10:41:52,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:52,119 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 10:41:52,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:41:52,119 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 10:41:52,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:41:52,120 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:52,120 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-08-05 10:41:52,120 INFO L418 AbstractCegarLoop]: === Iteration 68 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:52,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:52,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1215438202, now seen corresponding path program 67 times [2019-08-05 10:41:52,121 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:52,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:52,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:41:52,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:53,754 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:53,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:53,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:41:53,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:41:53,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:41:53,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:41:53,755 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-08-05 10:41:53,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:53,844 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 10:41:53,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:41:53,845 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-08-05 10:41:53,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:53,846 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:41:53,846 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:41:53,846 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:41:53,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:41:53,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 10:41:53,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 10:41:53,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 10:41:53,848 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-05 10:41:53,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:53,848 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 10:41:53,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:41:53,849 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 10:41:53,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:41:53,849 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:53,849 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-08-05 10:41:53,849 INFO L418 AbstractCegarLoop]: === Iteration 69 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:53,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:53,849 INFO L82 PathProgramCache]: Analyzing trace with hash 976119456, now seen corresponding path program 68 times [2019-08-05 10:41:53,850 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:53,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:53,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:41:53,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:55,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:55,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:55,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:41:55,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 10:41:55,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 10:41:55,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:41:55,562 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-08-05 10:41:55,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:55,652 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 10:41:55,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:41:55,653 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-08-05 10:41:55,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:55,654 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:41:55,654 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:41:55,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:41:55,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:41:55,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 10:41:55,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:41:55,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 10:41:55,657 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-05 10:41:55,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:55,657 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 10:41:55,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 10:41:55,657 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 10:41:55,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:41:55,658 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:55,658 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-08-05 10:41:55,658 INFO L418 AbstractCegarLoop]: === Iteration 70 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:55,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:55,658 INFO L82 PathProgramCache]: Analyzing trace with hash 194930118, now seen corresponding path program 69 times [2019-08-05 10:41:55,659 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:55,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:55,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 71 conjunts are in the unsatisfiable core [2019-08-05 10:41:55,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:57,739 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:57,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:57,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:41:57,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:41:57,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:41:57,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:41:57,741 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-08-05 10:41:57,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:41:57,842 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 10:41:57,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:41:57,842 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-08-05 10:41:57,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:41:57,844 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:41:57,844 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:41:57,844 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:41:57,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:41:57,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 10:41:57,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:41:57,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 10:41:57,847 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-05 10:41:57,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:41:57,847 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 10:41:57,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:41:57,847 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 10:41:57,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 10:41:57,848 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:41:57,848 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-08-05 10:41:57,848 INFO L418 AbstractCegarLoop]: === Iteration 71 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:41:57,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:41:57,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1747864416, now seen corresponding path program 70 times [2019-08-05 10:41:57,849 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:41:57,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:41:57,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 72 conjunts are in the unsatisfiable core [2019-08-05 10:41:57,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:41:59,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:41:59,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:41:59,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:41:59,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 10:41:59,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 10:41:59,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:41:59,870 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-08-05 10:42:00,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:00,265 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 10:42:00,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:42:00,266 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-08-05 10:42:00,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:00,267 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:42:00,267 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:42:00,268 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:42:00,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:42:00,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 10:42:00,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:42:00,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 10:42:00,270 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-05 10:42:00,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:00,270 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 10:42:00,271 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 10:42:00,271 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 10:42:00,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:42:00,271 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:00,271 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-08-05 10:42:00,272 INFO L418 AbstractCegarLoop]: === Iteration 72 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:00,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:00,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1650779898, now seen corresponding path program 71 times [2019-08-05 10:42:00,272 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:00,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:00,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:42:00,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:02,776 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:02,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:02,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 10:42:02,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:42:02,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:42:02,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:42:02,778 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-08-05 10:42:02,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:02,879 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 10:42:02,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:42:02,879 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-08-05 10:42:02,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:02,880 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:42:02,880 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:42:02,881 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:42:02,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:42:02,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 10:42:02,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:42:02,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 10:42:02,884 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-05 10:42:02,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:02,884 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 10:42:02,884 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:42:02,884 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 10:42:02,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:42:02,885 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:02,885 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-05 10:42:02,885 INFO L418 AbstractCegarLoop]: === Iteration 73 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:02,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:02,885 INFO L82 PathProgramCache]: Analyzing trace with hash 365428768, now seen corresponding path program 72 times [2019-08-05 10:42:02,886 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:02,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:02,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:42:02,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:04,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:04,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:04,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:42:04,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:42:04,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:42:04,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:42:04,889 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-08-05 10:42:04,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:04,975 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 10:42:04,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:42:04,975 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-08-05 10:42:04,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:04,976 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:42:04,976 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:42:04,977 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:42:04,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:42:04,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:42:04,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:42:04,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 10:42:04,979 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-05 10:42:04,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:04,979 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 10:42:04,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:42:04,980 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 10:42:04,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:42:04,980 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:04,980 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-05 10:42:04,980 INFO L418 AbstractCegarLoop]: === Iteration 74 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:04,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:04,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1556612026, now seen corresponding path program 73 times [2019-08-05 10:42:04,981 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:04,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:04,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 75 conjunts are in the unsatisfiable core [2019-08-05 10:42:05,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:07,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:07,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:07,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:42:07,255 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:42:07,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:42:07,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:42:07,255 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-08-05 10:42:07,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:07,356 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 10:42:07,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:42:07,357 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-08-05 10:42:07,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:07,358 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:42:07,358 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:42:07,358 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:42:07,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:42:07,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 10:42:07,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:42:07,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 10:42:07,360 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-05 10:42:07,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:07,361 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 10:42:07,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:42:07,361 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 10:42:07,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:42:07,362 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:07,362 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-08-05 10:42:07,362 INFO L418 AbstractCegarLoop]: === Iteration 75 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:07,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:07,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1010334496, now seen corresponding path program 74 times [2019-08-05 10:42:07,363 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:07,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:07,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:42:07,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:09,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:09,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:09,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:42:09,392 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 10:42:09,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 10:42:09,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:42:09,393 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-08-05 10:42:09,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:09,488 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 10:42:09,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:42:09,489 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-08-05 10:42:09,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:09,489 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:42:09,490 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:42:09,490 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:42:09,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:42:09,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 10:42:09,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:42:09,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 10:42:09,492 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-05 10:42:09,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:09,492 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 10:42:09,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 10:42:09,493 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 10:42:09,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:42:09,493 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:09,493 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-08-05 10:42:09,493 INFO L418 AbstractCegarLoop]: === Iteration 76 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:09,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:09,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1255600250, now seen corresponding path program 75 times [2019-08-05 10:42:09,494 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:09,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:09,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:42:09,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:11,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:11,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:11,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 10:42:11,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:42:11,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:42:11,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:42:11,781 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-08-05 10:42:11,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:11,874 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 10:42:11,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:42:11,874 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-08-05 10:42:11,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:11,875 INFO L225 Difference]: With dead ends: 81 [2019-08-05 10:42:11,875 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:42:11,876 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:42:11,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:42:11,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 10:42:11,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 10:42:11,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 10:42:11,878 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-05 10:42:11,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:11,878 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 10:42:11,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:42:11,878 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 10:42:11,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 10:42:11,879 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:11,879 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-08-05 10:42:11,879 INFO L418 AbstractCegarLoop]: === Iteration 77 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:11,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:11,880 INFO L82 PathProgramCache]: Analyzing trace with hash -268904032, now seen corresponding path program 76 times [2019-08-05 10:42:11,880 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:11,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:11,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 78 conjunts are in the unsatisfiable core [2019-08-05 10:42:11,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:13,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:13,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:13,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:42:13,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 10:42:13,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 10:42:13,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:42:13,964 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-08-05 10:42:14,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:14,069 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-08-05 10:42:14,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:42:14,069 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-08-05 10:42:14,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:14,070 INFO L225 Difference]: With dead ends: 82 [2019-08-05 10:42:14,070 INFO L226 Difference]: Without dead ends: 81 [2019-08-05 10:42:14,071 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:42:14,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-08-05 10:42:14,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-08-05 10:42:14,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-08-05 10:42:14,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-08-05 10:42:14,073 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-08-05 10:42:14,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:14,074 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-08-05 10:42:14,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 10:42:14,074 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-08-05 10:42:14,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-08-05 10:42:14,074 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:14,074 INFO L399 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-08-05 10:42:14,075 INFO L418 AbstractCegarLoop]: === Iteration 78 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:14,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:14,075 INFO L82 PathProgramCache]: Analyzing trace with hash 253907654, now seen corresponding path program 77 times [2019-08-05 10:42:14,075 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:14,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 10:42:14,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:16,194 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:16,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:16,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 10:42:16,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 10:42:16,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 10:42:16,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:42:16,196 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-08-05 10:42:16,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:16,365 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-08-05 10:42:16,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-08-05 10:42:16,366 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-08-05 10:42:16,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:16,366 INFO L225 Difference]: With dead ends: 83 [2019-08-05 10:42:16,366 INFO L226 Difference]: Without dead ends: 82 [2019-08-05 10:42:16,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:42:16,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-08-05 10:42:16,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-08-05 10:42:16,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-08-05 10:42:16,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-08-05 10:42:16,368 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-08-05 10:42:16,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:16,368 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-08-05 10:42:16,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-08-05 10:42:16,368 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-08-05 10:42:16,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-08-05 10:42:16,369 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:16,369 INFO L399 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-08-05 10:42:16,369 INFO L418 AbstractCegarLoop]: === Iteration 79 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:16,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:16,369 INFO L82 PathProgramCache]: Analyzing trace with hash -718799264, now seen corresponding path program 78 times [2019-08-05 10:42:16,370 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:16,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:16,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 10:42:16,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:18,846 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:18,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:18,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-08-05 10:42:18,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-08-05 10:42:18,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-08-05 10:42:18,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:42:18,848 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2019-08-05 10:42:19,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:19,036 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-05 10:42:19,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-08-05 10:42:19,036 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2019-08-05 10:42:19,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:19,037 INFO L225 Difference]: With dead ends: 84 [2019-08-05 10:42:19,037 INFO L226 Difference]: Without dead ends: 83 [2019-08-05 10:42:19,038 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-08-05 10:42:19,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-08-05 10:42:19,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-08-05 10:42:19,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 10:42:19,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-08-05 10:42:19,040 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-08-05 10:42:19,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:19,040 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-08-05 10:42:19,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-08-05 10:42:19,041 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-08-05 10:42:19,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-08-05 10:42:19,041 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:19,041 INFO L399 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2019-08-05 10:42:19,041 INFO L418 AbstractCegarLoop]: === Iteration 80 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:19,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:19,042 INFO L82 PathProgramCache]: Analyzing trace with hash -807942650, now seen corresponding path program 79 times [2019-08-05 10:42:19,042 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:19,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:19,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 81 conjunts are in the unsatisfiable core [2019-08-05 10:42:19,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:21,688 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:21,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:21,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-08-05 10:42:21,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-08-05 10:42:21,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-08-05 10:42:21,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:42:21,690 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2019-08-05 10:42:21,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:21,887 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-08-05 10:42:21,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-08-05 10:42:21,888 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-08-05 10:42:21,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:21,888 INFO L225 Difference]: With dead ends: 85 [2019-08-05 10:42:21,889 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 10:42:21,889 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-08-05 10:42:21,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 10:42:21,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-05 10:42:21,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 10:42:21,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-05 10:42:21,891 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-08-05 10:42:21,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:21,891 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-05 10:42:21,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-08-05 10:42:21,891 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-05 10:42:21,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 10:42:21,891 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:21,892 INFO L399 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-08-05 10:42:21,892 INFO L418 AbstractCegarLoop]: === Iteration 81 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:21,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:21,892 INFO L82 PathProgramCache]: Analyzing trace with hash 723579680, now seen corresponding path program 80 times [2019-08-05 10:42:21,892 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:21,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:21,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 10:42:21,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:26,263 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:26,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:26,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-08-05 10:42:26,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 10:42:26,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 10:42:26,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:42:26,264 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2019-08-05 10:42:26,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:26,370 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-08-05 10:42:26,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 10:42:26,371 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-08-05 10:42:26,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:26,372 INFO L225 Difference]: With dead ends: 86 [2019-08-05 10:42:26,372 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 10:42:26,372 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:42:26,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 10:42:26,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-05 10:42:26,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 10:42:26,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-05 10:42:26,374 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-08-05 10:42:26,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:26,375 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-05 10:42:26,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 10:42:26,375 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-05 10:42:26,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 10:42:26,375 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:26,376 INFO L399 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2019-08-05 10:42:26,376 INFO L418 AbstractCegarLoop]: === Iteration 82 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:26,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:26,376 INFO L82 PathProgramCache]: Analyzing trace with hash 956131654, now seen corresponding path program 81 times [2019-08-05 10:42:26,376 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:26,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:26,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 83 conjunts are in the unsatisfiable core [2019-08-05 10:42:26,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:29,064 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:29,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:29,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 10:42:29,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-08-05 10:42:29,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-08-05 10:42:29,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:42:29,065 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2019-08-05 10:42:29,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:29,325 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-08-05 10:42:29,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-08-05 10:42:29,325 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-08-05 10:42:29,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:29,326 INFO L225 Difference]: With dead ends: 87 [2019-08-05 10:42:29,326 INFO L226 Difference]: Without dead ends: 86 [2019-08-05 10:42:29,327 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-08-05 10:42:29,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-08-05 10:42:29,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-08-05 10:42:29,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-08-05 10:42:29,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-08-05 10:42:29,329 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-08-05 10:42:29,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:29,329 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-08-05 10:42:29,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-08-05 10:42:29,329 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-08-05 10:42:29,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-08-05 10:42:29,329 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:29,330 INFO L399 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2019-08-05 10:42:29,330 INFO L418 AbstractCegarLoop]: === Iteration 83 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:29,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:29,330 INFO L82 PathProgramCache]: Analyzing trace with hash -424691744, now seen corresponding path program 82 times [2019-08-05 10:42:29,330 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:29,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:29,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 84 conjunts are in the unsatisfiable core [2019-08-05 10:42:29,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:32,187 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:32,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:32,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-08-05 10:42:32,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-08-05 10:42:32,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-08-05 10:42:32,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:42:32,188 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2019-08-05 10:42:32,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:32,295 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-08-05 10:42:32,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-08-05 10:42:32,296 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2019-08-05 10:42:32,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:32,297 INFO L225 Difference]: With dead ends: 88 [2019-08-05 10:42:32,297 INFO L226 Difference]: Without dead ends: 87 [2019-08-05 10:42:32,297 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-08-05 10:42:32,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-08-05 10:42:32,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-08-05 10:42:32,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-08-05 10:42:32,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-08-05 10:42:32,300 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2019-08-05 10:42:32,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:32,301 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-08-05 10:42:32,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-08-05 10:42:32,301 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-08-05 10:42:32,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-08-05 10:42:32,301 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:32,301 INFO L399 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2019-08-05 10:42:32,301 INFO L418 AbstractCegarLoop]: === Iteration 84 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:32,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:32,302 INFO L82 PathProgramCache]: Analyzing trace with hash -280544122, now seen corresponding path program 83 times [2019-08-05 10:42:32,302 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:32,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:32,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 10:42:32,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:35,108 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:35,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:35,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-08-05 10:42:35,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-08-05 10:42:35,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-08-05 10:42:35,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:42:35,110 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2019-08-05 10:42:35,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:35,284 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-08-05 10:42:35,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-08-05 10:42:35,284 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2019-08-05 10:42:35,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:35,285 INFO L225 Difference]: With dead ends: 89 [2019-08-05 10:42:35,285 INFO L226 Difference]: Without dead ends: 88 [2019-08-05 10:42:35,286 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-08-05 10:42:35,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-08-05 10:42:35,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-08-05 10:42:35,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-08-05 10:42:35,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-08-05 10:42:35,288 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2019-08-05 10:42:35,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:35,288 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-08-05 10:42:35,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-08-05 10:42:35,289 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-08-05 10:42:35,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-08-05 10:42:35,289 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:35,289 INFO L399 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2019-08-05 10:42:35,290 INFO L418 AbstractCegarLoop]: === Iteration 85 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:35,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:35,290 INFO L82 PathProgramCache]: Analyzing trace with hash -106935136, now seen corresponding path program 84 times [2019-08-05 10:42:35,291 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:35,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:35,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 86 conjunts are in the unsatisfiable core [2019-08-05 10:42:35,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:38,182 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:38,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:38,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-08-05 10:42:38,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-08-05 10:42:38,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-08-05 10:42:38,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:42:38,184 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2019-08-05 10:42:38,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:38,289 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-08-05 10:42:38,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-08-05 10:42:38,289 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2019-08-05 10:42:38,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:38,290 INFO L225 Difference]: With dead ends: 90 [2019-08-05 10:42:38,290 INFO L226 Difference]: Without dead ends: 89 [2019-08-05 10:42:38,291 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-08-05 10:42:38,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-08-05 10:42:38,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-08-05 10:42:38,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-08-05 10:42:38,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-08-05 10:42:38,293 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2019-08-05 10:42:38,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:38,294 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-08-05 10:42:38,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-08-05 10:42:38,294 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-08-05 10:42:38,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-08-05 10:42:38,294 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:38,295 INFO L399 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2019-08-05 10:42:38,295 INFO L418 AbstractCegarLoop]: === Iteration 86 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:38,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:38,295 INFO L82 PathProgramCache]: Analyzing trace with hash 979976134, now seen corresponding path program 85 times [2019-08-05 10:42:38,296 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:38,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:38,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 87 conjunts are in the unsatisfiable core [2019-08-05 10:42:38,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:41,902 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:41,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:41,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-08-05 10:42:41,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-08-05 10:42:41,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-08-05 10:42:41,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:42:41,904 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2019-08-05 10:42:42,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:42,129 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-08-05 10:42:42,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-08-05 10:42:42,129 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2019-08-05 10:42:42,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:42,130 INFO L225 Difference]: With dead ends: 91 [2019-08-05 10:42:42,130 INFO L226 Difference]: Without dead ends: 90 [2019-08-05 10:42:42,130 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-08-05 10:42:42,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-08-05 10:42:42,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-08-05 10:42:42,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-08-05 10:42:42,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-08-05 10:42:42,132 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2019-08-05 10:42:42,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:42,132 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-08-05 10:42:42,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-08-05 10:42:42,132 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-08-05 10:42:42,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-08-05 10:42:42,133 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:42,133 INFO L399 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2019-08-05 10:42:42,133 INFO L418 AbstractCegarLoop]: === Iteration 87 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:42,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:42,133 INFO L82 PathProgramCache]: Analyzing trace with hash 314487136, now seen corresponding path program 86 times [2019-08-05 10:42:42,134 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:42,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:42,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 10:42:42,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:44,823 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:44,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:44,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-08-05 10:42:44,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-08-05 10:42:44,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-08-05 10:42:44,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:42:44,825 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2019-08-05 10:42:44,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:44,945 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-08-05 10:42:44,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-08-05 10:42:44,946 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2019-08-05 10:42:44,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:44,947 INFO L225 Difference]: With dead ends: 92 [2019-08-05 10:42:44,947 INFO L226 Difference]: Without dead ends: 91 [2019-08-05 10:42:44,948 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-08-05 10:42:44,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-08-05 10:42:44,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-08-05 10:42:44,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-08-05 10:42:44,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-08-05 10:42:44,950 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2019-08-05 10:42:44,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:44,950 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-08-05 10:42:44,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-08-05 10:42:44,950 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-08-05 10:42:44,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-08-05 10:42:44,951 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:44,951 INFO L399 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2019-08-05 10:42:44,951 INFO L418 AbstractCegarLoop]: === Iteration 88 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:44,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:44,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1159164678, now seen corresponding path program 87 times [2019-08-05 10:42:44,952 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:44,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:44,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 89 conjunts are in the unsatisfiable core [2019-08-05 10:42:44,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:47,793 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:47,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:47,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-08-05 10:42:47,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-08-05 10:42:47,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-08-05 10:42:47,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:42:47,795 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2019-08-05 10:42:47,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:47,907 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-08-05 10:42:47,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-08-05 10:42:47,908 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2019-08-05 10:42:47,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:47,909 INFO L225 Difference]: With dead ends: 93 [2019-08-05 10:42:47,909 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 10:42:47,909 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-08-05 10:42:47,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 10:42:47,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-08-05 10:42:47,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-05 10:42:47,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-08-05 10:42:47,911 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2019-08-05 10:42:47,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:47,912 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-08-05 10:42:47,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-08-05 10:42:47,912 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-08-05 10:42:47,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-05 10:42:47,912 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:47,913 INFO L399 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2019-08-05 10:42:47,913 INFO L418 AbstractCegarLoop]: === Iteration 89 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:47,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:47,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1574364704, now seen corresponding path program 88 times [2019-08-05 10:42:47,913 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:47,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:47,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 90 conjunts are in the unsatisfiable core [2019-08-05 10:42:47,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:50,656 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:50,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:50,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-08-05 10:42:50,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-08-05 10:42:50,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-08-05 10:42:50,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:42:50,658 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2019-08-05 10:42:50,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:50,769 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-08-05 10:42:50,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-05 10:42:50,770 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2019-08-05 10:42:50,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:50,771 INFO L225 Difference]: With dead ends: 94 [2019-08-05 10:42:50,771 INFO L226 Difference]: Without dead ends: 93 [2019-08-05 10:42:50,771 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:42:50,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-08-05 10:42:50,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-08-05 10:42:50,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-08-05 10:42:50,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-08-05 10:42:50,774 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2019-08-05 10:42:50,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:50,774 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-08-05 10:42:50,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-08-05 10:42:50,775 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-08-05 10:42:50,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-08-05 10:42:50,775 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:50,775 INFO L399 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2019-08-05 10:42:50,776 INFO L418 AbstractCegarLoop]: === Iteration 90 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:50,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:50,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1560663622, now seen corresponding path program 89 times [2019-08-05 10:42:50,777 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:50,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:50,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 10:42:50,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:53,944 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:53,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:53,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-08-05 10:42:53,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-08-05 10:42:53,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-08-05 10:42:53,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:42:53,946 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2019-08-05 10:42:54,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:54,062 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-08-05 10:42:54,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-08-05 10:42:54,063 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2019-08-05 10:42:54,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:54,063 INFO L225 Difference]: With dead ends: 95 [2019-08-05 10:42:54,064 INFO L226 Difference]: Without dead ends: 94 [2019-08-05 10:42:54,064 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-08-05 10:42:54,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-08-05 10:42:54,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-08-05 10:42:54,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-08-05 10:42:54,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-08-05 10:42:54,066 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2019-08-05 10:42:54,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:54,066 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-08-05 10:42:54,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-08-05 10:42:54,066 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-08-05 10:42:54,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-08-05 10:42:54,066 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:54,066 INFO L399 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2019-08-05 10:42:54,067 INFO L418 AbstractCegarLoop]: === Iteration 91 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:54,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:54,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1135930080, now seen corresponding path program 90 times [2019-08-05 10:42:54,067 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:54,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:54,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 92 conjunts are in the unsatisfiable core [2019-08-05 10:42:54,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:56,918 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:56,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:42:56,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-08-05 10:42:56,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-08-05 10:42:56,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-08-05 10:42:56,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:42:56,919 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2019-08-05 10:42:58,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:58,092 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-08-05 10:42:58,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-08-05 10:42:58,092 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2019-08-05 10:42:58,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:58,093 INFO L225 Difference]: With dead ends: 96 [2019-08-05 10:42:58,093 INFO L226 Difference]: Without dead ends: 95 [2019-08-05 10:42:58,094 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-08-05 10:42:58,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-08-05 10:42:58,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-08-05 10:42:58,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-08-05 10:42:58,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-08-05 10:42:58,095 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2019-08-05 10:42:58,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:58,096 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-08-05 10:42:58,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-08-05 10:42:58,096 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-08-05 10:42:58,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-08-05 10:42:58,096 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:58,096 INFO L399 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2019-08-05 10:42:58,097 INFO L418 AbstractCegarLoop]: === Iteration 92 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:58,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:58,097 INFO L82 PathProgramCache]: Analyzing trace with hash 854092166, now seen corresponding path program 91 times [2019-08-05 10:42:58,098 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:58,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:58,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 93 conjunts are in the unsatisfiable core [2019-08-05 10:42:58,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:00,967 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:00,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:00,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-08-05 10:43:00,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-08-05 10:43:00,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-08-05 10:43:00,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:43:00,969 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2019-08-05 10:43:01,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:01,083 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-08-05 10:43:01,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-08-05 10:43:01,083 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2019-08-05 10:43:01,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:01,084 INFO L225 Difference]: With dead ends: 97 [2019-08-05 10:43:01,084 INFO L226 Difference]: Without dead ends: 96 [2019-08-05 10:43:01,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-08-05 10:43:01,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-08-05 10:43:01,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-08-05 10:43:01,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-08-05 10:43:01,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-08-05 10:43:01,088 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2019-08-05 10:43:01,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:01,088 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-08-05 10:43:01,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-08-05 10:43:01,088 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-08-05 10:43:01,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-08-05 10:43:01,088 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:01,089 INFO L399 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2019-08-05 10:43:01,089 INFO L418 AbstractCegarLoop]: === Iteration 93 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:01,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:01,089 INFO L82 PathProgramCache]: Analyzing trace with hash 707051424, now seen corresponding path program 92 times [2019-08-05 10:43:01,089 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:01,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:01,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 10:43:01,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:04,336 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:04,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:04,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-08-05 10:43:04,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-08-05 10:43:04,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-08-05 10:43:04,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:43:04,338 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2019-08-05 10:43:04,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:04,463 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-08-05 10:43:04,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-08-05 10:43:04,464 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2019-08-05 10:43:04,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:04,465 INFO L225 Difference]: With dead ends: 98 [2019-08-05 10:43:04,465 INFO L226 Difference]: Without dead ends: 97 [2019-08-05 10:43:04,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-08-05 10:43:04,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-08-05 10:43:04,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-08-05 10:43:04,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-08-05 10:43:04,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-08-05 10:43:04,467 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2019-08-05 10:43:04,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:04,468 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-08-05 10:43:04,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-08-05 10:43:04,468 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-08-05 10:43:04,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-08-05 10:43:04,468 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:04,468 INFO L399 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2019-08-05 10:43:04,469 INFO L418 AbstractCegarLoop]: === Iteration 94 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:04,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:04,469 INFO L82 PathProgramCache]: Analyzing trace with hash 443755718, now seen corresponding path program 93 times [2019-08-05 10:43:04,469 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:04,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:04,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 95 conjunts are in the unsatisfiable core [2019-08-05 10:43:04,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:07,943 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:07,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:07,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-08-05 10:43:07,943 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-08-05 10:43:07,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-08-05 10:43:07,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:43:07,944 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2019-08-05 10:43:08,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:08,063 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-08-05 10:43:08,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-08-05 10:43:08,064 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2019-08-05 10:43:08,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:08,064 INFO L225 Difference]: With dead ends: 99 [2019-08-05 10:43:08,065 INFO L226 Difference]: Without dead ends: 98 [2019-08-05 10:43:08,065 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-08-05 10:43:08,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-08-05 10:43:08,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-08-05 10:43:08,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-08-05 10:43:08,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-08-05 10:43:08,067 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2019-08-05 10:43:08,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:08,067 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-08-05 10:43:08,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-08-05 10:43:08,068 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-08-05 10:43:08,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-08-05 10:43:08,068 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:08,069 INFO L399 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2019-08-05 10:43:08,069 INFO L418 AbstractCegarLoop]: === Iteration 95 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:08,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:08,069 INFO L82 PathProgramCache]: Analyzing trace with hash 871523424, now seen corresponding path program 94 times [2019-08-05 10:43:08,070 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:08,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:08,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 96 conjunts are in the unsatisfiable core [2019-08-05 10:43:08,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:11,723 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:11,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:11,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-08-05 10:43:11,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-08-05 10:43:11,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-08-05 10:43:11,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:43:11,724 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2019-08-05 10:43:11,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:11,863 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-08-05 10:43:11,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-08-05 10:43:11,863 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2019-08-05 10:43:11,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:11,864 INFO L225 Difference]: With dead ends: 100 [2019-08-05 10:43:11,864 INFO L226 Difference]: Without dead ends: 99 [2019-08-05 10:43:11,865 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-08-05 10:43:11,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-08-05 10:43:11,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-08-05 10:43:11,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-08-05 10:43:11,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-08-05 10:43:11,867 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2019-08-05 10:43:11,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:11,867 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-08-05 10:43:11,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-08-05 10:43:11,868 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-08-05 10:43:11,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-08-05 10:43:11,868 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:11,869 INFO L399 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2019-08-05 10:43:11,869 INFO L418 AbstractCegarLoop]: === Iteration 96 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:11,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:11,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1247420422, now seen corresponding path program 95 times [2019-08-05 10:43:11,869 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:11,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:11,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 10:43:11,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:15,670 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:15,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:15,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-08-05 10:43:15,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-08-05 10:43:15,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-08-05 10:43:15,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:43:15,672 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2019-08-05 10:43:15,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:15,790 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-08-05 10:43:15,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-08-05 10:43:15,791 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2019-08-05 10:43:15,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:15,791 INFO L225 Difference]: With dead ends: 101 [2019-08-05 10:43:15,792 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 10:43:15,792 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-08-05 10:43:15,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 10:43:15,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-08-05 10:43:15,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 10:43:15,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-08-05 10:43:15,794 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2019-08-05 10:43:15,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:15,794 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-08-05 10:43:15,794 INFO L476 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-08-05 10:43:15,795 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-08-05 10:43:15,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-05 10:43:15,795 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:15,795 INFO L399 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2019-08-05 10:43:15,795 INFO L418 AbstractCegarLoop]: === Iteration 97 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:15,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:15,796 INFO L82 PathProgramCache]: Analyzing trace with hash 15325472, now seen corresponding path program 96 times [2019-08-05 10:43:15,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:15,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:15,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 98 conjunts are in the unsatisfiable core [2019-08-05 10:43:15,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:19,486 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:19,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:19,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-08-05 10:43:19,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-08-05 10:43:19,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-08-05 10:43:19,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:43:19,487 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2019-08-05 10:43:19,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:19,658 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-08-05 10:43:19,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-05 10:43:19,658 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2019-08-05 10:43:19,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:19,659 INFO L225 Difference]: With dead ends: 102 [2019-08-05 10:43:19,659 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 10:43:19,660 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:43:19,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 10:43:19,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-08-05 10:43:19,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 10:43:19,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-08-05 10:43:19,663 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2019-08-05 10:43:19,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:19,663 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-08-05 10:43:19,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-08-05 10:43:19,663 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-08-05 10:43:19,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-05 10:43:19,664 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:19,664 INFO L399 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2019-08-05 10:43:19,664 INFO L418 AbstractCegarLoop]: === Iteration 98 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:19,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:19,665 INFO L82 PathProgramCache]: Analyzing trace with hash 475087686, now seen corresponding path program 97 times [2019-08-05 10:43:19,665 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:19,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:19,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 99 conjunts are in the unsatisfiable core [2019-08-05 10:43:19,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:23,517 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:23,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:23,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-08-05 10:43:23,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-08-05 10:43:23,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-08-05 10:43:23,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:43:23,519 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2019-08-05 10:43:23,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:23,669 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-08-05 10:43:23,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-08-05 10:43:23,670 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2019-08-05 10:43:23,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:23,671 INFO L225 Difference]: With dead ends: 103 [2019-08-05 10:43:23,671 INFO L226 Difference]: Without dead ends: 102 [2019-08-05 10:43:23,672 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-08-05 10:43:23,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-08-05 10:43:23,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-08-05 10:43:23,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-08-05 10:43:23,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-08-05 10:43:23,674 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2019-08-05 10:43:23,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:23,674 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-08-05 10:43:23,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-08-05 10:43:23,674 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-08-05 10:43:23,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-08-05 10:43:23,674 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:23,675 INFO L399 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2019-08-05 10:43:23,675 INFO L418 AbstractCegarLoop]: === Iteration 99 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:23,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:23,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1842814432, now seen corresponding path program 98 times [2019-08-05 10:43:23,676 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:23,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:23,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 10:43:23,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:27,065 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:27,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:27,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-08-05 10:43:27,066 INFO L454 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-08-05 10:43:27,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-08-05 10:43:27,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:43:27,067 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2019-08-05 10:43:27,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:27,383 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-08-05 10:43:27,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-08-05 10:43:27,384 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2019-08-05 10:43:27,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:27,385 INFO L225 Difference]: With dead ends: 104 [2019-08-05 10:43:27,385 INFO L226 Difference]: Without dead ends: 103 [2019-08-05 10:43:27,386 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-08-05 10:43:27,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-08-05 10:43:27,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-08-05 10:43:27,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-08-05 10:43:27,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-08-05 10:43:27,388 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2019-08-05 10:43:27,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:27,388 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-08-05 10:43:27,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-08-05 10:43:27,389 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-08-05 10:43:27,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-08-05 10:43:27,389 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:27,389 INFO L399 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2019-08-05 10:43:27,390 INFO L418 AbstractCegarLoop]: === Iteration 100 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:27,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:27,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1292670598, now seen corresponding path program 99 times [2019-08-05 10:43:27,390 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:27,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:27,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 101 conjunts are in the unsatisfiable core [2019-08-05 10:43:27,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:31,188 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:31,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:31,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-08-05 10:43:31,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-08-05 10:43:31,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-08-05 10:43:31,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 10:43:31,190 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2019-08-05 10:43:31,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:31,332 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-08-05 10:43:31,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-08-05 10:43:31,332 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2019-08-05 10:43:31,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:31,333 INFO L225 Difference]: With dead ends: 105 [2019-08-05 10:43:31,334 INFO L226 Difference]: Without dead ends: 104 [2019-08-05 10:43:31,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-08-05 10:43:31,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-08-05 10:43:31,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-08-05 10:43:31,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-08-05 10:43:31,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-08-05 10:43:31,337 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2019-08-05 10:43:31,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:31,337 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-08-05 10:43:31,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-08-05 10:43:31,337 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-08-05 10:43:31,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-08-05 10:43:31,338 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:31,338 INFO L399 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2019-08-05 10:43:31,338 INFO L418 AbstractCegarLoop]: === Iteration 101 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:31,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:31,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1418080928, now seen corresponding path program 100 times [2019-08-05 10:43:31,339 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:31,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:31,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 10:43:31,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:35,175 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:35,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:35,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-08-05 10:43:35,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-08-05 10:43:35,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-08-05 10:43:35,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:43:35,177 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2019-08-05 10:43:35,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:35,323 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-08-05 10:43:35,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-08-05 10:43:35,323 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2019-08-05 10:43:35,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:35,325 INFO L225 Difference]: With dead ends: 106 [2019-08-05 10:43:35,325 INFO L226 Difference]: Without dead ends: 105 [2019-08-05 10:43:35,326 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-08-05 10:43:35,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-08-05 10:43:35,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-08-05 10:43:35,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-08-05 10:43:35,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-08-05 10:43:35,328 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2019-08-05 10:43:35,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:35,328 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-08-05 10:43:35,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-08-05 10:43:35,329 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-08-05 10:43:35,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-08-05 10:43:35,329 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:35,329 INFO L399 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2019-08-05 10:43:35,330 INFO L418 AbstractCegarLoop]: === Iteration 102 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:35,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:35,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1010833862, now seen corresponding path program 101 times [2019-08-05 10:43:35,330 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:35,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:35,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-05 10:43:35,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:39,149 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:39,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:39,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2019-08-05 10:43:39,150 INFO L454 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-08-05 10:43:39,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-08-05 10:43:39,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 10:43:39,151 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2019-08-05 10:43:39,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:39,331 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-08-05 10:43:39,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-08-05 10:43:39,332 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2019-08-05 10:43:39,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:39,333 INFO L225 Difference]: With dead ends: 107 [2019-08-05 10:43:39,333 INFO L226 Difference]: Without dead ends: 106 [2019-08-05 10:43:39,334 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-08-05 10:43:39,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-08-05 10:43:39,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-08-05 10:43:39,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-08-05 10:43:39,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-08-05 10:43:39,337 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2019-08-05 10:43:39,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:39,337 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-08-05 10:43:39,337 INFO L476 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-08-05 10:43:39,338 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-08-05 10:43:39,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-08-05 10:43:39,338 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:39,338 INFO L399 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2019-08-05 10:43:39,339 INFO L418 AbstractCegarLoop]: === Iteration 103 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:39,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:39,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1271076704, now seen corresponding path program 102 times [2019-08-05 10:43:39,339 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:39,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:39,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 104 conjunts are in the unsatisfiable core [2019-08-05 10:43:39,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:43,103 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:43,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:43,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2019-08-05 10:43:43,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-08-05 10:43:43,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-08-05 10:43:43,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 10:43:43,105 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2019-08-05 10:43:43,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:43,262 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-08-05 10:43:43,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-08-05 10:43:43,262 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2019-08-05 10:43:43,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:43,263 INFO L225 Difference]: With dead ends: 108 [2019-08-05 10:43:43,263 INFO L226 Difference]: Without dead ends: 107 [2019-08-05 10:43:43,264 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2019-08-05 10:43:43,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-08-05 10:43:43,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-08-05 10:43:43,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-08-05 10:43:43,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-08-05 10:43:43,267 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2019-08-05 10:43:43,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:43,267 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-08-05 10:43:43,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-08-05 10:43:43,267 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-08-05 10:43:43,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-08-05 10:43:43,267 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:43,268 INFO L399 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2019-08-05 10:43:43,268 INFO L418 AbstractCegarLoop]: === Iteration 104 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:43,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:43,268 INFO L82 PathProgramCache]: Analyzing trace with hash 748670214, now seen corresponding path program 103 times [2019-08-05 10:43:43,269 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:43,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:43,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 105 conjunts are in the unsatisfiable core [2019-08-05 10:43:43,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:47,304 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:47,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:47,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2019-08-05 10:43:47,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-08-05 10:43:47,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-08-05 10:43:47,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 10:43:47,306 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2019-08-05 10:43:47,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:47,478 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-08-05 10:43:47,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-08-05 10:43:47,479 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2019-08-05 10:43:47,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:47,479 INFO L225 Difference]: With dead ends: 109 [2019-08-05 10:43:47,479 INFO L226 Difference]: Without dead ends: 108 [2019-08-05 10:43:47,480 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-08-05 10:43:47,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-08-05 10:43:47,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-08-05 10:43:47,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-08-05 10:43:47,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-08-05 10:43:47,482 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2019-08-05 10:43:47,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:47,482 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-08-05 10:43:47,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-08-05 10:43:47,483 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-08-05 10:43:47,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-08-05 10:43:47,483 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:47,483 INFO L399 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2019-08-05 10:43:47,483 INFO L418 AbstractCegarLoop]: === Iteration 105 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:47,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:47,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1733938208, now seen corresponding path program 104 times [2019-08-05 10:43:47,484 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:47,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:47,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-05 10:43:47,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:52,039 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:52,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:52,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2019-08-05 10:43:52,039 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-08-05 10:43:52,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-08-05 10:43:52,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 10:43:52,041 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2019-08-05 10:43:52,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:52,188 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-08-05 10:43:52,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-08-05 10:43:52,188 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2019-08-05 10:43:52,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:52,189 INFO L225 Difference]: With dead ends: 110 [2019-08-05 10:43:52,189 INFO L226 Difference]: Without dead ends: 109 [2019-08-05 10:43:52,190 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 10:43:52,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-08-05 10:43:52,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-08-05 10:43:52,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-08-05 10:43:52,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-08-05 10:43:52,192 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2019-08-05 10:43:52,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:52,193 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-08-05 10:43:52,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-08-05 10:43:52,193 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-08-05 10:43:52,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-08-05 10:43:52,193 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:52,193 INFO L399 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2019-08-05 10:43:52,194 INFO L418 AbstractCegarLoop]: === Iteration 106 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:52,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:52,194 INFO L82 PathProgramCache]: Analyzing trace with hash -2082492346, now seen corresponding path program 105 times [2019-08-05 10:43:52,194 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:52,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:52,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 107 conjunts are in the unsatisfiable core [2019-08-05 10:43:52,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:56,539 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:43:56,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:56,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2019-08-05 10:43:56,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-08-05 10:43:56,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-08-05 10:43:56,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 10:43:56,541 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2019-08-05 10:43:56,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:56,739 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-08-05 10:43:56,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-08-05 10:43:56,740 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2019-08-05 10:43:56,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:56,741 INFO L225 Difference]: With dead ends: 111 [2019-08-05 10:43:56,741 INFO L226 Difference]: Without dead ends: 110 [2019-08-05 10:43:56,741 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-08-05 10:43:56,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-08-05 10:43:56,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-08-05 10:43:56,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-08-05 10:43:56,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-08-05 10:43:56,744 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2019-08-05 10:43:56,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:56,744 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-08-05 10:43:56,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-08-05 10:43:56,745 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-08-05 10:43:56,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-08-05 10:43:56,745 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:56,745 INFO L399 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2019-08-05 10:43:56,745 INFO L418 AbstractCegarLoop]: === Iteration 107 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:56,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:56,746 INFO L82 PathProgramCache]: Analyzing trace with hash -132755232, now seen corresponding path program 106 times [2019-08-05 10:43:56,746 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:56,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:56,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 108 conjunts are in the unsatisfiable core [2019-08-05 10:43:56,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:00,997 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:00,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:00,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2019-08-05 10:44:00,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-08-05 10:44:00,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-08-05 10:44:00,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 10:44:00,999 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2019-08-05 10:44:01,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:01,146 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-08-05 10:44:01,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-08-05 10:44:01,146 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2019-08-05 10:44:01,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:01,147 INFO L225 Difference]: With dead ends: 112 [2019-08-05 10:44:01,147 INFO L226 Difference]: Without dead ends: 111 [2019-08-05 10:44:01,148 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2019-08-05 10:44:01,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-08-05 10:44:01,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-08-05 10:44:01,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-08-05 10:44:01,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-08-05 10:44:01,149 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2019-08-05 10:44:01,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:01,149 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-08-05 10:44:01,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-08-05 10:44:01,150 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-08-05 10:44:01,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-08-05 10:44:01,150 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:01,150 INFO L399 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2019-08-05 10:44:01,151 INFO L418 AbstractCegarLoop]: === Iteration 108 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:01,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:01,151 INFO L82 PathProgramCache]: Analyzing trace with hash 179553158, now seen corresponding path program 107 times [2019-08-05 10:44:01,151 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:01,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:01,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 109 conjunts are in the unsatisfiable core [2019-08-05 10:44:01,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:05,372 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:05,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:05,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2019-08-05 10:44:05,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-08-05 10:44:05,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-08-05 10:44:05,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-08-05 10:44:05,374 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2019-08-05 10:44:05,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:05,591 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-08-05 10:44:05,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-08-05 10:44:05,592 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2019-08-05 10:44:05,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:05,593 INFO L225 Difference]: With dead ends: 113 [2019-08-05 10:44:05,593 INFO L226 Difference]: Without dead ends: 112 [2019-08-05 10:44:05,593 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-08-05 10:44:05,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-08-05 10:44:05,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-08-05 10:44:05,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-08-05 10:44:05,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-08-05 10:44:05,595 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2019-08-05 10:44:05,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:05,596 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-08-05 10:44:05,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-08-05 10:44:05,596 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-08-05 10:44:05,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-08-05 10:44:05,596 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:05,597 INFO L399 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2019-08-05 10:44:05,597 INFO L418 AbstractCegarLoop]: === Iteration 109 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:05,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:05,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1271178656, now seen corresponding path program 108 times [2019-08-05 10:44:05,598 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:05,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:05,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 110 conjunts are in the unsatisfiable core [2019-08-05 10:44:05,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:09,870 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:09,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:09,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2019-08-05 10:44:09,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-08-05 10:44:09,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-08-05 10:44:09,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 10:44:09,873 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2019-08-05 10:44:10,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:10,041 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-08-05 10:44:10,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-08-05 10:44:10,042 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2019-08-05 10:44:10,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:10,042 INFO L225 Difference]: With dead ends: 114 [2019-08-05 10:44:10,042 INFO L226 Difference]: Without dead ends: 113 [2019-08-05 10:44:10,043 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2019-08-05 10:44:10,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-08-05 10:44:10,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-08-05 10:44:10,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-08-05 10:44:10,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-08-05 10:44:10,045 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2019-08-05 10:44:10,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:10,046 INFO L475 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-08-05 10:44:10,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-08-05 10:44:10,046 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-08-05 10:44:10,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-08-05 10:44:10,046 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:10,046 INFO L399 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2019-08-05 10:44:10,047 INFO L418 AbstractCegarLoop]: === Iteration 110 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:10,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:10,047 INFO L82 PathProgramCache]: Analyzing trace with hash 751830726, now seen corresponding path program 109 times [2019-08-05 10:44:10,047 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:10,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:10,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 111 conjunts are in the unsatisfiable core [2019-08-05 10:44:10,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:14,325 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:14,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:14,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2019-08-05 10:44:14,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-08-05 10:44:14,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-08-05 10:44:14,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-08-05 10:44:14,327 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2019-08-05 10:44:14,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:14,514 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-08-05 10:44:14,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-08-05 10:44:14,514 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2019-08-05 10:44:14,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:14,515 INFO L225 Difference]: With dead ends: 115 [2019-08-05 10:44:14,515 INFO L226 Difference]: Without dead ends: 114 [2019-08-05 10:44:14,516 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-08-05 10:44:14,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-08-05 10:44:14,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-08-05 10:44:14,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-08-05 10:44:14,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-08-05 10:44:14,518 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2019-08-05 10:44:14,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:14,519 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-08-05 10:44:14,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-08-05 10:44:14,519 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-08-05 10:44:14,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-08-05 10:44:14,519 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:14,520 INFO L399 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2019-08-05 10:44:14,520 INFO L418 AbstractCegarLoop]: === Iteration 111 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:14,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:14,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1831914080, now seen corresponding path program 110 times [2019-08-05 10:44:14,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:14,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:14,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 112 conjunts are in the unsatisfiable core [2019-08-05 10:44:14,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:18,687 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:18,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:18,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2019-08-05 10:44:18,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-08-05 10:44:18,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-08-05 10:44:18,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 10:44:18,689 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 113 states. [2019-08-05 10:44:18,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:18,891 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-08-05 10:44:18,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-08-05 10:44:18,891 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 113 [2019-08-05 10:44:18,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:18,892 INFO L225 Difference]: With dead ends: 116 [2019-08-05 10:44:18,892 INFO L226 Difference]: Without dead ends: 115 [2019-08-05 10:44:18,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2019-08-05 10:44:18,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-08-05 10:44:18,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-08-05 10:44:18,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-08-05 10:44:18,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-08-05 10:44:18,895 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2019-08-05 10:44:18,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:18,896 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-08-05 10:44:18,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-08-05 10:44:18,896 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-08-05 10:44:18,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-08-05 10:44:18,897 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:18,897 INFO L399 BasicCegarLoop]: trace histogram [111, 1, 1, 1] [2019-08-05 10:44:18,897 INFO L418 AbstractCegarLoop]: === Iteration 112 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:18,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:18,897 INFO L82 PathProgramCache]: Analyzing trace with hash 954759686, now seen corresponding path program 111 times [2019-08-05 10:44:18,898 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:18,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:18,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 113 conjunts are in the unsatisfiable core [2019-08-05 10:44:18,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:23,544 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:23,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:23,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2019-08-05 10:44:23,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-08-05 10:44:23,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-08-05 10:44:23,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-08-05 10:44:23,546 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 114 states. [2019-08-05 10:44:23,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:23,720 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-08-05 10:44:23,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-08-05 10:44:23,721 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 114 [2019-08-05 10:44:23,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:23,722 INFO L225 Difference]: With dead ends: 117 [2019-08-05 10:44:23,722 INFO L226 Difference]: Without dead ends: 116 [2019-08-05 10:44:23,722 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-08-05 10:44:23,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-08-05 10:44:23,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2019-08-05 10:44:23,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-08-05 10:44:23,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-08-05 10:44:23,725 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 114 [2019-08-05 10:44:23,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:23,725 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-08-05 10:44:23,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-08-05 10:44:23,725 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-08-05 10:44:23,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-08-05 10:44:23,726 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:23,726 INFO L399 BasicCegarLoop]: trace histogram [112, 1, 1, 1] [2019-08-05 10:44:23,726 INFO L418 AbstractCegarLoop]: === Iteration 113 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:23,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:23,727 INFO L82 PathProgramCache]: Analyzing trace with hash -467222752, now seen corresponding path program 112 times [2019-08-05 10:44:23,727 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:23,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:23,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 114 conjunts are in the unsatisfiable core [2019-08-05 10:44:23,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:28,508 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:28,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:28,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2019-08-05 10:44:28,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-08-05 10:44:28,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-08-05 10:44:28,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 10:44:28,510 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 115 states. [2019-08-05 10:44:28,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:28,676 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2019-08-05 10:44:28,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-08-05 10:44:28,676 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 115 [2019-08-05 10:44:28,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:28,677 INFO L225 Difference]: With dead ends: 118 [2019-08-05 10:44:28,677 INFO L226 Difference]: Without dead ends: 117 [2019-08-05 10:44:28,678 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 10:44:28,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-08-05 10:44:28,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-08-05 10:44:28,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-08-05 10:44:28,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-08-05 10:44:28,680 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 115 [2019-08-05 10:44:28,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:28,680 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-08-05 10:44:28,680 INFO L476 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-08-05 10:44:28,680 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-08-05 10:44:28,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-08-05 10:44:28,680 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:28,681 INFO L399 BasicCegarLoop]: trace histogram [113, 1, 1, 1] [2019-08-05 10:44:28,681 INFO L418 AbstractCegarLoop]: === Iteration 114 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:28,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:28,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1599005370, now seen corresponding path program 113 times [2019-08-05 10:44:28,681 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:28,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:28,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 115 conjunts are in the unsatisfiable core [2019-08-05 10:44:28,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:33,411 INFO L134 CoverageAnalysis]: Checked inductivity of 6441 backedges. 0 proven. 6441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:33,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:33,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2019-08-05 10:44:33,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-08-05 10:44:33,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-08-05 10:44:33,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-08-05 10:44:33,413 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 116 states. [2019-08-05 10:44:33,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:33,645 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2019-08-05 10:44:33,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-08-05 10:44:33,646 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 116 [2019-08-05 10:44:33,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:33,647 INFO L225 Difference]: With dead ends: 119 [2019-08-05 10:44:33,647 INFO L226 Difference]: Without dead ends: 118 [2019-08-05 10:44:33,648 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-08-05 10:44:33,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-08-05 10:44:33,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-08-05 10:44:33,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-08-05 10:44:33,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2019-08-05 10:44:33,650 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 116 [2019-08-05 10:44:33,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:33,651 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2019-08-05 10:44:33,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-08-05 10:44:33,651 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2019-08-05 10:44:33,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-08-05 10:44:33,651 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:33,651 INFO L399 BasicCegarLoop]: trace histogram [114, 1, 1, 1] [2019-08-05 10:44:33,652 INFO L418 AbstractCegarLoop]: === Iteration 115 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:33,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:33,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1970439136, now seen corresponding path program 114 times [2019-08-05 10:44:33,652 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:33,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:33,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 116 conjunts are in the unsatisfiable core [2019-08-05 10:44:33,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:38,436 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:38,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:38,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2019-08-05 10:44:38,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 117 states [2019-08-05 10:44:38,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2019-08-05 10:44:38,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-08-05 10:44:38,438 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 117 states. [2019-08-05 10:44:38,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:38,636 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-08-05 10:44:38,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2019-08-05 10:44:38,637 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 117 [2019-08-05 10:44:38,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:38,637 INFO L225 Difference]: With dead ends: 120 [2019-08-05 10:44:38,637 INFO L226 Difference]: Without dead ends: 119 [2019-08-05 10:44:38,638 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2019-08-05 10:44:38,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-08-05 10:44:38,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-08-05 10:44:38,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 10:44:38,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2019-08-05 10:44:38,640 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 117 [2019-08-05 10:44:38,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:38,640 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2019-08-05 10:44:38,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 117 states. [2019-08-05 10:44:38,640 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2019-08-05 10:44:38,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-08-05 10:44:38,641 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:38,641 INFO L399 BasicCegarLoop]: trace histogram [115, 1, 1, 1] [2019-08-05 10:44:38,641 INFO L418 AbstractCegarLoop]: === Iteration 116 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:38,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:38,641 INFO L82 PathProgramCache]: Analyzing trace with hash 954069126, now seen corresponding path program 115 times [2019-08-05 10:44:38,642 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:38,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:38,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 117 conjunts are in the unsatisfiable core [2019-08-05 10:44:38,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:43,414 INFO L134 CoverageAnalysis]: Checked inductivity of 6670 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:43,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:43,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2019-08-05 10:44:43,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-08-05 10:44:43,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-08-05 10:44:43,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-08-05 10:44:43,416 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 118 states. [2019-08-05 10:44:43,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:43,593 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2019-08-05 10:44:43,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2019-08-05 10:44:43,594 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 118 [2019-08-05 10:44:43,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:43,595 INFO L225 Difference]: With dead ends: 121 [2019-08-05 10:44:43,595 INFO L226 Difference]: Without dead ends: 120 [2019-08-05 10:44:43,596 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-08-05 10:44:43,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-08-05 10:44:43,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-08-05 10:44:43,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-08-05 10:44:43,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2019-08-05 10:44:43,598 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 118 [2019-08-05 10:44:43,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:43,598 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2019-08-05 10:44:43,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-08-05 10:44:43,598 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2019-08-05 10:44:43,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-08-05 10:44:43,599 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:43,599 INFO L399 BasicCegarLoop]: trace histogram [116, 1, 1, 1] [2019-08-05 10:44:43,599 INFO L418 AbstractCegarLoop]: === Iteration 117 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:43,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:43,599 INFO L82 PathProgramCache]: Analyzing trace with hash -488630112, now seen corresponding path program 116 times [2019-08-05 10:44:43,600 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:43,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:43,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 118 conjunts are in the unsatisfiable core [2019-08-05 10:44:43,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:44:48,698 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:44:48,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:44:48,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2019-08-05 10:44:48,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-08-05 10:44:48,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-08-05 10:44:48,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2019-08-05 10:44:48,700 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 119 states. [2019-08-05 10:44:48,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:44:48,882 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2019-08-05 10:44:48,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-08-05 10:44:48,882 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 119 [2019-08-05 10:44:48,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:44:48,883 INFO L225 Difference]: With dead ends: 122 [2019-08-05 10:44:48,883 INFO L226 Difference]: Without dead ends: 121 [2019-08-05 10:44:48,884 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2019-08-05 10:44:48,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-08-05 10:44:48,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-08-05 10:44:48,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-08-05 10:44:48,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-08-05 10:44:48,886 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 119 [2019-08-05 10:44:48,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:44:48,886 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-08-05 10:44:48,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-08-05 10:44:48,886 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-08-05 10:44:48,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-08-05 10:44:48,887 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:44:48,887 INFO L399 BasicCegarLoop]: trace histogram [117, 1, 1, 1] [2019-08-05 10:44:48,887 INFO L418 AbstractCegarLoop]: === Iteration 118 === [waterTankErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:44:48,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:44:48,887 INFO L82 PathProgramCache]: Analyzing trace with hash 2032333766, now seen corresponding path program 117 times [2019-08-05 10:44:48,888 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:44:48,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:44:48,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 119 conjunts are in the unsatisfiable core [2019-08-05 10:44:48,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-05 10:44:52,772 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 10:44:52,772 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:44:52,776 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:44:52,776 INFO L202 PluginConnector]: Adding new model WaterTank1.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:44:52 BoogieIcfgContainer [2019-08-05 10:44:52,777 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:44:52,779 INFO L168 Benchmark]: Toolchain (without parser) took 240060.21 ms. Allocated memory was 133.7 MB in the beginning and 910.2 MB in the end (delta: 776.5 MB). Free memory was 111.3 MB in the beginning and 570.3 MB in the end (delta: -459.0 MB). Peak memory consumption was 317.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:44:52,787 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 133.7 MB. Free memory is still 112.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:44:52,788 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.15 ms. Allocated memory is still 133.7 MB. Free memory was 111.3 MB in the beginning and 109.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:44:52,788 INFO L168 Benchmark]: Boogie Preprocessor took 20.33 ms. Allocated memory is still 133.7 MB. Free memory was 109.2 MB in the beginning and 108.4 MB in the end (delta: 838.8 kB). Peak memory consumption was 838.8 kB. Max. memory is 7.1 GB. [2019-08-05 10:44:52,789 INFO L168 Benchmark]: RCFGBuilder took 318.25 ms. Allocated memory is still 133.7 MB. Free memory was 108.0 MB in the beginning and 99.2 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:44:52,789 INFO L168 Benchmark]: TraceAbstraction took 239682.98 ms. Allocated memory was 133.7 MB in the beginning and 910.2 MB in the end (delta: 776.5 MB). Free memory was 98.8 MB in the beginning and 570.3 MB in the end (delta: -471.5 MB). Peak memory consumption was 305.0 MB. Max. memory is 7.1 GB. [2019-08-05 10:44:52,794 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - 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 112.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 34.15 ms. Allocated memory is still 133.7 MB. Free memory was 111.3 MB in the beginning and 109.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 20.33 ms. Allocated memory is still 133.7 MB. Free memory was 109.2 MB in the beginning and 108.4 MB in the end (delta: 838.8 kB). Peak memory consumption was 838.8 kB. Max. memory is 7.1 GB. * RCFGBuilder took 318.25 ms. Allocated memory is still 133.7 MB. Free memory was 108.0 MB in the beginning and 99.2 MB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 239682.98 ms. Allocated memory was 133.7 MB in the beginning and 910.2 MB in the end (delta: 776.5 MB). Free memory was 98.8 MB in the beginning and 570.3 MB in the end (delta: -471.5 MB). Peak memory consumption was 305.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 26]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 26). Cancelled while BasicCegarLoop was analyzing trace of length 121 with TraceHistMax 117,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 104 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 239.6s OverallTime, 118 OverallIterations, 117 TraceHistogramMax, 14.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 352 SDtfs, 0 SDslu, 1998 SDs, 0 SdLazy, 8868 SolverSat, 229 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7020 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 6903 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 216.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=121occurred in iteration=117, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 117 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 219.0s InterpolantComputationTime, 7137 NumberOfCodeBlocks, 7137 NumberOfCodeBlocksAsserted, 117 NumberOfCheckSat, 7020 ConstructedInterpolants, 0 QuantifiedInterpolants, 1663964 SizeOfPredicates, 2 NumberOfNonLiveVariables, 34866 ConjunctsInSsa, 7020 ConjunctsInUnsatCore, 117 InterpolantComputations, 1 PerfectInterpolantSequences, 0/266916 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown