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/InvariantChecking/showcase/2019ProgVerif-Sheet12Ex03-Square.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:31:08,540 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:31:08,542 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:31:08,555 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:31:08,555 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:31:08,557 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:31:08,558 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:31:08,560 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:31:08,561 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:31:08,562 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:31:08,563 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:31:08,564 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:31:08,564 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:31:08,565 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:31:08,566 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:31:08,567 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:31:08,568 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:31:08,568 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:31:08,570 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:31:08,572 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:31:08,574 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:31:08,575 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:31:08,576 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:31:08,577 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:31:08,579 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:31:08,579 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:31:08,579 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:31:08,580 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:31:08,581 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:31:08,582 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:31:08,582 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:31:08,583 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:31:08,584 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:31:08,584 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:31:08,585 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:31:08,585 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:31:08,586 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:31:08,586 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:31:08,587 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:31:08,587 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:31:08,588 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:31:08,614 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:31:08,626 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:31:08,630 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:31:08,631 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:31:08,632 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:31:08,633 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/InvariantChecking/showcase/2019ProgVerif-Sheet12Ex03-Square.bpl [2019-08-05 10:31:08,633 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/InvariantChecking/showcase/2019ProgVerif-Sheet12Ex03-Square.bpl' [2019-08-05 10:31:08,662 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:31:08,664 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:31:08,664 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:31:08,665 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:31:08,665 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:31:08,679 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "2019ProgVerif-Sheet12Ex03-Square.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:08" (1/1) ... [2019-08-05 10:31:08,687 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "2019ProgVerif-Sheet12Ex03-Square.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:08" (1/1) ... [2019-08-05 10:31:08,692 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:31:08,693 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:31:08,693 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:31:08,695 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:31:08,696 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:31:08,696 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:31:08,696 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:31:08,706 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "2019ProgVerif-Sheet12Ex03-Square.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:08" (1/1) ... [2019-08-05 10:31:08,706 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "2019ProgVerif-Sheet12Ex03-Square.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:08" (1/1) ... [2019-08-05 10:31:08,707 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "2019ProgVerif-Sheet12Ex03-Square.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:08" (1/1) ... [2019-08-05 10:31:08,707 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "2019ProgVerif-Sheet12Ex03-Square.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:08" (1/1) ... [2019-08-05 10:31:08,710 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "2019ProgVerif-Sheet12Ex03-Square.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:08" (1/1) ... [2019-08-05 10:31:08,713 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "2019ProgVerif-Sheet12Ex03-Square.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:08" (1/1) ... [2019-08-05 10:31:08,714 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "2019ProgVerif-Sheet12Ex03-Square.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:08" (1/1) ... [2019-08-05 10:31:08,716 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:31:08,716 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:31:08,716 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:31:08,716 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:31:08,717 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "2019ProgVerif-Sheet12Ex03-Square.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:08" (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:31:08,781 INFO L124 BoogieDeclarations]: Specification and implementation of procedure square given in one single declaration [2019-08-05 10:31:08,782 INFO L130 BoogieDeclarations]: Found specification of procedure square [2019-08-05 10:31:08,782 INFO L138 BoogieDeclarations]: Found implementation of procedure square [2019-08-05 10:31:08,853 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-08-05 10:31:08,984 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:31:08,984 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:31:08,985 INFO L202 PluginConnector]: Adding new model 2019ProgVerif-Sheet12Ex03-Square.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:31:08 BoogieIcfgContainer [2019-08-05 10:31:08,986 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:31:08,987 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:31:08,988 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:31:08,991 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:31:08,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "2019ProgVerif-Sheet12Ex03-Square.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:31:08" (1/2) ... [2019-08-05 10:31:08,992 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39980a22 and model type 2019ProgVerif-Sheet12Ex03-Square.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:31:08, skipping insertion in model container [2019-08-05 10:31:08,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "2019ProgVerif-Sheet12Ex03-Square.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:31:08" (2/2) ... [2019-08-05 10:31:08,994 INFO L109 eAbstractionObserver]: Analyzing ICFG 2019ProgVerif-Sheet12Ex03-Square.bpl [2019-08-05 10:31:09,004 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:31:09,016 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:31:09,035 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:31:09,068 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:31:09,069 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:31:09,069 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:31:09,070 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:31:09,070 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:31:09,070 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:31:09,070 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:31:09,070 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:31:09,070 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:31:09,087 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:31:09,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:31:09,102 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:09,103 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:31:09,108 INFO L418 AbstractCegarLoop]: === Iteration 1 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:09,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:09,115 INFO L82 PathProgramCache]: Analyzing trace with hash 39627, now seen corresponding path program 1 times [2019-08-05 10:31:09,173 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:09,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:09,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:31:09,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:09,345 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:31:09,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:31:09,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:31:09,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:31:09,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:31:09,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:31:09,370 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:31:09,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:09,434 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:31:09,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:31:09,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:31:09,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:09,447 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:31:09,447 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:31:09,449 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:31:09,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:31:09,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:31:09,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:31:09,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:31:09,484 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:31:09,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:09,485 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:31:09,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:31:09,485 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:31:09,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:31:09,486 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:09,486 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:31:09,486 INFO L418 AbstractCegarLoop]: === Iteration 2 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:09,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:09,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1226462, now seen corresponding path program 1 times [2019-08-05 10:31:09,488 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:09,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:09,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 10:31:09,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:09,744 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:31:09,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:09,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:31:09,747 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:31:09,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:31:09,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:31:09,749 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:31:09,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:09,864 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:31:09,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:31:09,865 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:31:09,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:09,866 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:31:09,866 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:31:09,868 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:31:09,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:31:09,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:31:09,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:31:09,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:31:09,870 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:31:09,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:09,871 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:31:09,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:31:09,871 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:31:09,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:31:09,872 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:09,872 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:31:09,872 INFO L418 AbstractCegarLoop]: === Iteration 3 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:09,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:09,873 INFO L82 PathProgramCache]: Analyzing trace with hash 38018347, now seen corresponding path program 2 times [2019-08-05 10:31:09,874 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:09,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:09,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:31:09,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:10,091 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:31:10,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:10,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:31:10,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:31:10,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:31:10,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:31:10,096 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:31:10,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:10,157 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:31:10,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:31:10,158 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:31:10,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:10,159 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:31:10,159 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:31:10,160 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:31:10,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:31:10,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:31:10,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:31:10,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:31:10,162 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:31:10,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:10,162 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:31:10,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:31:10,163 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:31:10,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:31:10,163 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:10,164 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:31:10,164 INFO L418 AbstractCegarLoop]: === Iteration 4 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:10,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:10,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1178566782, now seen corresponding path program 3 times [2019-08-05 10:31:10,166 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:10,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:10,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:31:10,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:10,627 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:31:10,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:10,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:31:10,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:31:10,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:31:10,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:31:10,629 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2019-08-05 10:31:10,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:10,779 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:31:10,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:31:10,779 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-08-05 10:31:10,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:10,780 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:31:10,780 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:31:10,781 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:31:10,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:31:10,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:31:10,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:31:10,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:31:10,783 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:31:10,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:10,787 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:31:10,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:31:10,787 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:31:10,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:31:10,788 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:10,788 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:31:10,788 INFO L418 AbstractCegarLoop]: === Iteration 5 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:10,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:10,789 INFO L82 PathProgramCache]: Analyzing trace with hash -2119137397, now seen corresponding path program 4 times [2019-08-05 10:31:10,790 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:10,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:10,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 10:31:10,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:11,113 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:31:11,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:11,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:31:11,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:31:11,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:31:11,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:31:11,117 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2019-08-05 10:31:11,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:11,238 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:31:11,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:31:11,239 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-08-05 10:31:11,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:11,240 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:31:11,240 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:31:11,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:31:11,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:31:11,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:31:11,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:31:11,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:31:11,244 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:31:11,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:11,245 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:31:11,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:31:11,245 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:31:11,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:31:11,246 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:11,246 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:31:11,246 INFO L418 AbstractCegarLoop]: === Iteration 6 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:11,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:11,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1268751842, now seen corresponding path program 5 times [2019-08-05 10:31:11,247 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:11,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:11,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 10:31:11,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:11,676 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:31:11,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:11,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:31:11,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:31:11,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:31:11,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:31:11,678 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2019-08-05 10:31:11,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:11,882 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:31:11,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:31:11,889 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-08-05 10:31:11,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:11,890 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:31:11,890 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:31:11,891 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:31:11,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:31:11,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:31:11,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:31:11,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:31:11,893 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:31:11,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:11,894 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:31:11,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:31:11,894 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:31:11,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:31:11,895 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:11,895 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:31:11,895 INFO L418 AbstractCegarLoop]: === Iteration 7 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:11,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:11,896 INFO L82 PathProgramCache]: Analyzing trace with hash -676603413, now seen corresponding path program 6 times [2019-08-05 10:31:11,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:11,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:11,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:31:11,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:12,229 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:31:12,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:12,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:31:12,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:31:12,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:31:12,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:31:12,231 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2019-08-05 10:31:12,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:12,331 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:31:12,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:31:12,333 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-08-05 10:31:12,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:12,334 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:31:12,335 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:31:12,335 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:31:12,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:31:12,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:31:12,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:31:12,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:31:12,338 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 10:31:12,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:12,338 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:31:12,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:31:12,338 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:31:12,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:31:12,339 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:12,339 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 10:31:12,339 INFO L418 AbstractCegarLoop]: === Iteration 8 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:12,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:12,340 INFO L82 PathProgramCache]: Analyzing trace with hash 500128702, now seen corresponding path program 7 times [2019-08-05 10:31:12,340 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:12,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:12,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 25 conjunts are in the unsatisfiable core [2019-08-05 10:31:12,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:12,663 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:31:12,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:12,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:31:12,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:31:12,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:31:12,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:31:12,666 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 11 states. [2019-08-05 10:31:12,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:12,823 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:31:12,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:31:12,824 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2019-08-05 10:31:12,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:12,825 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:31:12,825 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:31:12,826 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:31:12,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:31:12,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:31:12,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:31:12,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:31:12,828 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 10:31:12,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:12,829 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:31:12,829 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:31:12,829 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:31:12,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:31:12,829 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:12,830 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:31:12,830 INFO L418 AbstractCegarLoop]: === Iteration 9 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:12,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:12,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1675881397, now seen corresponding path program 8 times [2019-08-05 10:31:12,831 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:12,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:12,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 28 conjunts are in the unsatisfiable core [2019-08-05 10:31:12,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:13,155 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:31:13,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:13,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:31:13,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:31:13,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:31:13,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:31:13,158 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2019-08-05 10:31:13,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:13,301 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:31:13,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:31:13,301 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2019-08-05 10:31:13,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:13,302 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:31:13,302 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:31:13,303 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:31:13,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:31:13,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:31:13,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:31:13,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:31:13,306 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 10:31:13,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:13,306 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:31:13,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:31:13,307 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:31:13,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:31:13,307 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:13,307 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 10:31:13,308 INFO L418 AbstractCegarLoop]: === Iteration 10 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:13,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:13,308 INFO L82 PathProgramCache]: Analyzing trace with hash -412717730, now seen corresponding path program 9 times [2019-08-05 10:31:13,309 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:13,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:13,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:31:13,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:13,608 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:31:13,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:13,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:31:13,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:31:13,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:31:13,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:31:13,609 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2019-08-05 10:31:13,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:13,890 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:31:13,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 10:31:13,890 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2019-08-05 10:31:13,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:13,891 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:31:13,891 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:31:13,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:31:13,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:31:13,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:31:13,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:31:13,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:31:13,895 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 10:31:13,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:13,895 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:31:13,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:31:13,896 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:31:13,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:31:13,896 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:13,896 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 10:31:13,896 INFO L418 AbstractCegarLoop]: === Iteration 11 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:13,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:13,897 INFO L82 PathProgramCache]: Analyzing trace with hash 90650283, now seen corresponding path program 10 times [2019-08-05 10:31:13,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:13,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:13,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:31:13,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:14,245 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:31:14,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:14,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:31:14,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 10:31:14,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 10:31:14,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-08-05 10:31:14,247 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2019-08-05 10:31:14,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:14,439 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:31:14,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 10:31:14,439 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2019-08-05 10:31:14,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:14,440 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:31:14,440 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:31:14,441 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:31:14,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:31:14,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:31:14,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:31:14,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:31:14,445 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 10:31:14,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:14,445 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:31:14,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 10:31:14,445 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:31:14,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:31:14,446 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:14,446 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 10:31:14,446 INFO L418 AbstractCegarLoop]: === Iteration 12 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:14,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:14,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1484810498, now seen corresponding path program 11 times [2019-08-05 10:31:14,447 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:14,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:14,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 37 conjunts are in the unsatisfiable core [2019-08-05 10:31:14,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:14,877 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:31:14,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:14,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 10:31:14,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 10:31:14,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 10:31:14,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-08-05 10:31:14,879 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 15 states. [2019-08-05 10:31:15,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:15,059 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 10:31:15,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 10:31:15,066 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2019-08-05 10:31:15,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:15,066 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:31:15,066 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:31:15,067 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:31:15,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:31:15,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:31:15,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:31:15,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:31:15,069 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 10:31:15,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:15,070 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:31:15,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 10:31:15,070 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:31:15,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:31:15,070 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:15,071 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 10:31:15,071 INFO L418 AbstractCegarLoop]: === Iteration 13 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:15,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:15,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1215512843, now seen corresponding path program 12 times [2019-08-05 10:31:15,072 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:15,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:15,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 40 conjunts are in the unsatisfiable core [2019-08-05 10:31:15,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:15,676 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:31:15,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:15,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 10:31:15,676 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 10:31:15,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 10:31:15,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-08-05 10:31:15,677 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 16 states. [2019-08-05 10:31:16,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:16,171 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 10:31:16,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 10:31:16,172 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2019-08-05 10:31:16,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:16,173 INFO L225 Difference]: With dead ends: 18 [2019-08-05 10:31:16,173 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:31:16,174 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:31:16,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:31:16,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:31:16,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:31:16,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:31:16,178 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 10:31:16,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:16,179 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:31:16,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 10:31:16,179 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:31:16,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:31:16,179 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:16,179 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-05 10:31:16,180 INFO L418 AbstractCegarLoop]: === Iteration 14 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:16,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:16,180 INFO L82 PathProgramCache]: Analyzing trace with hash -973809506, now seen corresponding path program 13 times [2019-08-05 10:31:16,181 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:16,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:16,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:31:16,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:16,670 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:31:16,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:16,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 10:31:16,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 10:31:16,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 10:31:16,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2019-08-05 10:31:16,672 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 17 states. [2019-08-05 10:31:16,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:16,880 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 10:31:16,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 10:31:16,881 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2019-08-05 10:31:16,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:16,882 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:31:16,882 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 10:31:16,882 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:31:16,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 10:31:16,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 10:31:16,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 10:31:16,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 10:31:16,885 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 10:31:16,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:16,885 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 10:31:16,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 10:31:16,885 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 10:31:16,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 10:31:16,886 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:16,886 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-05 10:31:16,886 INFO L418 AbstractCegarLoop]: === Iteration 15 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:16,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:16,886 INFO L82 PathProgramCache]: Analyzing trace with hash -123325589, now seen corresponding path program 14 times [2019-08-05 10:31:16,887 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:16,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:16,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 46 conjunts are in the unsatisfiable core [2019-08-05 10:31:16,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:17,157 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:31:17,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:17,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 10:31:17,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 10:31:17,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 10:31:17,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:31:17,159 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 18 states. [2019-08-05 10:31:17,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:17,428 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:31:17,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 10:31:17,429 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2019-08-05 10:31:17,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:17,430 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:31:17,430 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:31:17,431 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:31:17,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:31:17,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 10:31:17,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 10:31:17,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 10:31:17,434 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 10:31:17,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:17,435 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 10:31:17,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 10:31:17,435 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 10:31:17,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 10:31:17,435 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:17,435 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-05 10:31:17,436 INFO L418 AbstractCegarLoop]: === Iteration 16 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:17,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:17,436 INFO L82 PathProgramCache]: Analyzing trace with hash 471872062, now seen corresponding path program 15 times [2019-08-05 10:31:17,437 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:17,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:17,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:31:17,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:17,829 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:31:17,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:17,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 10:31:17,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:31:17,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:31:17,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:31:17,831 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 19 states. [2019-08-05 10:31:18,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:18,093 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 10:31:18,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:31:18,094 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2019-08-05 10:31:18,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:18,095 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:31:18,095 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:31:18,096 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:31:18,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:31:18,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:31:18,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:31:18,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:31:18,099 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 10:31:18,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:18,100 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:31:18,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:31:18,100 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:31:18,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:31:18,101 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:18,101 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 10:31:18,101 INFO L418 AbstractCegarLoop]: === Iteration 17 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:18,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:18,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1743130059, now seen corresponding path program 16 times [2019-08-05 10:31:18,102 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:18,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:18,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 52 conjunts are in the unsatisfiable core [2019-08-05 10:31:18,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:18,407 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:31:18,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:18,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:31:18,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:31:18,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:31:18,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:31:18,409 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 20 states. [2019-08-05 10:31:18,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:18,744 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 10:31:18,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:31:18,745 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2019-08-05 10:31:18,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:18,746 INFO L225 Difference]: With dead ends: 22 [2019-08-05 10:31:18,746 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:31:18,747 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:31:18,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:31:18,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:31:18,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:31:18,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:31:18,750 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 10:31:18,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:18,750 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:31:18,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:31:18,751 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:31:18,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:31:18,751 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:18,751 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-05 10:31:18,752 INFO L418 AbstractCegarLoop]: === Iteration 18 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:18,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:18,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1797544994, now seen corresponding path program 17 times [2019-08-05 10:31:18,753 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:18,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:18,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 55 conjunts are in the unsatisfiable core [2019-08-05 10:31:18,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:19,135 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:31:19,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:19,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:31:19,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 10:31:19,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 10:31:19,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-08-05 10:31:19,137 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 21 states. [2019-08-05 10:31:19,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:19,506 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 10:31:19,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 10:31:19,507 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2019-08-05 10:31:19,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:19,508 INFO L225 Difference]: With dead ends: 23 [2019-08-05 10:31:19,508 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 10:31:19,509 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:31:19,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 10:31:19,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 10:31:19,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 10:31:19,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 10:31:19,512 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 10:31:19,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:19,513 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 10:31:19,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 10:31:19,513 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 10:31:19,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 10:31:19,514 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:19,514 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-05 10:31:19,514 INFO L418 AbstractCegarLoop]: === Iteration 19 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:19,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:19,514 INFO L82 PathProgramCache]: Analyzing trace with hash 110678059, now seen corresponding path program 18 times [2019-08-05 10:31:19,515 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:19,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:19,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 58 conjunts are in the unsatisfiable core [2019-08-05 10:31:19,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:20,450 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-08-05 10:31:21,008 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-08-05 10:31:21,683 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:31:21,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:21,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 10:31:21,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 10:31:21,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 10:31:21,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2019-08-05 10:31:21,685 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 22 states. [2019-08-05 10:31:22,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:22,071 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 10:31:22,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 10:31:22,072 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2019-08-05 10:31:22,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:22,073 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:31:22,073 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 10:31:22,074 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:31:22,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 10:31:22,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 10:31:22,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:31:22,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 10:31:22,077 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-05 10:31:22,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:22,077 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 10:31:22,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 10:31:22,077 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 10:31:22,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 10:31:22,078 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:22,078 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-05 10:31:22,078 INFO L418 AbstractCegarLoop]: === Iteration 20 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:22,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:22,079 INFO L82 PathProgramCache]: Analyzing trace with hash -863949442, now seen corresponding path program 19 times [2019-08-05 10:31:22,079 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:22,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:22,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 61 conjunts are in the unsatisfiable core [2019-08-05 10:31:22,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:22,718 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:31:22,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:22,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 10:31:22,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-08-05 10:31:22,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-08-05 10:31:22,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2019-08-05 10:31:22,720 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 23 states. [2019-08-05 10:31:23,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:23,154 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-08-05 10:31:23,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-08-05 10:31:23,156 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2019-08-05 10:31:23,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:23,157 INFO L225 Difference]: With dead ends: 25 [2019-08-05 10:31:23,157 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:31:23,157 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:31:23,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:31:23,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 10:31:23,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 10:31:23,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 10:31:23,160 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-05 10:31:23,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:23,160 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 10:31:23,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-08-05 10:31:23,161 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 10:31:23,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 10:31:23,161 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:23,161 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-05 10:31:23,162 INFO L418 AbstractCegarLoop]: === Iteration 21 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:23,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:23,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1012630901, now seen corresponding path program 20 times [2019-08-05 10:31:23,163 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:23,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:23,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 64 conjunts are in the unsatisfiable core [2019-08-05 10:31:23,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:23,606 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:31:23,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:23,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-08-05 10:31:23,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-08-05 10:31:23,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-08-05 10:31:23,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-08-05 10:31:23,608 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 24 states. [2019-08-05 10:31:24,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:24,014 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-08-05 10:31:24,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-08-05 10:31:24,014 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2019-08-05 10:31:24,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:24,016 INFO L225 Difference]: With dead ends: 26 [2019-08-05 10:31:24,016 INFO L226 Difference]: Without dead ends: 25 [2019-08-05 10:31:24,017 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:31:24,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-08-05 10:31:24,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-08-05 10:31:24,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-08-05 10:31:24,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-08-05 10:31:24,019 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-08-05 10:31:24,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:24,019 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-08-05 10:31:24,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-08-05 10:31:24,019 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-08-05 10:31:24,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 10:31:24,020 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:24,020 INFO L399 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-08-05 10:31:24,020 INFO L418 AbstractCegarLoop]: === Iteration 22 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:24,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:24,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1326788834, now seen corresponding path program 21 times [2019-08-05 10:31:24,021 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:24,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:24,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 67 conjunts are in the unsatisfiable core [2019-08-05 10:31:24,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:24,556 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:31:24,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:24,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-08-05 10:31:24,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-08-05 10:31:24,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-08-05 10:31:24,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2019-08-05 10:31:24,557 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 25 states. [2019-08-05 10:31:25,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:25,447 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-08-05 10:31:25,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-08-05 10:31:25,450 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2019-08-05 10:31:25,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:25,450 INFO L225 Difference]: With dead ends: 27 [2019-08-05 10:31:25,450 INFO L226 Difference]: Without dead ends: 26 [2019-08-05 10:31:25,451 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:31:25,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-08-05 10:31:25,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-08-05 10:31:25,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-08-05 10:31:25,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-08-05 10:31:25,453 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-08-05 10:31:25,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:25,453 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-08-05 10:31:25,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-08-05 10:31:25,454 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-08-05 10:31:25,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-08-05 10:31:25,454 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:25,454 INFO L399 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-08-05 10:31:25,455 INFO L418 AbstractCegarLoop]: === Iteration 23 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:25,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:25,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1819217131, now seen corresponding path program 22 times [2019-08-05 10:31:25,456 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:25,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:25,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:31:25,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:26,103 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-08-05 10:31:26,315 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-08-05 10:31:26,856 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:31:26,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:26,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-08-05 10:31:26,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-08-05 10:31:26,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-08-05 10:31:26,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2019-08-05 10:31:26,858 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 26 states. [2019-08-05 10:31:27,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:27,403 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:31:27,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-08-05 10:31:27,404 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2019-08-05 10:31:27,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:27,404 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:31:27,404 INFO L226 Difference]: Without dead ends: 27 [2019-08-05 10:31:27,405 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=53, Invalid=649, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:31:27,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-08-05 10:31:27,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-08-05 10:31:27,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-08-05 10:31:27,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-08-05 10:31:27,409 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-08-05 10:31:27,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:27,409 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-08-05 10:31:27,409 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-08-05 10:31:27,409 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-08-05 10:31:27,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-08-05 10:31:27,410 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:27,410 INFO L399 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-08-05 10:31:27,410 INFO L418 AbstractCegarLoop]: === Iteration 24 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:27,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:27,411 INFO L82 PathProgramCache]: Analyzing trace with hash 561154238, now seen corresponding path program 23 times [2019-08-05 10:31:27,412 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:27,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:27,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 73 conjunts are in the unsatisfiable core [2019-08-05 10:31:27,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:27,885 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:31:27,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:27,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-08-05 10:31:27,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:31:27,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:31:27,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:31:27,888 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 27 states. [2019-08-05 10:31:28,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:28,528 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 10:31:28,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:31:28,529 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2019-08-05 10:31:28,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:28,530 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:31:28,530 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:31:28,531 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=701, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:31:28,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:31:28,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:31:28,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:31:28,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 10:31:28,534 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-08-05 10:31:28,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:28,535 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 10:31:28,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:31:28,535 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 10:31:28,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:31:28,536 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:28,536 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-05 10:31:28,536 INFO L418 AbstractCegarLoop]: === Iteration 25 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:28,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:28,536 INFO L82 PathProgramCache]: Analyzing trace with hash 215910219, now seen corresponding path program 24 times [2019-08-05 10:31:28,537 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:28,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:28,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 76 conjunts are in the unsatisfiable core [2019-08-05 10:31:28,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:29,098 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:31:29,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:29,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:31:29,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:31:29,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:31:29,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:31:29,100 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 28 states. [2019-08-05 10:31:29,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:29,631 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-08-05 10:31:29,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:31:29,632 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2019-08-05 10:31:29,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:29,632 INFO L225 Difference]: With dead ends: 30 [2019-08-05 10:31:29,633 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:31:29,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=755, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:31:29,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:31:29,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:31:29,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:31:29,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:31:29,637 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-08-05 10:31:29,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:29,637 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:31:29,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:31:29,637 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:31:29,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:31:29,638 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:29,638 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-05 10:31:29,638 INFO L418 AbstractCegarLoop]: === Iteration 26 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:29,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:29,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1896719778, now seen corresponding path program 25 times [2019-08-05 10:31:29,640 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:29,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:29,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 79 conjunts are in the unsatisfiable core [2019-08-05 10:31:29,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:30,427 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:31:30,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:30,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:31:30,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-08-05 10:31:30,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-08-05 10:31:30,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2019-08-05 10:31:30,428 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 29 states. [2019-08-05 10:31:31,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:31,001 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-08-05 10:31:31,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-08-05 10:31:31,002 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 28 [2019-08-05 10:31:31,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:31,003 INFO L225 Difference]: With dead ends: 31 [2019-08-05 10:31:31,003 INFO L226 Difference]: Without dead ends: 30 [2019-08-05 10:31:31,004 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=59, Invalid=811, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:31:31,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-08-05 10:31:31,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-08-05 10:31:31,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:31:31,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-08-05 10:31:31,008 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-08-05 10:31:31,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:31,008 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-08-05 10:31:31,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-08-05 10:31:31,008 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-08-05 10:31:31,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-08-05 10:31:31,009 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:31,009 INFO L399 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-08-05 10:31:31,009 INFO L418 AbstractCegarLoop]: === Iteration 27 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:31,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:31,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1331227051, now seen corresponding path program 26 times [2019-08-05 10:31:31,010 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:31,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:31,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 82 conjunts are in the unsatisfiable core [2019-08-05 10:31:31,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:31,986 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:31:31,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:31,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-08-05 10:31:31,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-08-05 10:31:31,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-08-05 10:31:31,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2019-08-05 10:31:31,988 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 30 states. [2019-08-05 10:31:32,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:32,604 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-08-05 10:31:32,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-08-05 10:31:32,605 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2019-08-05 10:31:32,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:32,605 INFO L225 Difference]: With dead ends: 32 [2019-08-05 10:31:32,605 INFO L226 Difference]: Without dead ends: 31 [2019-08-05 10:31:32,606 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=61, Invalid=869, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:31:32,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-08-05 10:31:32,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-08-05 10:31:32,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-08-05 10:31:32,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-08-05 10:31:32,609 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-08-05 10:31:32,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:32,609 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-08-05 10:31:32,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-08-05 10:31:32,609 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-08-05 10:31:32,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-08-05 10:31:32,610 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:32,610 INFO L399 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-08-05 10:31:32,610 INFO L418 AbstractCegarLoop]: === Iteration 28 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:32,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:32,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1681636354, now seen corresponding path program 27 times [2019-08-05 10:31:32,611 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:32,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:32,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 85 conjunts are in the unsatisfiable core [2019-08-05 10:31:32,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:33,249 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:31:33,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:33,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-08-05 10:31:33,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-08-05 10:31:33,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-08-05 10:31:33,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2019-08-05 10:31:33,250 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 31 states. [2019-08-05 10:31:33,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:33,895 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-08-05 10:31:33,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-08-05 10:31:33,895 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 30 [2019-08-05 10:31:33,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:33,896 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:31:33,896 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:31:33,897 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=63, Invalid=929, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:31:33,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:31:33,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 10:31:33,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:31:33,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-08-05 10:31:33,901 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-08-05 10:31:33,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:33,901 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-08-05 10:31:33,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-08-05 10:31:33,901 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-08-05 10:31:33,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-08-05 10:31:33,902 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:33,902 INFO L399 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-08-05 10:31:33,902 INFO L418 AbstractCegarLoop]: === Iteration 29 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:33,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:33,902 INFO L82 PathProgramCache]: Analyzing trace with hash -591121397, now seen corresponding path program 28 times [2019-08-05 10:31:33,903 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:33,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:33,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 88 conjunts are in the unsatisfiable core [2019-08-05 10:31:33,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:34,601 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:31:34,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:34,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-08-05 10:31:34,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-08-05 10:31:34,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-08-05 10:31:34,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2019-08-05 10:31:34,602 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 32 states. [2019-08-05 10:31:35,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:35,306 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-08-05 10:31:35,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-08-05 10:31:35,312 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 31 [2019-08-05 10:31:35,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:35,313 INFO L225 Difference]: With dead ends: 34 [2019-08-05 10:31:35,313 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:31:35,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=65, Invalid=991, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:31:35,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:31:35,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-08-05 10:31:35,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-08-05 10:31:35,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-08-05 10:31:35,320 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-08-05 10:31:35,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:35,320 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-08-05 10:31:35,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-08-05 10:31:35,321 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-08-05 10:31:35,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 10:31:35,324 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:35,324 INFO L399 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-08-05 10:31:35,324 INFO L418 AbstractCegarLoop]: === Iteration 30 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:35,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:35,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1144896098, now seen corresponding path program 29 times [2019-08-05 10:31:35,325 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:35,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:35,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 91 conjunts are in the unsatisfiable core [2019-08-05 10:31:35,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:36,055 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:31:36,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:36,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-08-05 10:31:36,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-08-05 10:31:36,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-08-05 10:31:36,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2019-08-05 10:31:36,057 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 33 states. [2019-08-05 10:31:36,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:36,981 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-08-05 10:31:36,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-08-05 10:31:36,982 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 32 [2019-08-05 10:31:36,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:36,983 INFO L225 Difference]: With dead ends: 35 [2019-08-05 10:31:36,983 INFO L226 Difference]: Without dead ends: 34 [2019-08-05 10:31:36,984 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=67, Invalid=1055, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:31:36,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-08-05 10:31:36,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-08-05 10:31:36,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-08-05 10:31:36,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-08-05 10:31:36,987 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-08-05 10:31:36,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:36,987 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-08-05 10:31:36,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-08-05 10:31:36,987 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-08-05 10:31:36,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-08-05 10:31:36,988 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:36,988 INFO L399 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-08-05 10:31:36,988 INFO L418 AbstractCegarLoop]: === Iteration 31 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:36,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:36,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1132042645, now seen corresponding path program 30 times [2019-08-05 10:31:36,989 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:37,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:37,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 94 conjunts are in the unsatisfiable core [2019-08-05 10:31:37,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:37,928 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:31:37,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:37,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-08-05 10:31:37,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-08-05 10:31:37,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-08-05 10:31:37,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2019-08-05 10:31:37,930 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 34 states. [2019-08-05 10:31:38,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:38,720 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:31:38,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-08-05 10:31:38,720 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 33 [2019-08-05 10:31:38,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:38,721 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:31:38,721 INFO L226 Difference]: Without dead ends: 35 [2019-08-05 10:31:38,723 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=1121, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:31:38,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-08-05 10:31:38,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-08-05 10:31:38,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-08-05 10:31:38,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-08-05 10:31:38,724 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-08-05 10:31:38,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:38,724 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-08-05 10:31:38,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-08-05 10:31:38,724 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-08-05 10:31:38,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-08-05 10:31:38,725 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:38,725 INFO L399 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-08-05 10:31:38,725 INFO L418 AbstractCegarLoop]: === Iteration 32 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:38,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:38,725 INFO L82 PathProgramCache]: Analyzing trace with hash -733585602, now seen corresponding path program 31 times [2019-08-05 10:31:38,726 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:38,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:38,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 97 conjunts are in the unsatisfiable core [2019-08-05 10:31:38,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:39,716 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:31:39,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:39,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-08-05 10:31:39,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:31:39,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:31:39,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:31:39,717 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 35 states. [2019-08-05 10:31:40,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:40,542 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 10:31:40,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:31:40,543 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 34 [2019-08-05 10:31:40,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:40,543 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:31:40,544 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:31:40,545 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=71, Invalid=1189, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:31:40,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:31:40,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:31:40,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:31:40,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 10:31:40,547 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-08-05 10:31:40,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:40,547 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 10:31:40,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:31:40,548 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 10:31:40,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:31:40,548 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:40,548 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-05 10:31:40,548 INFO L418 AbstractCegarLoop]: === Iteration 33 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:40,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:40,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1266319157, now seen corresponding path program 32 times [2019-08-05 10:31:40,549 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:40,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:40,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 100 conjunts are in the unsatisfiable core [2019-08-05 10:31:40,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:41,849 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:31:41,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:41,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:31:41,850 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:31:41,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:31:41,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:31:41,851 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 36 states. [2019-08-05 10:31:42,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:42,735 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-08-05 10:31:42,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:31:42,736 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 35 [2019-08-05 10:31:42,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:42,736 INFO L225 Difference]: With dead ends: 38 [2019-08-05 10:31:42,737 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:31:42,738 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=73, Invalid=1259, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:31:42,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:31:42,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:31:42,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:31:42,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:31:42,740 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-08-05 10:31:42,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:42,740 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:31:42,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:31:42,741 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:31:42,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:31:42,741 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:42,741 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-05 10:31:42,741 INFO L418 AbstractCegarLoop]: === Iteration 34 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:42,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:42,742 INFO L82 PathProgramCache]: Analyzing trace with hash -601190178, now seen corresponding path program 33 times [2019-08-05 10:31:42,742 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:42,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:42,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 103 conjunts are in the unsatisfiable core [2019-08-05 10:31:42,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:43,670 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:31:43,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:43,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:31:43,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-08-05 10:31:43,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-08-05 10:31:43,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:31:43,672 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 37 states. [2019-08-05 10:31:44,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:44,594 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-08-05 10:31:44,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-08-05 10:31:44,594 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 36 [2019-08-05 10:31:44,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:44,595 INFO L225 Difference]: With dead ends: 39 [2019-08-05 10:31:44,595 INFO L226 Difference]: Without dead ends: 38 [2019-08-05 10:31:44,596 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=75, Invalid=1331, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:31:44,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-08-05 10:31:44,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-08-05 10:31:44,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-08-05 10:31:44,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-08-05 10:31:44,598 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-08-05 10:31:44,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:44,598 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-08-05 10:31:44,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-08-05 10:31:44,599 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-08-05 10:31:44,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-08-05 10:31:44,599 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:44,599 INFO L399 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-08-05 10:31:44,599 INFO L418 AbstractCegarLoop]: === Iteration 35 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:44,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:44,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1457028309, now seen corresponding path program 34 times [2019-08-05 10:31:44,600 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:44,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:44,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 106 conjunts are in the unsatisfiable core [2019-08-05 10:31:44,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:45,573 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:31:45,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:45,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-08-05 10:31:45,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-08-05 10:31:45,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-08-05 10:31:45,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2019-08-05 10:31:45,575 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 38 states. [2019-08-05 10:31:46,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:46,640 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-08-05 10:31:46,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-08-05 10:31:46,641 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 37 [2019-08-05 10:31:46,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:46,641 INFO L225 Difference]: With dead ends: 40 [2019-08-05 10:31:46,641 INFO L226 Difference]: Without dead ends: 39 [2019-08-05 10:31:46,642 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=77, Invalid=1405, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:31:46,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-08-05 10:31:46,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-08-05 10:31:46,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-08-05 10:31:46,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-08-05 10:31:46,643 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-08-05 10:31:46,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:46,644 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-08-05 10:31:46,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-08-05 10:31:46,644 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-08-05 10:31:46,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-08-05 10:31:46,644 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:46,645 INFO L399 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-08-05 10:31:46,645 INFO L418 AbstractCegarLoop]: === Iteration 36 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:46,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:46,645 INFO L82 PathProgramCache]: Analyzing trace with hash 2076760702, now seen corresponding path program 35 times [2019-08-05 10:31:46,646 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:46,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:46,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 109 conjunts are in the unsatisfiable core [2019-08-05 10:31:46,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:47,771 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:31:47,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:47,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-08-05 10:31:47,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-08-05 10:31:47,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-08-05 10:31:47,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2019-08-05 10:31:47,773 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 39 states. [2019-08-05 10:31:48,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:48,817 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-08-05 10:31:48,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-08-05 10:31:48,817 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 38 [2019-08-05 10:31:48,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:48,818 INFO L225 Difference]: With dead ends: 41 [2019-08-05 10:31:48,818 INFO L226 Difference]: Without dead ends: 40 [2019-08-05 10:31:48,819 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=79, Invalid=1481, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:31:48,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-08-05 10:31:48,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-08-05 10:31:48,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-08-05 10:31:48,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-08-05 10:31:48,822 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-08-05 10:31:48,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:48,822 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-08-05 10:31:48,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-08-05 10:31:48,822 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-08-05 10:31:48,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-08-05 10:31:48,823 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:48,823 INFO L399 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-08-05 10:31:48,823 INFO L418 AbstractCegarLoop]: === Iteration 37 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:48,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:48,823 INFO L82 PathProgramCache]: Analyzing trace with hash -44929653, now seen corresponding path program 36 times [2019-08-05 10:31:48,824 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:48,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:48,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 112 conjunts are in the unsatisfiable core [2019-08-05 10:31:48,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:49,785 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:31:49,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:49,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-08-05 10:31:49,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-08-05 10:31:49,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-08-05 10:31:49,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2019-08-05 10:31:49,787 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 40 states. [2019-08-05 10:31:50,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:50,886 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-08-05 10:31:50,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-08-05 10:31:50,887 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 39 [2019-08-05 10:31:50,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:50,888 INFO L225 Difference]: With dead ends: 42 [2019-08-05 10:31:50,888 INFO L226 Difference]: Without dead ends: 41 [2019-08-05 10:31:50,889 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=1559, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:31:50,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-08-05 10:31:50,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-08-05 10:31:50,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-08-05 10:31:50,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-08-05 10:31:50,891 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-08-05 10:31:50,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:50,892 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-08-05 10:31:50,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-08-05 10:31:50,892 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-08-05 10:31:50,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-08-05 10:31:50,892 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:50,893 INFO L399 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-08-05 10:31:50,893 INFO L418 AbstractCegarLoop]: === Iteration 38 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:50,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:50,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1392821218, now seen corresponding path program 37 times [2019-08-05 10:31:50,894 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:50,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:50,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 115 conjunts are in the unsatisfiable core [2019-08-05 10:31:50,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:52,157 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:31:52,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:52,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-08-05 10:31:52,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-08-05 10:31:52,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-08-05 10:31:52,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2019-08-05 10:31:52,159 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 41 states. [2019-08-05 10:31:53,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:53,311 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-08-05 10:31:53,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-08-05 10:31:53,311 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 40 [2019-08-05 10:31:53,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:53,312 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:31:53,312 INFO L226 Difference]: Without dead ends: 42 [2019-08-05 10:31:53,313 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=83, Invalid=1639, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:31:53,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-08-05 10:31:53,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-08-05 10:31:53,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:31:53,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-08-05 10:31:53,315 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-08-05 10:31:53,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:53,316 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-08-05 10:31:53,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-08-05 10:31:53,316 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-08-05 10:31:53,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-08-05 10:31:53,316 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:53,317 INFO L399 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-08-05 10:31:53,317 INFO L418 AbstractCegarLoop]: === Iteration 39 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:53,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:53,317 INFO L82 PathProgramCache]: Analyzing trace with hash -227786773, now seen corresponding path program 38 times [2019-08-05 10:31:53,318 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:53,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:53,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 118 conjunts are in the unsatisfiable core [2019-08-05 10:31:53,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:54,728 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:31:54,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:54,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-08-05 10:31:54,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-08-05 10:31:54,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-08-05 10:31:54,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2019-08-05 10:31:54,729 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 42 states. [2019-08-05 10:31:55,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:55,928 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:31:55,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-08-05 10:31:55,928 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 41 [2019-08-05 10:31:55,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:55,929 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:31:55,929 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:31:55,930 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=85, Invalid=1721, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:31:55,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:31:55,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-08-05 10:31:55,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-08-05 10:31:55,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-08-05 10:31:55,932 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-08-05 10:31:55,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:55,933 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-08-05 10:31:55,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-08-05 10:31:55,933 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-08-05 10:31:55,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-08-05 10:31:55,934 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:55,934 INFO L399 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-08-05 10:31:55,934 INFO L418 AbstractCegarLoop]: === Iteration 40 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:55,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:55,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1528542654, now seen corresponding path program 39 times [2019-08-05 10:31:55,935 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:56,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:56,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 121 conjunts are in the unsatisfiable core [2019-08-05 10:31:56,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:57,383 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:31:57,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:57,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-08-05 10:31:57,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:31:57,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:31:57,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:31:57,385 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 43 states. [2019-08-05 10:31:58,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:31:58,663 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 10:31:58,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:31:58,663 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 42 [2019-08-05 10:31:58,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:31:58,664 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:31:58,664 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:31:58,665 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=87, Invalid=1805, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:31:58,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:31:58,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:31:58,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:31:58,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 10:31:58,668 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-08-05 10:31:58,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:31:58,668 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 10:31:58,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:31:58,668 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 10:31:58,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:31:58,669 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:31:58,669 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-05 10:31:58,669 INFO L418 AbstractCegarLoop]: === Iteration 41 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:31:58,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:31:58,669 INFO L82 PathProgramCache]: Analyzing trace with hash 140180043, now seen corresponding path program 40 times [2019-08-05 10:31:58,670 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:31:58,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:31:58,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 124 conjunts are in the unsatisfiable core [2019-08-05 10:31:58,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:31:59,797 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:31:59,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:31:59,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:31:59,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:31:59,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:31:59,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:31:59,799 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 44 states. [2019-08-05 10:32:01,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:01,155 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-08-05 10:32:01,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:32:01,156 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 43 [2019-08-05 10:32:01,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:01,156 INFO L225 Difference]: With dead ends: 46 [2019-08-05 10:32:01,157 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:32:01,158 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=89, Invalid=1891, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:32:01,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:32:01,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:32:01,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:32:01,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:32:01,159 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-08-05 10:32:01,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:01,160 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:32:01,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:32:01,160 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:32:01,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:32:01,160 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:01,160 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-05 10:32:01,160 INFO L418 AbstractCegarLoop]: === Iteration 42 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:32:01,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:01,161 INFO L82 PathProgramCache]: Analyzing trace with hash 50612062, now seen corresponding path program 41 times [2019-08-05 10:32:01,161 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:01,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:01,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 127 conjunts are in the unsatisfiable core [2019-08-05 10:32:01,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:02,669 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:32:02,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:02,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:32:02,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-08-05 10:32:02,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-08-05 10:32:02,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2019-08-05 10:32:02,671 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 45 states. [2019-08-05 10:32:04,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:04,060 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-08-05 10:32:04,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:32:04,061 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 44 [2019-08-05 10:32:04,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:04,062 INFO L225 Difference]: With dead ends: 47 [2019-08-05 10:32:04,062 INFO L226 Difference]: Without dead ends: 46 [2019-08-05 10:32:04,063 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=91, Invalid=1979, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:32:04,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-08-05 10:32:04,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-08-05 10:32:04,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-08-05 10:32:04,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-08-05 10:32:04,065 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-08-05 10:32:04,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:04,065 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-08-05 10:32:04,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-08-05 10:32:04,066 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-08-05 10:32:04,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-08-05 10:32:04,066 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:04,066 INFO L399 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-08-05 10:32:04,067 INFO L418 AbstractCegarLoop]: === Iteration 43 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:32:04,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:04,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1568971947, now seen corresponding path program 42 times [2019-08-05 10:32:04,068 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:04,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:04,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 130 conjunts are in the unsatisfiable core [2019-08-05 10:32:04,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:05,290 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:32:05,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:05,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-08-05 10:32:05,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-08-05 10:32:05,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-08-05 10:32:05,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2019-08-05 10:32:05,292 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 46 states. [2019-08-05 10:32:06,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:06,739 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-08-05 10:32:06,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-08-05 10:32:06,739 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 45 [2019-08-05 10:32:06,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:06,740 INFO L225 Difference]: With dead ends: 48 [2019-08-05 10:32:06,740 INFO L226 Difference]: Without dead ends: 47 [2019-08-05 10:32:06,741 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=93, Invalid=2069, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:32:06,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-08-05 10:32:06,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-08-05 10:32:06,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-08-05 10:32:06,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-08-05 10:32:06,743 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-08-05 10:32:06,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:06,744 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-08-05 10:32:06,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-08-05 10:32:06,744 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-08-05 10:32:06,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-08-05 10:32:06,744 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:06,744 INFO L399 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-08-05 10:32:06,745 INFO L418 AbstractCegarLoop]: === Iteration 44 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:32:06,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:06,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1393488126, now seen corresponding path program 43 times [2019-08-05 10:32:06,745 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:06,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:06,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 133 conjunts are in the unsatisfiable core [2019-08-05 10:32:06,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:08,323 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:32:08,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:08,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-08-05 10:32:08,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-08-05 10:32:08,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-08-05 10:32:08,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2019-08-05 10:32:08,324 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 47 states. [2019-08-05 10:32:09,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:09,826 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-08-05 10:32:09,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-08-05 10:32:09,827 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 46 [2019-08-05 10:32:09,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:09,828 INFO L225 Difference]: With dead ends: 49 [2019-08-05 10:32:09,828 INFO L226 Difference]: Without dead ends: 48 [2019-08-05 10:32:09,828 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=95, Invalid=2161, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:32:09,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-08-05 10:32:09,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-08-05 10:32:09,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:32:09,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-08-05 10:32:09,831 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-08-05 10:32:09,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:09,831 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-08-05 10:32:09,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-08-05 10:32:09,832 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-08-05 10:32:09,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-08-05 10:32:09,832 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:09,832 INFO L399 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-08-05 10:32:09,833 INFO L418 AbstractCegarLoop]: === Iteration 45 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:32:09,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:09,833 INFO L82 PathProgramCache]: Analyzing trace with hash 248456971, now seen corresponding path program 44 times [2019-08-05 10:32:09,833 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:09,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:09,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 136 conjunts are in the unsatisfiable core [2019-08-05 10:32:09,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:11,233 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:32:11,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:11,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-08-05 10:32:11,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-08-05 10:32:11,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-08-05 10:32:11,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2019-08-05 10:32:11,234 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 48 states. [2019-08-05 10:32:12,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:12,995 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-08-05 10:32:12,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-08-05 10:32:12,995 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 47 [2019-08-05 10:32:12,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:12,996 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:32:12,996 INFO L226 Difference]: Without dead ends: 49 [2019-08-05 10:32:12,997 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=97, Invalid=2255, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:32:12,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-08-05 10:32:12,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-08-05 10:32:12,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:32:12,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-08-05 10:32:13,000 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-08-05 10:32:13,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:13,000 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-08-05 10:32:13,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-08-05 10:32:13,000 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-08-05 10:32:13,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-08-05 10:32:13,001 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:13,001 INFO L399 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-08-05 10:32:13,001 INFO L418 AbstractCegarLoop]: === Iteration 46 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:32:13,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:13,002 INFO L82 PathProgramCache]: Analyzing trace with hash -887770466, now seen corresponding path program 45 times [2019-08-05 10:32:13,002 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:13,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:13,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 139 conjunts are in the unsatisfiable core [2019-08-05 10:32:13,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:14,437 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:32:14,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:14,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-08-05 10:32:14,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-08-05 10:32:14,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-08-05 10:32:14,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2019-08-05 10:32:14,439 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 49 states. [2019-08-05 10:32:16,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:16,084 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-08-05 10:32:16,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-08-05 10:32:16,084 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 48 [2019-08-05 10:32:16,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:16,085 INFO L225 Difference]: With dead ends: 51 [2019-08-05 10:32:16,085 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:32:16,086 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=99, Invalid=2351, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:32:16,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:32:16,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-08-05 10:32:16,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-08-05 10:32:16,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-08-05 10:32:16,088 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-08-05 10:32:16,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:16,088 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-08-05 10:32:16,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-08-05 10:32:16,088 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-08-05 10:32:16,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-08-05 10:32:16,089 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:16,089 INFO L399 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-08-05 10:32:16,089 INFO L418 AbstractCegarLoop]: === Iteration 47 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:32:16,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:16,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1751082645, now seen corresponding path program 46 times [2019-08-05 10:32:16,090 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:16,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:16,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 142 conjunts are in the unsatisfiable core [2019-08-05 10:32:16,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:18,069 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:32:18,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:18,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-08-05 10:32:18,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-08-05 10:32:18,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-08-05 10:32:18,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2019-08-05 10:32:18,070 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 50 states. [2019-08-05 10:32:19,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:19,779 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:32:19,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-08-05 10:32:19,779 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 49 [2019-08-05 10:32:19,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:19,780 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:32:19,780 INFO L226 Difference]: Without dead ends: 51 [2019-08-05 10:32:19,781 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=101, Invalid=2449, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:32:19,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-08-05 10:32:19,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-08-05 10:32:19,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-08-05 10:32:19,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-08-05 10:32:19,783 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-08-05 10:32:19,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:19,783 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-08-05 10:32:19,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-08-05 10:32:19,783 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-08-05 10:32:19,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-08-05 10:32:19,784 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:19,784 INFO L399 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-08-05 10:32:19,784 INFO L418 AbstractCegarLoop]: === Iteration 48 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:32:19,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:19,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1551010878, now seen corresponding path program 47 times [2019-08-05 10:32:19,785 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:19,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:19,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 145 conjunts are in the unsatisfiable core [2019-08-05 10:32:19,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:21,269 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:32:21,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:21,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-08-05 10:32:21,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:32:21,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:32:21,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:32:21,270 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 51 states. [2019-08-05 10:32:23,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:23,189 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 10:32:23,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:32:23,190 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 50 [2019-08-05 10:32:23,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:23,191 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:32:23,191 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:32:23,191 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=103, Invalid=2549, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:32:23,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:32:23,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:32:23,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:32:23,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 10:32:23,194 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-08-05 10:32:23,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:23,194 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 10:32:23,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:32:23,195 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 10:32:23,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:32:23,195 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:23,195 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-05 10:32:23,196 INFO L418 AbstractCegarLoop]: === Iteration 49 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:32:23,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:23,196 INFO L82 PathProgramCache]: Analyzing trace with hash 836694987, now seen corresponding path program 48 times [2019-08-05 10:32:23,197 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:23,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:23,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 148 conjunts are in the unsatisfiable core [2019-08-05 10:32:23,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:24,764 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:32:24,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:24,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:32:24,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:32:24,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:32:24,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:32:24,765 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 52 states. [2019-08-05 10:32:26,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:26,619 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-08-05 10:32:26,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:32:26,620 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 51 [2019-08-05 10:32:26,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:26,620 INFO L225 Difference]: With dead ends: 54 [2019-08-05 10:32:26,621 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:32:26,621 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=105, Invalid=2651, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:32:26,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:32:26,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:32:26,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:32:26,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:32:26,623 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-08-05 10:32:26,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:26,624 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:32:26,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:32:26,624 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:32:26,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:32:26,624 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:26,624 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-05 10:32:26,624 INFO L418 AbstractCegarLoop]: === Iteration 50 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:32:26,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:26,625 INFO L82 PathProgramCache]: Analyzing trace with hash 167738846, now seen corresponding path program 49 times [2019-08-05 10:32:26,627 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:26,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:26,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 151 conjunts are in the unsatisfiable core [2019-08-05 10:32:26,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:28,711 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:32:28,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:28,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:32:28,712 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-08-05 10:32:28,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-08-05 10:32:28,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2019-08-05 10:32:28,713 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 53 states. [2019-08-05 10:32:30,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:30,665 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-08-05 10:32:30,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-08-05 10:32:30,665 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 52 [2019-08-05 10:32:30,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:30,666 INFO L225 Difference]: With dead ends: 55 [2019-08-05 10:32:30,666 INFO L226 Difference]: Without dead ends: 54 [2019-08-05 10:32:30,667 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=107, Invalid=2755, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:32:30,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-08-05 10:32:30,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-08-05 10:32:30,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-08-05 10:32:30,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-08-05 10:32:30,669 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-08-05 10:32:30,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:30,670 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-08-05 10:32:30,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-08-05 10:32:30,670 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-08-05 10:32:30,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-08-05 10:32:30,670 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:30,671 INFO L399 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-08-05 10:32:30,671 INFO L418 AbstractCegarLoop]: === Iteration 51 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:32:30,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:30,671 INFO L82 PathProgramCache]: Analyzing trace with hash 904934955, now seen corresponding path program 50 times [2019-08-05 10:32:30,672 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:30,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:30,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 154 conjunts are in the unsatisfiable core [2019-08-05 10:32:30,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:32,450 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:32:32,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:32,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-08-05 10:32:32,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-08-05 10:32:32,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-08-05 10:32:32,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2019-08-05 10:32:32,452 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 54 states. [2019-08-05 10:32:34,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:34,657 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-08-05 10:32:34,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-08-05 10:32:34,658 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 53 [2019-08-05 10:32:34,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:34,659 INFO L225 Difference]: With dead ends: 56 [2019-08-05 10:32:34,659 INFO L226 Difference]: Without dead ends: 55 [2019-08-05 10:32:34,660 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=109, Invalid=2861, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:32:34,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-08-05 10:32:34,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-08-05 10:32:34,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-08-05 10:32:34,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-08-05 10:32:34,662 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-08-05 10:32:34,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:34,662 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-08-05 10:32:34,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-08-05 10:32:34,663 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-08-05 10:32:34,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-08-05 10:32:34,663 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:34,663 INFO L399 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-08-05 10:32:34,663 INFO L418 AbstractCegarLoop]: === Iteration 52 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:32:34,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:34,664 INFO L82 PathProgramCache]: Analyzing trace with hash -2011789442, now seen corresponding path program 51 times [2019-08-05 10:32:34,664 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:34,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:34,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 157 conjunts are in the unsatisfiable core [2019-08-05 10:32:34,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:36,439 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:32:36,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:36,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-08-05 10:32:36,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-08-05 10:32:36,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-08-05 10:32:36,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2019-08-05 10:32:36,440 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 55 states. [2019-08-05 10:32:38,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:38,711 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-08-05 10:32:38,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-08-05 10:32:38,712 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 54 [2019-08-05 10:32:38,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:38,712 INFO L225 Difference]: With dead ends: 57 [2019-08-05 10:32:38,713 INFO L226 Difference]: Without dead ends: 56 [2019-08-05 10:32:38,713 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=111, Invalid=2969, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:32:38,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-08-05 10:32:38,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-08-05 10:32:38,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-08-05 10:32:38,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-08-05 10:32:38,715 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-08-05 10:32:38,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:38,716 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-08-05 10:32:38,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-08-05 10:32:38,716 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-08-05 10:32:38,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-08-05 10:32:38,717 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:38,717 INFO L399 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-08-05 10:32:38,717 INFO L418 AbstractCegarLoop]: === Iteration 53 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:32:38,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:38,717 INFO L82 PathProgramCache]: Analyzing trace with hash 2059034763, now seen corresponding path program 52 times [2019-08-05 10:32:38,718 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:38,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:38,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 160 conjunts are in the unsatisfiable core [2019-08-05 10:32:38,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:40,528 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:32:40,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:40,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-08-05 10:32:40,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-08-05 10:32:40,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-08-05 10:32:40,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2019-08-05 10:32:40,530 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 56 states. [2019-08-05 10:32:42,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:42,697 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-08-05 10:32:42,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-08-05 10:32:42,698 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 55 [2019-08-05 10:32:42,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:42,698 INFO L225 Difference]: With dead ends: 58 [2019-08-05 10:32:42,699 INFO L226 Difference]: Without dead ends: 57 [2019-08-05 10:32:42,699 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=113, Invalid=3079, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:32:42,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-08-05 10:32:42,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-08-05 10:32:42,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-08-05 10:32:42,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-08-05 10:32:42,702 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-08-05 10:32:42,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:42,702 INFO L475 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-08-05 10:32:42,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-08-05 10:32:42,702 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-08-05 10:32:42,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-08-05 10:32:42,702 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:42,702 INFO L399 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-08-05 10:32:42,703 INFO L418 AbstractCegarLoop]: === Iteration 54 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:32:42,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:42,703 INFO L82 PathProgramCache]: Analyzing trace with hash -594433762, now seen corresponding path program 53 times [2019-08-05 10:32:42,703 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:42,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:42,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 163 conjunts are in the unsatisfiable core [2019-08-05 10:32:42,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:44,880 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:32:44,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:44,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-08-05 10:32:44,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-08-05 10:32:44,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-08-05 10:32:44,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2019-08-05 10:32:44,882 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 57 states. [2019-08-05 10:32:47,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:47,125 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-08-05 10:32:47,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-08-05 10:32:47,125 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 56 [2019-08-05 10:32:47,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:47,126 INFO L225 Difference]: With dead ends: 59 [2019-08-05 10:32:47,126 INFO L226 Difference]: Without dead ends: 58 [2019-08-05 10:32:47,127 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=115, Invalid=3191, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:32:47,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-08-05 10:32:47,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-08-05 10:32:47,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-08-05 10:32:47,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-08-05 10:32:47,129 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-08-05 10:32:47,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:47,130 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-08-05 10:32:47,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-08-05 10:32:47,130 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-08-05 10:32:47,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-08-05 10:32:47,130 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:47,131 INFO L399 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-08-05 10:32:47,131 INFO L418 AbstractCegarLoop]: === Iteration 55 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:32:47,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:47,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1247579413, now seen corresponding path program 54 times [2019-08-05 10:32:47,132 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:47,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:47,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 166 conjunts are in the unsatisfiable core [2019-08-05 10:32:47,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:49,482 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:32:49,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:49,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-08-05 10:32:49,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-08-05 10:32:49,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-08-05 10:32:49,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2019-08-05 10:32:49,483 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 58 states. [2019-08-05 10:32:51,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:51,833 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 10:32:51,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-08-05 10:32:51,834 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 57 [2019-08-05 10:32:51,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:51,835 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:32:51,835 INFO L226 Difference]: Without dead ends: 59 [2019-08-05 10:32:51,835 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=117, Invalid=3305, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:32:51,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-08-05 10:32:51,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-08-05 10:32:51,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-08-05 10:32:51,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-08-05 10:32:51,837 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-08-05 10:32:51,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:51,838 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-08-05 10:32:51,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-08-05 10:32:51,838 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-08-05 10:32:51,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-08-05 10:32:51,838 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:51,838 INFO L399 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-08-05 10:32:51,839 INFO L418 AbstractCegarLoop]: === Iteration 56 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:32:51,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:51,839 INFO L82 PathProgramCache]: Analyzing trace with hash -20258114, now seen corresponding path program 55 times [2019-08-05 10:32:51,840 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:52,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:52,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 169 conjunts are in the unsatisfiable core [2019-08-05 10:32:52,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:54,121 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:32:54,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:54,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-08-05 10:32:54,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:32:54,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:32:54,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:32:54,122 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 59 states. [2019-08-05 10:32:56,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:32:56,526 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 10:32:56,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:32:56,526 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 58 [2019-08-05 10:32:56,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:32:56,527 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:32:56,527 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:32:56,528 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=119, Invalid=3421, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:32:56,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:32:56,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 10:32:56,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:32:56,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 10:32:56,529 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-08-05 10:32:56,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:32:56,529 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 10:32:56,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:32:56,530 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 10:32:56,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:32:56,530 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:32:56,530 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-05 10:32:56,530 INFO L418 AbstractCegarLoop]: === Iteration 57 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:32:56,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:32:56,530 INFO L82 PathProgramCache]: Analyzing trace with hash -628003509, now seen corresponding path program 56 times [2019-08-05 10:32:56,531 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:32:56,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:32:56,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 172 conjunts are in the unsatisfiable core [2019-08-05 10:32:56,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:32:58,891 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:32:58,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:32:58,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:32:58,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:32:58,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:32:58,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:32:58,893 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 60 states. [2019-08-05 10:33:01,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:01,374 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-08-05 10:33:01,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:33:01,374 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 59 [2019-08-05 10:33:01,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:01,375 INFO L225 Difference]: With dead ends: 62 [2019-08-05 10:33:01,375 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:33:01,376 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=121, Invalid=3539, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:33:01,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:33:01,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:33:01,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:33:01,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 10:33:01,378 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-08-05 10:33:01,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:01,379 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 10:33:01,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:33:01,379 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 10:33:01,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:33:01,379 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:01,380 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-05 10:33:01,380 INFO L418 AbstractCegarLoop]: === Iteration 58 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:33:01,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:01,380 INFO L82 PathProgramCache]: Analyzing trace with hash 2006725726, now seen corresponding path program 57 times [2019-08-05 10:33:01,381 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:01,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 175 conjunts are in the unsatisfiable core [2019-08-05 10:33:01,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:01,903 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-05 10:33:05,031 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:33:05,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:05,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:33:05,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-08-05 10:33:05,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-08-05 10:33:05,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2019-08-05 10:33:05,033 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 61 states. [2019-08-05 10:33:07,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:07,616 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-08-05 10:33:07,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-08-05 10:33:07,616 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 60 [2019-08-05 10:33:07,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:07,617 INFO L225 Difference]: With dead ends: 63 [2019-08-05 10:33:07,617 INFO L226 Difference]: Without dead ends: 62 [2019-08-05 10:33:07,618 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=123, Invalid=3659, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:33:07,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-08-05 10:33:07,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-08-05 10:33:07,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-08-05 10:33:07,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-08-05 10:33:07,621 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-08-05 10:33:07,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:07,621 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-08-05 10:33:07,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-08-05 10:33:07,621 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-08-05 10:33:07,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-08-05 10:33:07,622 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:07,622 INFO L399 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-08-05 10:33:07,622 INFO L418 AbstractCegarLoop]: === Iteration 59 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:33:07,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:07,622 INFO L82 PathProgramCache]: Analyzing trace with hash 2078953387, now seen corresponding path program 58 times [2019-08-05 10:33:07,623 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:07,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:07,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 178 conjunts are in the unsatisfiable core [2019-08-05 10:33:07,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:10,271 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:33:10,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:10,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-08-05 10:33:10,271 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-08-05 10:33:10,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-08-05 10:33:10,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2019-08-05 10:33:10,272 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 62 states. [2019-08-05 10:33:12,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:12,915 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-08-05 10:33:12,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-08-05 10:33:12,915 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 61 [2019-08-05 10:33:12,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:12,916 INFO L225 Difference]: With dead ends: 64 [2019-08-05 10:33:12,916 INFO L226 Difference]: Without dead ends: 63 [2019-08-05 10:33:12,916 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=125, Invalid=3781, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:33:12,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-08-05 10:33:12,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-08-05 10:33:12,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-08-05 10:33:12,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-08-05 10:33:12,919 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-08-05 10:33:12,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:12,919 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-08-05 10:33:12,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-08-05 10:33:12,919 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-08-05 10:33:12,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-08-05 10:33:12,919 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:12,919 INFO L399 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-08-05 10:33:12,920 INFO L418 AbstractCegarLoop]: === Iteration 60 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:33:12,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:12,920 INFO L82 PathProgramCache]: Analyzing trace with hash 23043582, now seen corresponding path program 59 times [2019-08-05 10:33:12,920 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:13,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:13,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 181 conjunts are in the unsatisfiable core [2019-08-05 10:33:13,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:15,520 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:33:15,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:15,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-08-05 10:33:15,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-08-05 10:33:15,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-08-05 10:33:15,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2019-08-05 10:33:15,521 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 63 states. [2019-08-05 10:33:18,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:18,257 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-08-05 10:33:18,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-08-05 10:33:18,258 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 62 [2019-08-05 10:33:18,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:18,258 INFO L225 Difference]: With dead ends: 65 [2019-08-05 10:33:18,259 INFO L226 Difference]: Without dead ends: 64 [2019-08-05 10:33:18,259 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=127, Invalid=3905, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:33:18,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-08-05 10:33:18,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-08-05 10:33:18,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-08-05 10:33:18,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-08-05 10:33:18,261 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-08-05 10:33:18,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:18,261 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-08-05 10:33:18,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-08-05 10:33:18,261 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-08-05 10:33:18,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-08-05 10:33:18,262 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:18,262 INFO L399 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-08-05 10:33:18,262 INFO L418 AbstractCegarLoop]: === Iteration 61 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:33:18,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:18,262 INFO L82 PathProgramCache]: Analyzing trace with hash 714349067, now seen corresponding path program 60 times [2019-08-05 10:33:18,263 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:18,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:18,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 184 conjunts are in the unsatisfiable core [2019-08-05 10:33:18,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:20,883 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:33:20,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:20,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-08-05 10:33:20,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-08-05 10:33:20,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-08-05 10:33:20,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2019-08-05 10:33:20,884 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 64 states. [2019-08-05 10:33:23,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:23,714 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-08-05 10:33:23,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-08-05 10:33:23,715 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 63 [2019-08-05 10:33:23,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:23,715 INFO L225 Difference]: With dead ends: 66 [2019-08-05 10:33:23,715 INFO L226 Difference]: Without dead ends: 65 [2019-08-05 10:33:23,716 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=129, Invalid=4031, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:33:23,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-08-05 10:33:23,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-08-05 10:33:23,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-08-05 10:33:23,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-08-05 10:33:23,719 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-08-05 10:33:23,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:23,719 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-08-05 10:33:23,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-08-05 10:33:23,719 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-08-05 10:33:23,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-08-05 10:33:23,720 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:23,720 INFO L399 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-08-05 10:33:23,720 INFO L418 AbstractCegarLoop]: === Iteration 62 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:33:23,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:23,720 INFO L82 PathProgramCache]: Analyzing trace with hash 669982622, now seen corresponding path program 61 times [2019-08-05 10:33:23,721 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:23,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:24,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 187 conjunts are in the unsatisfiable core [2019-08-05 10:33:24,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:26,295 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:33:26,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:26,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-08-05 10:33:26,295 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-08-05 10:33:26,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-08-05 10:33:26,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2019-08-05 10:33:26,296 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 65 states. [2019-08-05 10:33:29,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:29,394 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-08-05 10:33:29,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-08-05 10:33:29,395 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 64 [2019-08-05 10:33:29,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:29,396 INFO L225 Difference]: With dead ends: 67 [2019-08-05 10:33:29,396 INFO L226 Difference]: Without dead ends: 66 [2019-08-05 10:33:29,396 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=131, Invalid=4159, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:33:29,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-08-05 10:33:29,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-08-05 10:33:29,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-08-05 10:33:29,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-08-05 10:33:29,399 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-08-05 10:33:29,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:29,399 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-08-05 10:33:29,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-08-05 10:33:29,399 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-08-05 10:33:29,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-08-05 10:33:29,399 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:29,400 INFO L399 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-08-05 10:33:29,400 INFO L418 AbstractCegarLoop]: === Iteration 63 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:33:29,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:29,400 INFO L82 PathProgramCache]: Analyzing trace with hash -705377173, now seen corresponding path program 62 times [2019-08-05 10:33:29,401 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:29,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:29,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 190 conjunts are in the unsatisfiable core [2019-08-05 10:33:29,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:31,920 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:33:31,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:31,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-08-05 10:33:31,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-08-05 10:33:31,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-08-05 10:33:31,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2019-08-05 10:33:31,922 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 66 states. [2019-08-05 10:33:35,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:35,121 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:33:35,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-08-05 10:33:35,122 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 65 [2019-08-05 10:33:35,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:35,122 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:33:35,123 INFO L226 Difference]: Without dead ends: 67 [2019-08-05 10:33:35,123 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=133, Invalid=4289, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:33:35,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-08-05 10:33:35,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-08-05 10:33:35,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-08-05 10:33:35,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-08-05 10:33:35,126 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-08-05 10:33:35,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:35,126 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-08-05 10:33:35,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-08-05 10:33:35,126 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-08-05 10:33:35,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-08-05 10:33:35,126 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:35,127 INFO L399 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-08-05 10:33:35,127 INFO L418 AbstractCegarLoop]: === Iteration 64 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:33:35,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:35,127 INFO L82 PathProgramCache]: Analyzing trace with hash -391857858, now seen corresponding path program 63 times [2019-08-05 10:33:35,128 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:35,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:35,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 193 conjunts are in the unsatisfiable core [2019-08-05 10:33:35,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:37,771 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:33:37,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:37,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-08-05 10:33:37,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:33:37,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:33:37,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:33:37,773 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 67 states. [2019-08-05 10:33:40,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:40,914 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 10:33:40,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:33:40,915 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 66 [2019-08-05 10:33:40,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:40,916 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:33:40,916 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:33:40,916 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=135, Invalid=4421, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:33:40,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:33:40,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 10:33:40,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:33:40,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 10:33:40,919 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-08-05 10:33:40,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:40,920 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 10:33:40,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:33:40,920 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 10:33:40,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:33:40,920 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:40,920 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-05 10:33:40,921 INFO L418 AbstractCegarLoop]: === Iteration 65 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:33:40,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:40,921 INFO L82 PathProgramCache]: Analyzing trace with hash 737306315, now seen corresponding path program 64 times [2019-08-05 10:33:40,922 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:41,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:41,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 196 conjunts are in the unsatisfiable core [2019-08-05 10:33:41,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:43,619 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:33:43,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:43,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:33:43,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:33:43,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:33:43,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:33:43,620 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 68 states. [2019-08-05 10:33:46,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:46,941 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-08-05 10:33:46,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:33:46,941 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 67 [2019-08-05 10:33:46,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:46,942 INFO L225 Difference]: With dead ends: 70 [2019-08-05 10:33:46,942 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:33:46,943 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=137, Invalid=4555, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:33:46,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:33:46,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 10:33:46,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:33:46,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 10:33:46,945 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-08-05 10:33:46,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:46,945 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 10:33:46,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:33:46,946 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 10:33:46,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:33:46,946 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:46,946 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-05 10:33:46,946 INFO L418 AbstractCegarLoop]: === Iteration 66 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:33:46,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:46,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1381657310, now seen corresponding path program 65 times [2019-08-05 10:33:46,947 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:47,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:47,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 199 conjunts are in the unsatisfiable core [2019-08-05 10:33:47,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:49,983 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:33:49,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:49,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:33:49,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-08-05 10:33:49,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-08-05 10:33:49,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:33:49,984 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 69 states. [2019-08-05 10:33:53,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:33:53,265 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-08-05 10:33:53,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-08-05 10:33:53,266 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 68 [2019-08-05 10:33:53,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:33:53,266 INFO L225 Difference]: With dead ends: 71 [2019-08-05 10:33:53,267 INFO L226 Difference]: Without dead ends: 70 [2019-08-05 10:33:53,267 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=139, Invalid=4691, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:33:53,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-08-05 10:33:53,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-08-05 10:33:53,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-08-05 10:33:53,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-08-05 10:33:53,269 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-08-05 10:33:53,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:33:53,269 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-08-05 10:33:53,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-08-05 10:33:53,269 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-08-05 10:33:53,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-08-05 10:33:53,270 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:33:53,270 INFO L399 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-08-05 10:33:53,270 INFO L418 AbstractCegarLoop]: === Iteration 67 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:33:53,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:33:53,270 INFO L82 PathProgramCache]: Analyzing trace with hash -118298325, now seen corresponding path program 66 times [2019-08-05 10:33:53,271 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:33:53,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:33:53,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 202 conjunts are in the unsatisfiable core [2019-08-05 10:33:53,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:33:59,034 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:33:59,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:33:59,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-08-05 10:33:59,034 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-08-05 10:33:59,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-08-05 10:33:59,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2019-08-05 10:33:59,035 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 70 states. [2019-08-05 10:34:02,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:02,551 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-08-05 10:34:02,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-08-05 10:34:02,552 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 69 [2019-08-05 10:34:02,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:02,553 INFO L225 Difference]: With dead ends: 72 [2019-08-05 10:34:02,553 INFO L226 Difference]: Without dead ends: 71 [2019-08-05 10:34:02,553 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=141, Invalid=4829, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:34:02,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-08-05 10:34:02,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-08-05 10:34:02,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-08-05 10:34:02,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-08-05 10:34:02,555 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-08-05 10:34:02,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:02,555 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-08-05 10:34:02,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-08-05 10:34:02,555 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-08-05 10:34:02,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-08-05 10:34:02,555 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:02,556 INFO L399 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-08-05 10:34:02,556 INFO L418 AbstractCegarLoop]: === Iteration 68 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:34:02,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:02,556 INFO L82 PathProgramCache]: Analyzing trace with hash 627717246, now seen corresponding path program 67 times [2019-08-05 10:34:02,556 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:02,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:02,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 205 conjunts are in the unsatisfiable core [2019-08-05 10:34:02,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:05,782 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:34:05,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:05,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-08-05 10:34:05,783 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-08-05 10:34:05,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-08-05 10:34:05,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2019-08-05 10:34:05,784 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 71 states. [2019-08-05 10:34:09,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:09,309 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-08-05 10:34:09,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-08-05 10:34:09,309 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 70 [2019-08-05 10:34:09,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:09,310 INFO L225 Difference]: With dead ends: 73 [2019-08-05 10:34:09,310 INFO L226 Difference]: Without dead ends: 72 [2019-08-05 10:34:09,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=143, Invalid=4969, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:34:09,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-08-05 10:34:09,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-08-05 10:34:09,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-08-05 10:34:09,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-08-05 10:34:09,313 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-08-05 10:34:09,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:09,313 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-08-05 10:34:09,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-08-05 10:34:09,314 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-08-05 10:34:09,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-08-05 10:34:09,314 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:09,314 INFO L399 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-08-05 10:34:09,314 INFO L418 AbstractCegarLoop]: === Iteration 69 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:34:09,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:09,314 INFO L82 PathProgramCache]: Analyzing trace with hash -2015603829, now seen corresponding path program 68 times [2019-08-05 10:34:09,315 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:09,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:09,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 208 conjunts are in the unsatisfiable core [2019-08-05 10:34:09,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:12,594 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:34:12,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:12,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-08-05 10:34:12,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-08-05 10:34:12,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-08-05 10:34:12,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2019-08-05 10:34:12,595 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 72 states. [2019-08-05 10:34:16,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:16,315 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-08-05 10:34:16,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-08-05 10:34:16,315 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 71 [2019-08-05 10:34:16,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:16,316 INFO L225 Difference]: With dead ends: 74 [2019-08-05 10:34:16,317 INFO L226 Difference]: Without dead ends: 73 [2019-08-05 10:34:16,317 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=145, Invalid=5111, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:34:16,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-08-05 10:34:16,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-08-05 10:34:16,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-08-05 10:34:16,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-08-05 10:34:16,319 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-08-05 10:34:16,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:16,320 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-08-05 10:34:16,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-08-05 10:34:16,320 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-08-05 10:34:16,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-08-05 10:34:16,320 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:16,320 INFO L399 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-08-05 10:34:16,321 INFO L418 AbstractCegarLoop]: === Iteration 70 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:34:16,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:16,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1940788766, now seen corresponding path program 69 times [2019-08-05 10:34:16,321 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:16,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:16,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 211 conjunts are in the unsatisfiable core [2019-08-05 10:34:16,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:19,437 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:34:19,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:19,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-08-05 10:34:19,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-08-05 10:34:19,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-08-05 10:34:19,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2019-08-05 10:34:19,438 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 73 states. [2019-08-05 10:34:23,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:23,296 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-08-05 10:34:23,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-08-05 10:34:23,296 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 72 [2019-08-05 10:34:23,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:23,298 INFO L225 Difference]: With dead ends: 75 [2019-08-05 10:34:23,298 INFO L226 Difference]: Without dead ends: 74 [2019-08-05 10:34:23,298 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=147, Invalid=5255, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:34:23,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-08-05 10:34:23,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-08-05 10:34:23,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-08-05 10:34:23,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-08-05 10:34:23,301 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-08-05 10:34:23,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:23,302 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-08-05 10:34:23,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-08-05 10:34:23,302 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-08-05 10:34:23,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-08-05 10:34:23,302 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:23,302 INFO L399 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-08-05 10:34:23,303 INFO L418 AbstractCegarLoop]: === Iteration 71 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:34:23,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:23,303 INFO L82 PathProgramCache]: Analyzing trace with hash 34907627, now seen corresponding path program 70 times [2019-08-05 10:34:23,303 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:23,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:23,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 214 conjunts are in the unsatisfiable core [2019-08-05 10:34:23,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:26,805 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:34:26,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:26,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-08-05 10:34:26,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-08-05 10:34:26,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-08-05 10:34:26,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2019-08-05 10:34:26,807 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 74 states. [2019-08-05 10:34:30,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:30,816 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 10:34:30,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-08-05 10:34:30,817 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 73 [2019-08-05 10:34:30,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:30,818 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:34:30,818 INFO L226 Difference]: Without dead ends: 75 [2019-08-05 10:34:30,818 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=149, Invalid=5401, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:34:30,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-08-05 10:34:30,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-08-05 10:34:30,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-08-05 10:34:30,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-08-05 10:34:30,821 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-08-05 10:34:30,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:30,821 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-08-05 10:34:30,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-08-05 10:34:30,822 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-08-05 10:34:30,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-08-05 10:34:30,822 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:30,822 INFO L399 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-08-05 10:34:30,823 INFO L418 AbstractCegarLoop]: === Iteration 72 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:34:30,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:30,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1082134462, now seen corresponding path program 71 times [2019-08-05 10:34:30,824 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:31,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:31,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 217 conjunts are in the unsatisfiable core [2019-08-05 10:34:31,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:34,375 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:34:34,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:34,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-08-05 10:34:34,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:34:34,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:34:34,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:34:34,377 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 75 states. [2019-08-05 10:34:38,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:38,444 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 10:34:38,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:34:38,445 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 74 [2019-08-05 10:34:38,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:38,446 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:34:38,446 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:34:38,446 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=151, Invalid=5549, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:34:38,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:34:38,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 10:34:38,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:34:38,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 10:34:38,449 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-08-05 10:34:38,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:38,450 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 10:34:38,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:34:38,450 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 10:34:38,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:34:38,450 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:38,450 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-05 10:34:38,451 INFO L418 AbstractCegarLoop]: === Iteration 73 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:34:38,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:38,451 INFO L82 PathProgramCache]: Analyzing trace with hash -813572021, now seen corresponding path program 72 times [2019-08-05 10:34:38,452 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:39,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:39,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 220 conjunts are in the unsatisfiable core [2019-08-05 10:34:39,428 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:42,521 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:34:42,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:42,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:34:42,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-08-05 10:34:42,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-08-05 10:34:42,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2019-08-05 10:34:42,522 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 76 states. [2019-08-05 10:34:46,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:46,652 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-08-05 10:34:46,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-08-05 10:34:46,652 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 75 [2019-08-05 10:34:46,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:46,653 INFO L225 Difference]: With dead ends: 78 [2019-08-05 10:34:46,653 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:34:46,654 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=153, Invalid=5699, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:34:46,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:34:46,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:34:46,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:34:46,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 10:34:46,656 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-08-05 10:34:46,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:46,657 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 10:34:46,657 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-08-05 10:34:46,657 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 10:34:46,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:34:46,657 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:46,658 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-05 10:34:46,658 INFO L418 AbstractCegarLoop]: === Iteration 74 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:34:46,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:46,658 INFO L82 PathProgramCache]: Analyzing trace with hash 549069150, now seen corresponding path program 73 times [2019-08-05 10:34:46,659 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:47,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:47,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 223 conjunts are in the unsatisfiable core [2019-08-05 10:34:47,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:50,080 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:34:50,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:50,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-08-05 10:34:50,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-08-05 10:34:50,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-08-05 10:34:50,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2019-08-05 10:34:50,082 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 77 states. [2019-08-05 10:34:54,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:34:54,283 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-08-05 10:34:54,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-08-05 10:34:54,284 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 76 [2019-08-05 10:34:54,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:34:54,285 INFO L225 Difference]: With dead ends: 79 [2019-08-05 10:34:54,285 INFO L226 Difference]: Without dead ends: 78 [2019-08-05 10:34:54,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=155, Invalid=5851, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:34:54,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-08-05 10:34:54,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-08-05 10:34:54,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-08-05 10:34:54,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-08-05 10:34:54,288 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-08-05 10:34:54,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:34:54,288 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-08-05 10:34:54,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-08-05 10:34:54,288 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-08-05 10:34:54,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-08-05 10:34:54,289 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:34:54,289 INFO L399 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-08-05 10:34:54,289 INFO L418 AbstractCegarLoop]: === Iteration 75 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:34:54,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:34:54,289 INFO L82 PathProgramCache]: Analyzing trace with hash -158727509, now seen corresponding path program 74 times [2019-08-05 10:34:54,290 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:34:54,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:34:54,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 226 conjunts are in the unsatisfiable core [2019-08-05 10:34:54,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:34:58,061 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:34:58,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:34:58,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-08-05 10:34:58,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-08-05 10:34:58,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-08-05 10:34:58,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2019-08-05 10:34:58,062 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 78 states. [2019-08-05 10:35:02,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:02,461 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-08-05 10:35:02,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-08-05 10:35:02,461 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 77 [2019-08-05 10:35:02,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:02,462 INFO L225 Difference]: With dead ends: 80 [2019-08-05 10:35:02,462 INFO L226 Difference]: Without dead ends: 79 [2019-08-05 10:35:02,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=157, Invalid=6005, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:35:02,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-08-05 10:35:02,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-08-05 10:35:02,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-08-05 10:35:02,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-08-05 10:35:02,465 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-08-05 10:35:02,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:02,465 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-08-05 10:35:02,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-08-05 10:35:02,466 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-08-05 10:35:02,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-08-05 10:35:02,466 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:02,466 INFO L399 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-08-05 10:35:02,466 INFO L418 AbstractCegarLoop]: === Iteration 76 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:35:02,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:02,467 INFO L82 PathProgramCache]: Analyzing trace with hash -625587458, now seen corresponding path program 75 times [2019-08-05 10:35:02,467 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:02,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:02,997 INFO L256 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 229 conjunts are in the unsatisfiable core [2019-08-05 10:35:02,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:06,009 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:35:06,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:06,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-08-05 10:35:06,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-08-05 10:35:06,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-08-05 10:35:06,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2019-08-05 10:35:06,010 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 79 states. [2019-08-05 10:35:10,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:35:10,406 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-08-05 10:35:10,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-08-05 10:35:10,407 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 78 [2019-08-05 10:35:10,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:35:10,408 INFO L225 Difference]: With dead ends: 81 [2019-08-05 10:35:10,408 INFO L226 Difference]: Without dead ends: 80 [2019-08-05 10:35:10,409 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=159, Invalid=6161, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:35:10,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-08-05 10:35:10,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-08-05 10:35:10,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-08-05 10:35:10,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-08-05 10:35:10,411 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-08-05 10:35:10,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:35:10,411 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-08-05 10:35:10,411 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-08-05 10:35:10,411 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-08-05 10:35:10,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-08-05 10:35:10,412 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:35:10,412 INFO L399 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-08-05 10:35:10,412 INFO L418 AbstractCegarLoop]: === Iteration 77 === [squareErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2019-08-05 10:35:10,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:35:10,412 INFO L82 PathProgramCache]: Analyzing trace with hash 2081623307, now seen corresponding path program 76 times [2019-08-05 10:35:10,413 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:35:11,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:35:11,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 232 conjunts are in the unsatisfiable core [2019-08-05 10:35:11,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:35:14,662 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:35:14,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:35:14,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-08-05 10:35:14,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-08-05 10:35:14,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-08-05 10:35:14,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2019-08-05 10:35:14,664 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 80 states. Received shutdown request... [2019-08-05 10:35:17,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-08-05 10:35:17,105 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:35:17,110 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:35:17,110 INFO L202 PluginConnector]: Adding new model 2019ProgVerif-Sheet12Ex03-Square.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:35:17 BoogieIcfgContainer [2019-08-05 10:35:17,110 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:35:17,112 INFO L168 Benchmark]: Toolchain (without parser) took 248448.20 ms. Allocated memory was 132.1 MB in the beginning and 599.8 MB in the end (delta: 467.7 MB). Free memory was 108.5 MB in the beginning and 110.3 MB in the end (delta: -1.9 MB). Peak memory consumption was 465.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:35:17,113 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 132.1 MB. Free memory was 109.7 MB in the beginning and 109.5 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-08-05 10:35:17,113 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.70 ms. Allocated memory is still 132.1 MB. Free memory was 108.5 MB in the beginning and 106.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:35:17,114 INFO L168 Benchmark]: Boogie Preprocessor took 20.22 ms. Allocated memory is still 132.1 MB. Free memory was 106.7 MB in the beginning and 105.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:35:17,114 INFO L168 Benchmark]: RCFGBuilder took 269.67 ms. Allocated memory is still 132.1 MB. Free memory was 105.4 MB in the beginning and 96.1 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:35:17,115 INFO L168 Benchmark]: TraceAbstraction took 248123.00 ms. Allocated memory was 132.1 MB in the beginning and 599.8 MB in the end (delta: 467.7 MB). Free memory was 95.7 MB in the beginning and 110.3 MB in the end (delta: -14.7 MB). Peak memory consumption was 453.0 MB. Max. memory is 7.1 GB. [2019-08-05 10:35:17,118 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.20 ms. Allocated memory is still 132.1 MB. Free memory was 109.7 MB in the beginning and 109.5 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 30.70 ms. Allocated memory is still 132.1 MB. Free memory was 108.5 MB in the beginning and 106.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 20.22 ms. Allocated memory is still 132.1 MB. Free memory was 106.7 MB in the beginning and 105.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 269.67 ms. Allocated memory is still 132.1 MB. Free memory was 105.4 MB in the beginning and 96.1 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 248123.00 ms. Allocated memory was 132.1 MB in the beginning and 599.8 MB in the end (delta: 467.7 MB). Free memory was 95.7 MB in the beginning and 110.3 MB in the end (delta: -14.7 MB). Peak memory consumption was 453.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 11]: Timeout (TraceAbstraction) Unable to prove that procedure postcondition always holds (line 11). Cancelled while BasicCegarLoop was constructing difference of abstraction (80states) and FLOYD_HOARE automaton (currently 45 states, 80 states before enhancement),while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 248.0s OverallTime, 77 OverallIterations, 76 TraceHistogramMax, 123.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 157 SDtfs, 73 SDslu, 0 SDs, 0 SdLazy, 164555 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 101.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3153 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 109.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=76, 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.1s AutomataMinimizationTime, 76 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 10.5s SatisfiabilityAnalysisTime, 113.5s InterpolantComputationTime, 3157 NumberOfCodeBlocks, 3157 NumberOfCodeBlocksAsserted, 77 NumberOfCheckSat, 3080 ConstructedInterpolants, 0 QuantifiedInterpolants, 1593813 SizeOfPredicates, 80 NumberOfNonLiveVariables, 21329 ConjunctsInSsa, 9077 ConjunctsInUnsatCore, 77 InterpolantComputations, 1 PerfectInterpolantSequences, 0/76076 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown